Using Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming Problem
Abstract
We presented a feasible direction method to find all optimal extreme points for the linear programming problem. Our method depends on the conjugate gradient projection method starting with an initial point we generate a sequence of feasible directions towards all alternative extremes.
DOI: https://doi.org/10.3844/jmssp.2007.109.111
Copyright: © 2007 S. F. Tantawy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,522 Views
- 3,158 Downloads
- 2 Citations
Download
Keywords
- Linear program
- conjugate projection