✦ LIBER ✦

A generalized upper bounded technique for a linear fractional program

✍ Scribed by S. S. Chadhà

Publisher: Springer
Year: 1973
Tongue: English
Weight: 330 KB
Volume: 20
Category: Article
ISSN: 0026-1335
DOI: 10.1007/bf01893797

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalized upper bounding method for

A generalized upper bounding method for doubly coupled linear programs

✍ James K. Hartman; Leon S. Lasdon 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 902 KB

The transformation technique for a class

The transformation technique for a class of variable upper bounding constraits in linear programming

✍ Edward Y.H. Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 83 KB

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

A note on integer solutions to linear fr

A note on integer solutions to linear fractional interval programming problems by a branch & bound technique

✍ S. C. Agrawal; Mam Chand 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 311 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

A general upper bound for 1-widths

✍ J.R Henderson; R.A Dean 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 113 KB