Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Bazaraa, M. S., andShetty, C. M.,Nonlinear Programming Theory and Algorithms, John Wiley and Sons, New York, New York, 1979.
Author information
Authors and Affiliations
Additional information
Communicated by D. G. Luenberger
This paper was written under the guidance of Associate Professor C. Y. Wang. The author takes great pleasure in thanking him.
Rights and permissions
About this article
Cite this article
Xue, G.L. On convergence properties of a least-distance programming procedure for minimization problems under linear constraints. J Optim Theory Appl 50, 365–370 (1986). https://doi.org/10.1007/BF00939279
Issue Date:
DOI: https://doi.org/10.1007/BF00939279