A Steepest Feasible Direction Method for Linear Programming. Derivation and Embedding In the Simplex Method
A feasible direction method for linear programming has been proposed. The method is embedded in the framework of the simplex method, even though it works with non-edge feasible directions. The direction used is the steepest in the space of all variables or an approximation thereof, and it is found b...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wrocław University of Science and Technology
2024-01-01
|
| Series: | Operations Research and Decisions |
| Online Access: | https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no2_10.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A feasible direction method for linear programming has been proposed. The method is embedded in the framework of the simplex method, even though it works with non-edge feasible directions. The direction used is the steepest in the space of all variables or an approximation thereof, and it is found by solving a strictly convex quadratic program in the space of the nonbasic variables. Further, this program guarantees the feasibility of the direction even in the case of degeneracy. To remain within the simplex framework, the direction is represented by an auxiliary, or external, nonbasic column, which is a nonnegative linear combination of original nonbasic columns. We have made an experimental evaluation of the suggested method on both nondegenerate and highly degenerate problem instances. The overall results are very promising for continued research along this line, especially concerning various computational strategies that can be applied when the method is implemented. (original abstract) |
|---|---|
| ISSN: | 2081-8858 2391-6060 |