Quasi-convex programming revisited (Q1064272): Difference between revisions

This article deals with necessary and sufficient conditions of optimality for a nonlinear programming problem with quasi-convex objective and constraint functions. It is strictly related to a paper by \textit{S. Mititelu} [Rev. Roum. Math. Pures Appl. 21, 903-909 (1976; Zbl 0351.90058)] and provides new proofs of two theorems given in Mititelu's paper which, according to the author, were incorrectly proven.