A new method for linear programming

Liu, Y 2009, 'A new method for linear programming', in C. Ma, L. Yu, D. Zhang, Z. Zhou (ed.) Lecture Notes in Decision Science: Vol 12 Global Optimization: Theory, Method and Applications I, Changsha, China, 1-5 June 2009, pp. 1109-1113.


Document type: Conference Paper
Collection: Conference Papers

Title A new method for linear programming
Author(s) Liu, Y
Year 2009
Conference name First World Congress on Global Optimization in Engineering & Science (WCGO2009)
Conference location Changsha, China
Conference dates 1-5 June 2009
Proceedings title Lecture Notes in Decision Science: Vol 12 Global Optimization: Theory, Method and Applications I
Editor(s) C. Ma, L. Yu, D. Zhang, Z. Zhou
Publisher Global-Link Publisher
Place of publication Hong Kong
Start page 1109
End page 1113
Total pages 5
Abstract In this paper, we present the main idea of a new exterior point method based on inclusice normal cones for solving the general linear programming problem in canonical form. An algorithm, termed targeted climbing ladder algorithm, is developed with proven finite convergence. The algorithms are tested by solving a number of linear programming examples. Initial numerical results have shown an encouraging performance.
Subjects Applied Mathematics not elsewhere classified
Keyword(s) Linear programming
inclusive normal cones
algorithm
convergence
Copyright notice © Global-Link Publisher, Hong Kong, 2009
ISSN 1727-2270
Versions
Version Filter Type
Access Statistics: 96 Abstract Views  -  Detailed Statistics
Created: Wed, 17 Jul 2013, 15:02:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us