Vector Space Decomposition for Solving Large-Scale Linear Programs

@article{Gauthier2018VectorSD,
  title={Vector Space Decomposition for Solving Large-Scale Linear Programs},
  author={Jean Bertrand Gauthier and Jacques Desrosiers and Marco E. L{\"u}bbecke},
  journal={Oper. Res.},
  year={2018},
  volume={66},
  pages={1376-1389}
}
We develop an algorithmic framework for linear programming guided by dual optimality considerations. The solution process moves from one feasible solution to the next according to an exchange mecha... 

Figures from this paper

An implementation of steepest-descent augmentation for linear programs
Two dimensional search algorithms for linear programming
TLDR
This dissertation proposes novel algorithms that move between solutions by repeatedly solving a two dimensional subspace linear program and presents a novel technique, called the ratio algorithm, to find an optimal basis and an optimal solution to linear programs with only two constraints.
A polyhedral model for enumeration and optimization over the set of circuits
A Nested Decomposition Model for Reliable NFV 5G Network Slicing
TLDR
A nested decomposition scheme for the design of reliable 5G network slicing involves revisiting and improving the previously proposed column generation models, and adding in particular the computation of dual bounds with Lagrangian relaxation in order to assess the accuracy of the solutions.

References

SHOWING 1-10 OF 41 REFERENCES
Decomposition Principle for Linear Programs
A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a
Stabilized column generation
HOW GOOD IS THE SIMPLEX ALGORITHM
TLDR
By constructing long 'increasing' paths on appropriate convex polytopes, it is shown that the simplex algorithm for linear programs is not a 'good algorithm' in the sense of J. Edmonds.
Dual-Optimal Inequalities for Stabilized Column Generation
TLDR
This work studies the use of two types of dual-optimal inequalities to accelerate and stabilize the whole convergence process, and proposes two methods for recovering primal feasibility and optimality, depending on the type of inequalities used.
Linear Programming and Network Flows
TLDR
This chapter discusses the complexity of the Simplex Algorithms and their applications in linear algebra, convex analysis, and Polyhedral Sets.
Tools for primal degenerate linear programs: IPS, DCA, and PE
TLDR
The improved primal simplex (IPS) algorithm which turns degeneracy into a possible advantage is improved, and the positive edge (PE) rule, a constructive strategy specifically designed for set partitioning constraints, is described.
Integral Simplex Using Decomposition for the Set Partitioning Problem
TLDR
Improve the Balas and Padberg results by introducing a constructive method that finds this sequence of basic integer solutions by only using normal pivots on positive coefficients, and presents results for large-scale problems with up to 500,000 variables for which optimal integer solutions are often obtained without any branching.
Using Extra Dual Cuts to Accelerate Column Generation
TLDR
Conditions under which it is possible to restrict the dual space, but still preserve the strength of the primal model and recover an optimal primal solution of the one-dimensional cutting-stock problem are presented.
...
1
2
3
4
5
...