Selected bibliography on degeneracy
From MaRDI portal
Publication:1312748
DOI10.1007/BF02096255zbMath0786.90093MaRDI QIDQ1312748
Publication date: 7 February 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
A linear programming decomposition focusing on the span of the nondegenerate columns, How good are convex hull algorithms?, Stabilized dynamic constraint aggregation for solving set partitioning problems, Multi-phase dynamic constraint aggregation for set partitioning type problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- Redundancy in mathematical programming. A state-of-the-art survey
- Multi-criteria simplex method for a linear multiple-objective transportation problem
- Practical finite pivoting rules for the simplex method
- On the structure of the set bases of a degenerate point
- Pivoting rules and redundancy schemes in extreme point enumeration
- Degeneracy graphs and the neighbourhood problem
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Minimax linear programming problem
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- Survey of solved and open problems in the degeneracy phenomenon
- A dual approach to primal degeneracy
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- A possible way to reduce degeneracy in integer programming computations
- On the solution of highly degenerate linear programmes
- Parametric linear programming and anti-cycling pivoting rules
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- Making progress during a stall in the simplex algorithm
- An improved vertex enumeration algorithm
- On the bottleneck linear programming problem
- On finding a vertex solution using interior point methods
- On anti-cycling pivoting rules for the simplex method
- Degeneracy graphs and simplex cycling
- A new pivoting rule for solving various degeneracy problems
- Weakly redundant constraints and their impact on postoptimal analyses in LP
- An algorithm for enumerating all vertices of a convex polyhedron
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- The generalized alternating path algorithm for transportation problems
- Degeneracy in interior point methods for linear programming: A survey
- Degeneracy in integer linear optimization problems: A selected bibliography
- Bounds on the number of vertices of perturbed polyhedra
- A decision rule in the simplex method that avoids cycling
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Complexity of Vertex Enumeration Methods
- A Note on Shadow Prices in Linear Programming
- Formal optimization of some reduced linear programming problems
- A note on solving multifacility location problems involving euclidean distances
- On three basic methods for solving bottleneck transportation problems
- On cycling in the network simplex method
- A note on degeneracy in linear programming
- On the average length of lexicographic paths
- A regularized decomposition method for minimizing a sum of polyhedral functions
- A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
- Projected gradient methods for linearly constrained problems
- An analysis of degeneracy
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Solving multifacility location problems involving euclidean distances
- Least-index resolution of degeneracy in quadratic programming
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- An implementation of the simplex method for linear programming problems with variable upper bounds
- The Computation of Shadow Prices in Linear Programming
- Probabilistic Models for Linear Programming
- Degeneracy in fixed cost transportation problems
- An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
- Bottleneck linear programming
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- Vector maximization at a degenerate vertex
- An algorithm for determining all extreme points of a convex polytope
- The alternating basis algorithm for assignment problems
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
- Cycling in linear complementarity problems
- New Finite Pivoting Rules for the Simplex Method
- Theoretical Properties of the Network Simplex Method
- On computational aspects of bounded linear least squares problems
- A Technique for Resolving Degeneracy in Linear Programming
- Cycling in the transportation problem
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- A Simplified Primal (All-Integer) Integer Programming Algorithm
- A Note on Resolution of Degeneracy in Transportation Problems
- A note on cycling in the simplex method
- Time‐minimizing transportation problems
- Pivot selection methods of the Devex LP code
- Marginal Values in Linear Programming
- Optimality and Degeneracy in Linear Programming
