A practical anti-cycling procedure for linearly constrained optimization

作者: Philip E. Gill , Walter Murray , Michael A. Saunders , Margaret H. Wright

DOI: 10.1007/BF01589114

关键词: Constrained optimizationLinear programmingNumerical analysisSet (abstract data type)Simplex algorithmMathematicsMathematical optimizationSequenceDegeneracy (mathematics)Reliability (computer networking)

摘要: A procedure is described for preventing cycling in active-set methods linearly constrained optimization, including the simplex method. The key ideas are a limited acceptance of infeasibilities all variables, and maintenance “working” feasibility tolerance that increases over long sequence iterations. additional work per iteration nominal, “stalling” cannot occur with exact arithmetic. method appears to be reliable, based on computational results first 53 linear programming problems theNetlib set.

参考文章(35)
Edward S. Klotz, Dynamic Pricing Criteria in Linear Programming Defense Technical Information Center. ,(1988) , 10.21236/ADA198945
Julie Carolyn Falkner, Bus crew scheduling and the set partitioning model ResearchSpace@Auckland. ,(1988)
B. A. Murtagh, M. A. Saunders, MINOS 5. 0 user's guide Defense Technical Information Center. ,(1983) , 10.21236/ADA138522
J. C. Falkner, D. M. Ryan, Aspects of Bus Crew Scheduling Using a Set Partitioning Model Computer-Aided Transit Scheduling. pp. 91- 103 ,(1988) , 10.1007/978-3-642-85966-3_9
George Dantzig, Alexander Orden, Philip Wolfe, THE GENERALIZED SIMPLEX METHOD FOR MINIMIZING A LINEAR FORM UNDER LINEAR INEQUALITY RESTRAINTS Pacific Journal of Mathematics. ,vol. 5, pp. 183- 195 ,(1955) , 10.2140/PJM.1955.5.183
R. FLETCHER, M. P. JACKSON, Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds Ima Journal of Applied Mathematics. ,vol. 14, pp. 159- 174 ,(1974) , 10.1093/IMAMAT/14.2.159