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
โฆ LIBER โฆ
An orientation method for central projection programs
โ Scribed by David P. Anderson
- Book ID
- 118382928
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 284 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0097-8493
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An interior feasible direction method wi
โ
J.A. Snyman
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 745 KB
Projection and contraction methods for s
โ
Qiaoming Han
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 118 KB
A projective simplex method for linear p
โ
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 approximate projection method for inc
โ
David E. Stevens; Stevens T. Chan; Phil Gresho
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 313 KB
๐ 1 views
An Orientation Program for Unlicensed As
โ
Denise Bauer Nyberg; Jamie L. Campbell
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 572 KB
An interactive projection method for mul
โ
Ferreira, P.A.V.; Geromel, J.C.
๐
Article
๐
1990
๐
Institute of Electrical and Electronics Engineers
โ 984 KB