𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A projective method for linear programming with box-type constraints

✍ Scribed by G. Rinaldi

Publisher
Springer
Year
1986
Tongue
English
Weight
423 KB
Volume
1
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A projective simplex method for linear p
A projective simplex method for linear programming
✍ Ping-Qi Pan πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 189 KB

Linear programming problems with quite square coecient matrix form a wide range of problems that are not amenable to existing algorithms. The method proposed in this paper attacks such problems from the dual side, alternatively arranging computations of the simplex method using the QR factorization.

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