Progress in Mathematical Programming Interior-Point and Related Methods Editors (view affiliations) Nimrod Megiddo Book 188 Citations 22 Readers 1.4k Downloads
Chapters Table of contents (8 chapters) About About this book Table of contents Search within book Front Matter Pages i-x PDF An Algorithm for Solving Linear Programming Problems in O(n3L) Operations Clovis C. Gonzaga Pages 1-28 A Primal-Dual Interior Point Algorithm for Linear Programming Masakazu Kojima, Shinji Mizuno, Akiko Yoshise Pages 29-47 An Extension of Karmarkar’s Algorithm and the Trust Region Method for Quadratic Programming Yinyu Ye Pages 49-63 Approximate Projections in a Projective Method for the Linear Feasibility Problem Jean-Philippe Vial Pages 65-78 A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope Pravin M. Vaidya Pages 79-90 A Note on Comparing Simplex and Interior Methods for Linear Programming J. A. Tomlin Pages 91-103 Pricing Criteria in Linear Programming J. L. Nazareth Pages 105-129 Pathways to the Optimal Set in Linear Programming Nimrod Megiddo Pages 131-158 About this book Keywords algorithm algorithms linear optimization optimization programming Editors and affiliations Nimrod Megiddo11.IBM Research DivisionAlmaden Research CenterSan JoseUSA Bibliographic information DOI https://doi.org/10.1007/978-1-4613-9617-8 Copyright Information Springer-Verlag New York 1989 Publisher Name Springer, New York, NY eBook Packages Springer Book Archive Print ISBN 978-1-4613-9619-2 Online ISBN 978-1-4613-9617-8 About this book Buy options