✦ LIBER ✦

An algorithm for solving a structured class of linear programming problems

✍ Scribed by S.Selcuk Erenguc

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 452 KB
Volume: 4
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(86)90032-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Inequality Sorting Algorithm for a Cl

An Inequality Sorting Algorithm for a Class of Linear Programming Problems

✍ V. Lakshmikantham; S.K. Sen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 282 KB

An interactive algorithm for solving mul

An interactive algorithm for solving multiple objective integer linear programming problems

✍ Subhash C. Narula; Vassil Vassilev 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB

An algorithm for solving general D.C. pr

An algorithm for solving general D.C. programming problems

✍ Thai Quynh Phong 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 324 KB

An algorithm for solving general fractio

An algorithm for solving general fractional interval programming problems

✍ A. Charnes; Daniel Granot; Frieda Granot 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 524 KB

An efficient algorithm for solving const

An efficient algorithm for solving constrained nonlinear programming problems

✍ Bruce R. Feiring; Don T. Phillips 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 784 KB

A steepest edge active set algorithm for

A steepest edge active set algorithm for solving sparse linear programming problems

✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations