✦ LIBER ✦

Rigorous Lower and Upper Bounds in Linear Programming

✍ Scribed by Jansson, Christian

Book ID: 118205090
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 228 KB
Volume: 14
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623402416839

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and lower bounds in quantum mechan

Upper and lower bounds in quantum mechanical perturbation theory using linear programming

✍ R.P. Futrelle; D.A. McQuarrie 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Upper and lower bounds to quantum mechanical second order perturbation quantities are found using the method of Linear Programming. In this paper bounds on the polarizability of hydrogen, helium and neon are obtained using the sum rules popularized by Dalgarno.

Rigorous lower and upper bounds for the

Rigorous lower and upper bounds for the slope parameter

✍ B.K. Chung 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Rigorous upper and lower bounds on the n

Rigorous upper and lower bounds on the non-linear susceptibility of the Mattis model

✍ Kei-ichi Kondo 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Lower and upper bounds for linear produc

Lower and upper bounds for linear production games

✍ Endre Bjørndal; Kurt Jörnsten 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 901 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≤ 8 are tabulated. It turns out