Progress in Mathematical Programming

SOMMARIO

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.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9781461396192
• Dimensioni: 235 x 155 mm
• Formato: Brossura
• Illustration Notes: X, 158 p.
• Pagine Arabe: 158
• Pagine Romane: x