Using central prices in the decomposition of linear programs

DOI10.1016/0377-2217(93)90129-BzbMath0776.90048MaRDI QIDQ684317

Jean-Louis Goffin, Jean-Philippe Vial, Alain B. Haurie, Dao-Li Zhu

Publication date: 14 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

decompositioncutting planeanalytic centreconvex nondifferentiable optimizationDantzig-Wolfe algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Scenario analysis via bundle decomposition, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, A branch-and-price algorithm for the capacitated facility location problem, A cutting plane method for solving KYP-SDPs, A simple modification of dantzig-wolfe decomposition, Using an interior point method for the master problem in a decomposition approach, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem

Uses Software

• ACCPM

Cites Work

• Unnamed Item
• Unnamed Item
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• A new polynomial-time algorithm for linear programming
• Cutting planes and column generation techniques with the projective algorithm
• Partitioning procedures for solving mixed-variables programming problems
• Two-Metric Projection Methods for Constrained Optimization
• The Cutting-Plane Method for Solving Convex Programs
• The Decomposition Algorithm for Linear Programs
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm