01016nam a2200181Ia 450000500170000000800410001702000130005808200150007110000210008624500510010725000080015826000440016630000180021050504790022894200080070799900170071595201020073220241211205636.0241211s1986    xx            000 0 und d  afcnm1727  a519.3I/M61  aMinoux, Michael. 0aMathematical Programming Theory and Algorithms  a1ra  aNew  York :bJhon Wiley and Sons,c1986  a489 páginas  a1.Fundamental concepts. 2.Linear programming. 3.One-dimensional optimization. 4.Nonlinear, unconstrained optimization. 5.Nonlinear optimization with constrained. I direct (or Primal) methods. 6.Nonlinear constrained optimization. II dual methods. 7.Integer programming. 8.Solution of large-scale programming problems. Generalized linear programming and programming and decomposition techniques. 9.Dynamics programming. 10.Optimization in infinite dimension and applications.  yLIB  c50948d50948  00104070aBE-FCNMbBE-FCNMcTPd2018-05-15eDonacionfBuenoo519.3I/M61pFCNM2979yLIBzInterno