000 01576nam a2200337 i 4500
008 050901s2006 njua b 001 0 eng
010 _a2005054230
020 _a0471486000
_q(cloth : alkaline paper)
024 3 _a9780471486008
040 _aDLC
_beng
_cDLC
_dBAKER
_dUKM
_dC#P
_dBAUN
_erda
049 _aBAUN_MERKEZ
050 0 4 _aT57.8
_b.B39 2006
082 0 0 _222
100 1 _aBazaraa, M. S
245 1 0 _aNonlinear programming :
_btheory and algorithms /
_cMokhtar S. Bazaraa, Hanif D. Sherali, C.M. Shetty
250 _a3rd ed
264 1 _aHoboken, N.J. :
_bWiley-Interscience,
_c[2006]
264 4 _c©2006
300 _axv, 853 pages :
_billustrations ;
_c25 cm
336 _atext
_btxt
_2rdacontent
337 _aunmediated
_bn
_2rdamedia
338 _avolume
_bnc
_2rdacarrier
504 _aIncludes bibliographical references (pages 779-841) and index
505 0 0 _tContents
_tCh. 1 Introduction
_tCh. 2 Convex sets
_tCh. 3 Convex functions and generalizations
_tCh. 4 The Fritz John and Karush-Kuhn-Tucker optimality conditions
_tCh. 5 Constraint qualifications
_tCh. 6 Lagrangian duality and saddle point optimality conditions
_tCh. 7 The concept of an algorithm
_tCh. 8 Unconstrained optimization
_tCh. 9 Penalty and barrier functions
_tCh. 10 Methods of feasible directions
_tCh. 11 Linear complementary problem, and quadratic, separable, fractional, and geometric programming
650 0 _aNonlinear programming
700 1 _aSherali, Hanif D.,
_d1952-
700 1 _aShetty, C. M.,
_d1929-
900 _a31175
900 _bsatın
942 _2lcc
_cKT
999 _c27772
_d27772