000			00937nam a2200193Ia 4500
005			20241211205630.0
008			241211s1979 xx 000 0 und d
020			_afcnm1345
082			_a519.76I/B29
100			_aBazaraa, Mokhtar S.
245		0	_aNonlinear Programming
250			_a1ra
260			_aUnited States of America : _bJohn Wiley & Sons, _c1979
300			_a638 páginas
505			_a1.Introduction. 2.Convex sets 3.Convex functions and generalizations. 4.The fritz John and the Karush-Kuhn-tucker optimality conditions. 5.Constraint qualifications. 6.LaGrange duality and Saddle point optimality conditions. 7.The concept of an algorithm. 8.Unconstrained optimization. 9.Penalty and barrier functions. 10.Methods of feasible directions. 11.Linear complementary problem and quadratic, separable, fractional, and geometric programming.
700			_a Sherali, Hanif D.
700			_a Shetty, C. M.
942			_yLIB
999			_c50568 _d50568