01053nam a2200205Ia 450000500170000000800410001702000130005808200160007110000250008724500260011225000080013826000570014630000180020350504550022170000240067670000190070094200080071999900170072795201030074420241211205630.0241211s1979    xx            000 0 und d  afcnm1345  a519.76I/B29  aBazaraa, Mokhtar S.  0aNonlinear Programming  a1ra  aUnited States of America :bJohn Wiley & Sons,c1979  a638 páginas  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.  a Sherali, Hanif D.   a Shetty, C. M.  yLIB  c50568d50568  00104070aBE-FCNMbBE-FCNMcTPd2018-02-13eDonacionfBuenoo519.76I/B29pFCNM2291yLIBzInterno