Journal article
New purification algorithms for linear programming
Naval research logistics, Vol.35(4), pp.571-583
08/1988
DOI: 10.1002/1520-6750(198808)35:4<571::AID-NAV3220350410>3.0.CO;2-L
Abstract
Two new algorithms are presented for solving linear programs which employ the opposite-sign property defined for a set of vectors in m space. The first algorithm begins with a strictly positive feasible solution and purifies it to a basic feasible solution having objective function value no less under maximization. If this solution is not optimal, then it is drawn back into the interior with the same objective function value, and a restart begins. The second algorithm can begin with any arbitrary feasible point. If necessary this point is purified to a basic feasible solution by dual-feasibility–seeking directions. Should dual feasibility be attained, then a duality value interval is available for estimating the unknown objective function value. If at this juncture the working basis is not primal feasible, then further purification steps are taken tending to increase the current objective function value, while simultaneously seeking another dual feasible solution. Both algorithms terminate with an optimal basic solution in a finite number of steps.
Details
- Title: Subtitle
- New purification algorithms for linear programming
- Creators
- K. O. Kortanek - University of IowaZhu Jishan - Department of Management Science, University of Iowa, United States
- Resource Type
- Journal article
- Publication Details
- Naval research logistics, Vol.35(4), pp.571-583
- DOI
- 10.1002/1520-6750(198808)35:4<571::AID-NAV3220350410>3.0.CO;2-L
- ISSN
- 0894-069X
- eISSN
- 1520-6750
- Number of pages
- 13
- Language
- English
- Date published
- 08/1988
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963097002771
Metrics
1 Record Views