000			01070nam a2200169Ia 4500
005			20241211205630.0
008			241211s1969 xx 000 0 und d
020			_afcnm1298
082			_a519.76I/M22
100			_aMangasarian, Olvi L.
245		0	_aNonlinear Programming
250			_a1ra
260			_aNew York : _bMc Graw Hill, _c1969
300			_a220 páginas
505			_a1.The nonlinear programming problem, preliminary concepts, and notation. 2.Linear inequalities and theorems of the alternative. 3.Convex sets in Rn. 4.Convex and concave functions. 5.Saddlepoint optimality criteria of nonlinear programming without differentiability. 6.Differentiable convex and concave functions. 7.Optimality criteria in nonlinear programming with differentiability. 8.Duality in Nonlinear programming. 9.Generalizations of convex functions: quasiconvex, strictly quasiconvex, and pseudoconvex functions. 10.Optimality and duality for generalized convex and concave functions. 11.Optimality and duality in the presence of nonlinear equality constraints.
942			_yLIB
999			_c50521 _d50521