Servicios Personalizados
Revista
Articulo
Indicadores
- Citado por SciELO
- Accesos
Links relacionados
- Citado por Google
- Similares en SciELO
- Similares en Google
Compartir
Ingeniería e Investigación
versión impresa ISSN 0120-5609
Resumen
RAMIREZ, A. L; BUITRAGO, O; BRITTO, R. A y 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.
Palabras clave : linear programming; optimisation; orthogonal projection; parametric equation.