An exterior point linear programming method based on inclusive normal cones

Journal of Industrial and Management Optimization

Volumn 6, Issue 4, 2010, Pages 825-846

  Liu, Yanqun ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Convergence.; Exterior point algorithm; Inclusive normal cones; Linear programming; Optimality

Indexed keywords

EID: 77957764526     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2010.6.825     Document Type: Article

References (6)

1. J. M. Borwein and A. S. Lewis, "Convex Analysis and Nonlinear Optimization. Theory and Examples," Second edition. CMS Books in Mathematics/Ouvrages de Mathmatiques de la SMC, 3. Springer, New York, 2006.
2. G. B. Dantzig, Maximization of a linear function of variables subject to linear inequalities, Activity Analysis of Production and Allocation, 339-347; Cowles Commission Monograph No. 13. John Wiley & Sons, Inc., New York, N. Y.; Chapman & Hall, Ltd., London, 1951.
3. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), 373-395
4. L. G. Khachiyan, A polynomial algorithm in linear programming, Doklady Akademii Nauk SSSR-S, 244 (1979), 1093-1096; translated in Soviet Mathematics Doklady, 20 (1979), 191-194.
5. T. Terlaky and S. Zhang, Pivot rules for linear programming: A survey on recent theoretical developments, Annals of Operations Research, 46 (1993), 203-233
6. R. J. Vanderbei, "Linear Programming - Foundations and Extensions," 3rd Ed., International Series in Operations Research & Management Science, 114, Springer, New York, 2008.