✦ LIBER ✦

A generalized upper bounding method for doubly coupled linear programs

✍ Scribed by James K. Hartman; Leon S. Lasdon

Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 902 KB
Volume: 17
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800170402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A non-linear programming method approach

A non-linear programming method approach for upper bound limit analysis

✍ M. Vicente da Silva; A. N. Antão 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

Upper bounds for A(n,4) and A(n,6) deriv

Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound

✍ C. Roos; C. de Vroedt 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 878 KB

An appropriate version of the linear programming bound of Delsarte for binary codes is used to find explicit upper bounds for A(n, d), with d ~(4.6). These bounds are expected to be at least as good as tAe linear programming bound of Delsarte itself. It is re-established that the Preparata codes are