A new algorithm for solving linear programming problems
Document Type
Article
Publication Date
1-1-2012
Publication Title
Ingenieria e Investigacion
Abstract
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.
Volume
32
Issue
2
First Page
68
Last Page
73
ISSN
01205609
Recommended Citation
Ramírez, A. L.; Buitrago, O.; Britto, R. A.; and Fedossova, A., "A new algorithm for solving linear programming problems" (2012). Scopus Unisalle. 596.
https://ciencia.lasalle.edu.co/scopus_unisalle/596
Identifier
SCOPUS_ID:84865358416