A new algorithm for solving linear programming problems

Fuente: Redalyc
Saved in:
Bibliographic Details
Main Author: A. L. Ramírez
Format: Artículo científico
Language:en
Published: Universidad Nacional de Colombia 2012
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1876485310461771776
author A. L. Ramírez
author_facet A. L. Ramírez
contents A new algorithm for solving linear programming problems A. L. Ramírez O. Buitrago R. A. Britto A. Fedossova Ingeniería optimisation Linear programming parametric equation orthogonal projection 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. 2012 artículo científico 0120-5609 https://www.redalyc.org/articulo.oa?id=64323232013 en http://www.redalyc.org/revista.oa?id=643 Ingeniería e Investigación application/pdf Universidad Nacional de Colombia Ingeniería e Investigación (Colombia) Num.2 Vol.32
format Artículo científico
id redalyc_64323232013
institution Redalyc
language en
publishDate 2012
publisher Universidad Nacional de Colombia
spellingShingle A new algorithm for solving linear programming problems
A. L. Ramírez
Ingeniería
optimisation
Linear programming
parametric equation
orthogonal projection
A new algorithm for solving linear programming problems A. L. Ramírez O. Buitrago R. A. Britto A. Fedossova Ingeniería optimisation Linear programming parametric equation orthogonal projection 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. 2012 artículo científico 0120-5609 https://www.redalyc.org/articulo.oa?id=64323232013 en http://www.redalyc.org/revista.oa?id=643 Ingeniería e Investigación application/pdf Universidad Nacional de Colombia Ingeniería e Investigación (Colombia) Num.2 Vol.32
title A new algorithm for solving linear programming problems
topic Ingeniería
optimisation
Linear programming
parametric equation
orthogonal projection
url https://www.redalyc.org/articulo.oa?id=64323232013