New approaches to linear and nonlinear programming
During the last twelve months, research has concentrated on barrier- function methods for linear programming (LP) and quadratic programming (QP). Some ground-work for the application of barrier methods to nonlinearly constrained problems has also begun. In our previous progress report we drew attention to the difficulty of developing robust implementations of barrier methods for LP. We have continued to refine both the primal algorithm and the dual algorithm. We still do not claim that the barrier algorithms are as robust as the simplex method; however, the dual algorithm has solved all the problems in our extensive test set. We have also gained some experience with using the algorithms to solve aircrew scheduling problems.
- Publication Date:
- OSTI Identifier:
- Report Number(s):
- DOE Contract Number:
- Resource Type:
- Technical Report
- Research Org:
- Stanford Univ., CA (United States). Dept. of Operations Research
- Sponsoring Org:
- DOE; USDOE, Washington, DC (United States)
- Country of Publication:
- United States
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; LINEAR PROGRAMMING; ITERATIVE METHODS; NONLINEAR PROGRAMMING; ALGORITHMS; PROGRESS REPORT; DOCUMENT TYPES; MATHEMATICAL LOGIC; PROGRAMMING 990200* -- Mathematics & Computers
Enter terms in the toolbar above to search the full text of this document for pages containing specific keywords.