A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary

DOI10.1007/BF00941055zbMath0651.90047MaRDI QIDQ1106721

C. M. Ponic, Richard J. Caron, J. Fred McDonald

Publication date: 1989

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

zbMATH Keywords

degeneracylinear constraintsredundancyactive set algorithmsclassifying constraintsdegenerate extreme point strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (17)

A new distance measure including the weak preference relation: application to the multiple criteria aggregation procedure for mixed evaluations ⋮ Note on prime representations of convex polyhedral sets ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Arbitrage-Free Neural-SDE Market Models ⋮ Hedging Option Books Using Neural-SDE Market Models ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Pattern search in the presence of degenerate linear constraints ⋮ Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square ⋮ Global attitude and gyro bias estimation based on set-valued observers ⋮ A New Rock Slicing Algorithm with Reduced Data Structure for Discrete Element Method Analyses for Rock Mechanics ⋮ Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection ⋮ Constraint classification in mathematical programming ⋮ Identifying redundant linear constraints in systems of linear matrix inequality constraints ⋮ Adjustable Robust Optimization via Fourier–Motzkin Elimination ⋮ Quadratically constrained convex quadratic programmes: Faculty feasible regions ⋮ On infeasibility of systems of convex analytic inequalities ⋮ Infeasibility analysis for systems of quadratic convex inequalities

Cites Work

• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• On Trivial and Binding Constraints in Programming Problems
• Occurrences of cycling and other phenomena arising in a class of linear programming models
• New Finite Pivoting Rules for the Simplex Method
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

This page was built for publication: A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary