Minimal representation of convex polyhedral sets

DOI10.1007/BF00934319zbMath0471.93017OpenAlexW2008959579MaRDI QIDQ1158127

Jan Telgen

Publication date: 1982

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

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

zbMATH Keywords

redundancyminimal representationlinear inequalitieslinear equalitiesimplicit equalitiessystems of linear constraints

Mathematics Subject Classification ID

Minimal systems representations (93B20) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Polytopes and polyhedra (52Bxx)

Related Items

General criteria for redundant and nonredundant linear inequalities, Note on prime representations of convex polyhedral sets, Deriving constraints among argument sizes in logic programs, An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks, Multiple objective linear programming models with interval coefficients -- an illustrated overview, Consistency, redundancy, and implied equalities in linear systems, Minimal representations of a face of a convex polyhedron and some applications, Generalized derivatives of dynamic systems with a linear program embedded, On the problem of optimal speed for the discrete linear system with bounded scalar control on the basis of 0-controllability sets, A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone, Stochastic and deterministic fault detection for randomized gossip algorithms, On Fourier's algorithm for linear arithmetic constraints, Fully piecewise linear vector optimization problems, A fuzzy multiobjective linear programming, Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces, Redundancy in linear inequality system, Minimal representation of convex regions defined by analytic functions, Analytic centers and repelling inequalities, The maximal descriptor index set for a face of a convex polyhedral set and some applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorems on the dimensions of convex sets
• On Trivial and Binding Constraints in Programming Problems
• Linear Inequalities and Related Systems. (AM-38)
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Redundante Ungleichungen bei linearen Ungleichungssystemen
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems