Minimal representation of convex polyhedral sets
From MaRDI portal
Cites work
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3633843 (Why is no real title available?)
- Linear Inequalities and Related Systems. (AM-38)
- On trivial and binding constraints in programming problems
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- Redundante Ungleichungen bei linearen Ungleichungssystemen
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- Theorems on the dimensions of convex sets
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
Cited in
(19)- General criteria for redundant and nonredundant linear inequalities
- Note on prime representations of convex polyhedral sets
- A fuzzy multiobjective linear programming
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
- Deriving constraints among argument sizes in logic programs
- Consistency, redundancy, and implied equalities in linear systems
- Minimal representation of convex regions defined by analytic functions
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- Analytic centers and repelling inequalities
- Fully piecewise linear vector optimization problems
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Minimal representations of a face of a convex polyhedron and some applications
- Redundancy in linear inequality system
- Stochastic and deterministic fault detection for randomized gossip algorithms
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
- On Fourier's algorithm for linear arithmetic constraints
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- 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
This page was built for publication: Minimal representation of convex polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158127)