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!
|