| 000 | 01715nam a2200301 a 4500 | ||
|---|---|---|---|
| 001 | vtls000035793 | ||
| 003 | KUKTEM | ||
| 005 | 20251117150058.0 | ||
| 008 | 090430t2009 paua f b 001 0 eng d | ||
| 020 | _a9780898716610 | ||
| 020 | _a0898716616 | ||
| 039 | 9 |
_a201107132310 _bVLOAD _c201003161532 _dfauzi _c200908141541 _dVLOAD _c200908141511 _dVLOAD _y200904301146 _zsaini |
|
| 040 | _aUMP | ||
| 090 | _aT57.74 .G75 2009 | ||
| 100 | 1 | _aGriva, Igor | |
| 245 | 1 | 0 |
_aLinear and nonlinear optimization / _cIgor Griva, Stephen G. Nash, Ariela Sofer |
| 250 | _a2nd ed. | ||
| 260 |
_aPhiladelphia : _bSociety for Industrial and Applied Mathematics, _cc2009 |
||
| 300 |
_axxii, 742 p. : _bill. ; _c27 cm. |
||
| 504 | _aIncludes bibliographical references (p. 707-725) and index | ||
| 505 | 0 | _aOptimization models -- Fundamentals of optimization -- Representation of linear constraints -- Geometry of linear programming -- The simplex method -- Duality and sensitivity -- Enhancements of the simplex method -- Network problems -- Computational complexity of linear programming -- Interior-point methods of linear programming -- Basics of unconstrained optimization -- Methods for unconstrained optimization -- Low-storage methods for unconstrained problems -- Optimality conditions for constrained problems -- Feasible-point methods -- Penalty and barrier methods | |
| 650 | 0 | _aLinear programming | |
| 650 | 0 | _aNonlinear programming | |
| 700 | 1 | _aNash, Stephen | |
| 700 | 1 | _aSofer, Ariela | |
| 856 | 4 | 1 |
_3Table of contents only _uhttp://www.loc.gov/catdir/enhancements/fy0903/2008032477-t.html |
| 999 |
_aVIRTUA40 _c50966 _d50972 |
||
| 999 | _aVTLSSORT0080*0200*0201*0400*0900*1000*2450*2500*2600*3000*5040*5050*6500*6501*7000*7001*8560*9991 | ||