000			03288nam a2200409 i 4500
008			040604t20042004maua b 001 0 eng
020			_a1402080980 _q(HB)
020			_a9781402080982 _q(HB)
020			_a1402080999 _q(E-book)
020			_a9781402080999 _q(E-book)
035			_a(OCoLC)55633780 _z(OCoLC)56445168
040			_aDLC _beng _cDLC _dC#P _dOHX _dXTL _dBAKER _dNLGGC _dBTCTA _dYDXCP _dUKM _dIG# _dW2U _dDEBBG _dILU _dBDX _dOCLCF _dOCLCO _dOCLCQ _dUtOrBLW _dBAUN _erda
049			_aBAUN_MERKEZ
050	0	4	_aQA402.5 _b.J584 2004
082	0	0	_222
100	1		_aJongen, H. Th. _q(Hubertus Th.), _d1947-
245	1	0	_aOptimization theory / _cby Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch
264		1	_aBoston : _bKluwer Academic Publishers, _c[2004]
264		4	_c©2004
300			_axi, 443 pages : _billustrations ; _c25 cm
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
504			_aIncludes bibliographical references (pages 427-443) and indexes
505	0	0	_tOptimality criteria on simple regions _t-- Constraints, lagrange function, optimality _t-- Parametric aspects, semi-infinite optimization _t-- Convex functions, duality, separation theorem _t-- Linear inequalities, constraint qualifications _t-- Linear programming : the simplex method _t-- The ellipsoid method _t-- Karmarkar's method for linear programming _t-- Order of convergence, steepest descent _t-- Conjugate direction, variable metric _t-- Penalty-, barrier-, multiplier-, IP-methods _t-- Search methods without derivatives _t-- One-dimensional minimization _t-- Graphs and networks _t-- Flows in networks _t-- Applications of the max-flow min-cut theorem _t-- Integer linear programming _t-- Computability; the turing machine _t-- Complexity theory _t-- Reducibility and NP-completeness _t-- Some NP-completeness results _t-- The random access machine _t-- Complexity theory over the real numbers _t-- Approximating NP-hard problems _t-- Approximation algorithms for TSP _t-- Approximation algorithms for bin packing _t-- A FPTAS for knapsack _t-- Miscellaneous
520	1		_a"Optimization Theory is becoming a more and more important mathematical as well as interdisciplinary area, especially in the interplay between mathematics and many other sciences like computer science, physics, engineering, operations research, etc." "This volume gives a comprehensive introduction into the theory of (deterministic) optimization on an advanced undergraduate and graduate level." "One main feature is the treatment of both continuous and discrete optimization at the same place. This allows the study of the problems from different points of view, supporting a better understanding of the entire field."
520	8		_a"Audience: The book can be adapted well as an introductory textbook into optimization theory on a basis of a two semester course: however, each of its parts can also be taught separately. Many exercise are included to increase the readers' understanding."--Jacket
650		0	_aMathematical optimization
650		0	_aMaxima and minima
650		4	_aOptimización matemática
650		4	_aMáximos y mínimos
700	1		_aMeer, Klaus
700	1		_aTriesch, Eberhard
900			_a19947
900			_bSatın
942			_2lcc _cKT
999			_c16865 _d16865