![Progress in Mathematical Programming [electronic resource] : Interior-Point and Related Methods /](/search/themes/bootstrap3/images/libros.png)
Progress in Mathematical Programming [electronic resource] : Interior-Point and Related Methods /
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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
New York, NY : Springer New York,
1989
|
| Subjects: | Mathematics., Software engineering., Computer programming., Applied mathematics., Engineering mathematics., Algorithms., Mathematical optimization., Optimization., Software Engineering/Programming and Operating Systems., Applications of Mathematics., Programming Techniques., |
| Online Access: | http://dx.doi.org/10.1007/978-1-4613-9617-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|