DocumentCode
3079774
Title
A class of methods of admissible directions for linear programming
Author
Korytowski, Adam
Author_Institution
Academy of Mining and Metallurgy, Krak??w, Poland
fYear
1986
fDate
10-12 Dec. 1986
Firstpage
1850
Lastpage
1851
Abstract
A new class of linear programming algorithms is proposed. They differ from simplex and reduced gradient methods by a systematic use of inner, or strictly admissible search directions. The purpose is to implement the idea that one step along a search direction pointing to the relative interior of the admissible set can spare many steps along its relative boundary. Finiteness of the algorithms is proved and some computational aspects are discussed.
Keywords
Convergence; Cost function; Gradient methods; Linear programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1986 25th IEEE Conference on
Conference_Location
Athens, Greece
Type
conf
DOI
10.1109/CDC.1986.267306
Filename
4049112
Link To Document