Progress in Mathematical Programming: Interior-Point and Related Methods

by Nimrod Megiddo (Editor)

Overview

The starting point of this volume was a conference entitled "Progress in Mathematical Programming", held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarka's algorithm. Presentations included new algorithms, new analysis of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming.

Product Details

ISBN-13:	9781461396192
Publisher:	Springer New York
Publication date:	12/14/2011
Edition description:	Softcover reprint of the original 1st ed. 1989
Pages:	158
Product dimensions:	6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

1 An Algorithm for Solving Linear Programming Problems in O(n3L) Operations.- 2 A Primal-Dual Interior Point Algorithm for Linear Programming.- 3 An Extension of Karmarkar’s Algorithm and the Trust Region Method for Quadratic Programming.- 4 Approximate Projections in a Projective Method for the Linear Feasibility Problem.- 5 A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytype.- 6 A Note on Comparing Simplex and Interior Methods for Linear Programming.- 7 Pricing Criteria in Linear Programming.- 8 Pathways to the Optimal Set in Linear Programming.

Editorial Reviews

Eight papers presented at a conference in Pacific Grove, Ca. March 1987 deal with developments in the theory and practice of linear programming. No index. Acidic paper. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews