A "feasible direction" search for Lineal Programming problem solving
The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual) program is solved by a "feasible directio...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad Nacional de Colombia
2003-07-01
|
Series: | Ingeniería e Investigación |
Subjects: | |
Online Access: | https://revistas.unal.edu.co/index.php/ingeinv/article/view/14703 |