Solving staircase linear programs by the simplex method, 1: Inversion

DOI10.1007/BF01583795zbMath0487.90076OpenAlexW2078092147MaRDI QIDQ3948887

Robert Fourer

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01583795

zbMATH Keywords

large-scale optimizationGaussian eliminationcomputational experiencestaircase-structured linear programsadapted simplex methodeconomic planning over timeinversion routines

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

A clustering heuristic to detect staircase structures in large scale linear programming models, Cascading-heuristics for the solution of staircase linear programs, An analysis of an available set of linear programming test problems, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, On the Combinatorial Diameters of Parallel and Series Connections, Revised dantzig-wolfe decomposition for staircase-structured linear programs, On scaling linear programs—some experimental results, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, On a distributed implementation of a decomposition method for multistage linear stochastic programs, Parallel decomposition of multistage stochastic programming problems, Optimization with staircase structure: An application to generation scheduling, Parallel processors for planning under uncertainty, Solving staircase linear programs by the simplex method, 2: Pricing, On recognizing staircase compatibility, A fast LU update for linear programming, Solving staircase linear programs by the simplex method, 1: Inversion, MOPS -- Mathematical optimization system, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stabilization of the simplex method
• The Elimination form of the Inverse and its Application to Linear Programming
• Evolution of Linear Programming Computing Techniques
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Decomposition Principle for Linear Programs
• Staircase Matrices and Systems
• A Comparative Study of Two Methods for Staircase Linear Programs
• Matrix augmentation and structure preservation in linearly constrained control problems
• A set of staircase linear programming test problems
• Solving staircase linear programs by the simplex method, 1: Inversion
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Nested decomposition for dynamic models
• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
• A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
• Nested Decomposition and Multi-Stage Linear Programs
• On the Bartels—Golub decomposition for linear programming bases
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• A TWO-LEVEL ALGORITHM FOR TWO-STAGE LINEAR PROGRAMS
• An alternative method for a global analysis of quadratic programs in a finite number of steps
• A Substitute Inverse for the Basis of a Staircase Structure Linear Program
• Steepest Ascent for Large Scale Linear Programs
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Special Simplex Algorithm for Linked Problems
• The simplex method of linear programming using LU decomposition
• Dynamic Linear Programs for Production Scheduling
• Reinversion with the preassigned pivot procedure
• Programming of Interdependent Activities: II Mathematical Model
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming