On the structure of the set bases of a degenerate point

DOI10.1007/BF00939135zbMath0542.90091MaRDI QIDQ795747

N. E. Zubov

Publication date: 1985

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

treeextreme pointpolytopesdegeneracyconvex polyhedronlinear inequalitiescyclingboundary bases

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items

Survey of solved and open problems in the degeneracy phenomenon, Practical issues on the projection of polyhedral sets, On the line graphs of the complete \(r\)-partite graphs, Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule, Fourier algorithm revisited, A new pivoting rule for solving various degeneracy problems, Weakly redundant constraints and their impact on postoptimal analyses in LP, On the connectedness of optimum-degeneracy graphs, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Bounds on the number of vertices of perturbed polyhedra, On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, On some properties of \(0\)-degeneracy graphs, A theory of degeneracy graphs, Finding all maximal efficient faces in multiobjective linear programming, Enumerating extreme points of a highly degenerate polytope, Determination of the efficient set in multiobjective linear programming, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey

Cites Work

• Unnamed Item
• Unnamed Item
• Linear multiobjective programming
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• Finding all vertices of a convex polyhedron
• On cycling in the network simplex method
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A network simplex method
• Linear Multiparametric Programming by Multicriteria Simplex Method
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• New Finite Pivoting Rules for the Simplex Method
• Multiparametric Linear Programming
• Optimality and Degeneracy in Linear Programming