On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
- 50 Downloads
In Ref. 1, Bazaraa and Goode provided an algorithm for solving a nonlinear programming problem with linear constraints. In this paper, we show that this algorithm possesses good convergence properties.
Key WordsNonlinear programming linear constraints algorithms quasiconvex functions pseudoconvex functions global convergence
Unable to display preview. Download preview PDF.
- 1.Bazaraa, M. S., andGoode, J. J.,A Least-Distance Programming Procedure for Minimization Problems under Linear Constraints, Journal of Optimization Theory and Applications, Vol. 40, No. 4, 1983.Google Scholar
- 2.Bazaraa, M. S., andShetty, C. M.,Nonlinear Programming Theory and Algorithms, John Wiley and Sons, New York, New York, 1979.Google Scholar
© Plenum Publishing Corporation 1986