Cutting planes and column generation techniques with the projective algorithm

Journal of Optimization Theory and Applications

Volumn 65, Issue 3, 1990, Pages 409-429

  Goffin, J L ^a   Vial, J P ^b  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

column generation techniques; cutting planes; Karmarkar's algorithm; nondifferentiable optimization

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS;

COLUMN GENERATION TECHNIQUES; KARMARKAR'S ALGORITHM;

MATHEMATICAL PROGRAMMING, LINEAR;

EID: 0025439452     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/BF00939559     Document Type: Article

References (22)

1. Partitioning Procedures for Solving Mixed Variables Programming Problems
2. The Decomposition Algorithm for Linear Programming
3. A Linear Programming Approach to the Cutting Stock Problem: Part 2
4. An Implementation of Karmarkar Algorithm for Linear Programming
5. Affine and Projective Transformations in Nondifferentiable Optimization
6. New Algorithms in Convex Programming Based on a Notion of Center for Systems of Analytic Inequalities and on Rational Extrapolation
7. Iterative Solution of Problems of Linear and Quadratic Programming
8. A New Polynomial Time Algorithm for Linear Programming
9. A Monotonic Projective Algorithm for Fractional Linear Programming
10. An Extension of Karmarkar's Algorithm for Solving a System of Linear Homogeneous Equations on the Simplex
11. A Polynomial Newton Method for Linear Programming
12. A Variant of Karmarkar's Linear Programming Algorithm for Problems in Standard Form
13. Conical Projection Algorithm for Linear Programming
14. An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables
15. Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming
16. An Analog of Karmarkar's Algorithm for Inequality Constrained Linear Programming, with a New Class of Projective Transformations for Centering a Polytope