✦ LIBER ✦

An algorithm of internal feasible directions for linear integer programming

✍ Scribed by Vassil Vassilev; Krassimira Genova

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 847 KB
Volume: 52
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90081-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for non-linear int

An improved algorithm for non-linear integer programming

✍ Mary W. Cooper 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 511 KB

An exact ceiling point algorithm for gen

An exact ceiling point algorithm for general integer linear programming

✍ Robert M. Saltzman; Frederick S. Hillier 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 908 KB

An algorithm for the multiple objective

An algorithm for the multiple objective integer linear programming problem

✍ Dieter Klein; Edward Hannan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 785 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 implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

An interior feasible direction method wi

An interior feasible direction method with constraint projections for linear programming

✍ J.A. Snyman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 745 KB

A new feasible direction method for linear programming problems is presented. The method is not boundary following. The method proceeds from a feasible interior point in a direction that improves the objective function until a point on a constraint surface is met. At this point searches are initiate