Presolving in linear programming
From MaRDI portal
Publication:1914076
DOI10.1007/BF01586000zbMath0846.90068OpenAlexW2063558363MaRDI QIDQ1914076
Erling D. Andersen, Knud D. Andersen
Publication date: 2 June 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01586000
Related Items (41)
Unit-operation nonlinear modeling for planning and scheduling applications ⋮ Numerical aspects in developing LP softwares, LPAKO and LPABO ⋮ Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization ⋮ On handling indicator constraints in mixed integer programming ⋮ Coefficient strengthening: a tool for reformulating mixed-integer programs ⋮ A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization ⋮ Bound reduction using pairs of linear inequalities ⋮ Interactions between nonlinear programming and modeling systems ⋮ Warm start by Hopfield neural networks for interior point methods ⋮ Evolutionary approach for large-scale mine scheduling ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Presolving linear bilevel optimization problems ⋮ Progress in presolving for mixed integer programming ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Hopfield neural networks in large-scale linear optimization problems ⋮ Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems ⋮ Regularization techniques in interior point methods ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ A sparse proximal implementation of the LP dual active set algorithm ⋮ Dual multilevel optimization ⋮ Shift-and-propagate ⋮ Broadening the integer programming audience, the LINDO perspective ⋮ Efficient preprocessing for VLSI optimization problems ⋮ Design of planar articulated mechanisms using branch and bound ⋮ Adaptive demand peak management in online transport process planning ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ Presolve Reductions in Mixed Integer Programming ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Advances in design and implementation of optimization software ⋮ Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
Uses Software
Cites Work
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- Finding duplicate rows in a linear programming model
- A hierarchical algorithm for making sparse matrices sparser
- A primal-dual infeasible-interior-point algorithm for linear programming
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A pathological case in the reduction of linear programs
- Formal optimization of some reduced linear programming problems
- On the Implementation of a Primal-Dual Interior Point Method
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Implementing the Simplex Method: The Initial Basis
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Commentary—Progress in Linear Programming
- Implementing the simplex method for the Optimization Subroutine Library
- A global approach to crew-pairing optimization
This page was built for publication: Presolving in linear programming
