✦ LIBER ✦

A constraint selection technique for a class of linear programs

✍ Scribed by Danny C. Myers; Wei Shih

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 517 KB
Volume: 7
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(88)90027-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Class of Quadratic Programs with Linea

A Class of Quadratic Programs with Linear Complementarity Constraints

✍ Xiaojun Chen; Jane J. Ye 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 439 KB

Polynomial algorithms for a class of lin

Polynomial algorithms for a class of linear programs

✍ J. F. Maurras; K. Truemper; M. Akgül 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 858 KB

A class of methods for linear programmin

A class of methods for linear programming

✍ Markku Kallio; Evan L. Porteus 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 436 KB

A procedure for parameterizing a constra

A procedure for parameterizing a constraint in linear programming

✍ Hannu Väliaho 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 733 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 Parallel Algorithm for Linear Programs

A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo