A practical anti-cycling procedure for linearly constrained optimization
From MaRDI portal
Publication:1264089
DOI10.1007/BF01589114zbMath0688.90038OpenAlexW1977310057MaRDI QIDQ1264089
Philip E. Gill, Margaret H. Wright, Walter Murray, Michael A. Saunders
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589114
degeneracysimplex methodactive-set methodsanti-cycling proceduregeneral linearly constrained problems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)
Related Items
A phase-1 approach for the generalized simplex algorithm, Numerical aspects in developing LP softwares, LPAKO and LPABO, The simplex algorithm with a new primal and dual pivot rule, Primal and dual active-set methods for convex quadratic programming, A linear programming decomposition focusing on the span of the nondegenerate columns, Parallel search paths for the simplex algorithm, Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, The positive edge pricing rule for the dual simplex, Parallel distributed-memory simplex for large-scale stochastic LP problems, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, A factorization with update procedures for a KKT matrix arising in direct optimal control, A two-phase support method for solving linear programs: numerical experiments, Efficient implementation of an active set algorithm for large-scale portfolio selection, An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., A primal deficient-basis simplex algorithm for linear programming, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Towards a practical parallelisation of the simplex method, Systematic construction of examples for cycling in the simplex method, A validation and verification tool for global optimization solvers, Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis, A basis-defiency-allowing variation of the simplex method for linear programming, LPAKO: A Simplex-based Linear Programming Program, An efficient linear programming algorithm for combined heat and power production., Fast quantum subroutines for the simplex method, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation, An affine-scaling pivot algorithm for linear programming, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, An efficient linear model and optimisation algorithm for multi-site combined heat and power production, On the use of dense matrix techniques within sparse simplex, Linearly constrained global optimization: a general solution algorithm with applications., Feasibility issues in a primal-dual interior-point method for linear programming, Pivot versus interior point methods: Pros and cons, Degeneracy graphs: Theory and applications. An updated survey, Advances in design and implementation of optimization software, Pivot rules for linear programming: A survey on recent theoretical developments, Resolving degeneracy in quadratic programming, On degeneracy in linear programming and related problems, A strictly improving linear programming Phase I algorithm, A practical anti-degeneracy row selection technique in network linear programming, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Methods for convex and general quadratic programming, Complementarity framework for non-linear dynamic analysis of skeletal structures with softening plastic hinges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the integer properties of scheduling set partitioning models
- On the solution of highly degenerate linear programmes
- An analysis of an available set of linear programming test problems
- Making progress during a stall in the simplex algorithm
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Evolution of Linear Programming Computing Techniques
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- On practical stopping rules for the simplex method
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Numerically stable methods for quadratic programming
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- New Finite Pivoting Rules for the Simplex Method
- Implementation aids for optimization algorithms that solve sequences of linear programs
- A Technique for Resolving Degeneracy in Linear Programming
- The Composite Simplex Algorithm
- A complete constructive algorithm for the general mixed linear programming problem
- Pivot selection methods of the Devex LP code