SciELO - Scientific Electronic Library Online

 
vol.32 issue2The application of and unresolved problems regarding the use of objectives in software engineeringA classifier model for detecting pronunciation errors regarding the Nasa Yuwe language's 32 vowels author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Ingeniería e Investigación

Print version ISSN 0120-5609

Abstract

RAMIREZ, A. L; BUITRAGO, O; BRITTO, R. A  and  FEDOSSOVA, A. A new algorithm for solving linear programming problems. Ing. Investig. [online]. 2012, vol.32, n.2, pp.68-73. ISSN 0120-5609.

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.

Keywords : linear programming; optimisation; orthogonal projection; parametric equation.

        · abstract in Spanish     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License