000			03232nmm a2200205Ia 4500
008			230306s9999||||xx |||||||||||||||||und||
020			_a9780821877029 (online)
245		0	_aMathematical developments arising from linear programming : _bproceedings of a joint summer research conference held at Bowdoin College, June 25July 1, 1988
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _cc1990
300			_a1 online resource (xiv, 341 p.)
490			_aContemporary mathematics _vv. 114 _x10983627
500			_aThe AMSIMSSIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming was held at Bowdoin College, Brunswick, Maine, on June 25July 1, 1988T.p. verso.
504			_aIncludes bibliographical references.
505			_tSome recent results on convex polytopes ; Probabilistic analysis of the simplex method ; On solving the linear programming problem approximately ; Riemannian geometry underlying interiorpoint methods for linear programming ; Steepest descent, linear programming, and Hamiltonian flows ; An _O(n^3L) _ potential reduction algorithm for linear programming ; I. I. Dikin's convergence result for the affinescaling algorithm ; Phase _1 _ search directions for a primaldual interior point method for linear programming ; Some results concerning convergence of the affine scaling algorithm ; Dual ellipsoids and degeneracy in the projective algorithm for linear programming ; A note on limiting behavior of the projective and the affine rescaling algorithms ; On the convergence behavior of trajectories for linear programming ; Limiting behavior of the affine scaling continuous trajectories for linear programming problems ; Convergence and boundary behavior of the projective scaling trajectories for linear programming ; On the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path ; Canonical problems for quadratic programming and projective methods for their solution ; An interior point algorithm for solving smooth convex programs based on Newton's method ; A modified Kantorovich inequality for the convergence of Newton's method ; An interiorpoint approach to NPcomplete problems. I ; Solving matching problems using Karmarkar's algorithm ; Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization _rCarl W Lee ; KarlHeinz Borgwardt ; Nimrod Megiddo ; Narendra Karmarkar ; A M Bloch ; Yinyu Ye ; R J Vanderbei and J C Lagarias ; Irvin J Lustig ; Earl R Barnes ; Kurt M Anstreicher ; Miroslav D Asic Vera V KovacevicVujcic and Mirjana D RadosavljevicNikolic ; Christoph Witzgall Paul T Boggs and Paul D Domich ; Ilan Adler and Renato D C Monteiro ; Renato D C Monteiro ; F Jarre G Sonnevend and J Stoer ; Bahman Kalantari ; Sanjay Mehrotra and Jie Sun ; A A Goldstein ; Narendra Karmarkar ; John E Mitchell and Michael J Todd ; S S Abhyankar T L Morin and T Trafalis
650			_aLinear programming
650			_aProgramming (Mathematics)
700			_aLagarias Jeffrey C
700			_aTodd Michael J
856			_uhttp://www.ams.org/conm/114/
999			_c28529 _d28529