Pages that link to "Item:Q1158127"
From MaRDI portal
The following pages link to Minimal representation of convex polyhedral sets (Q1158127):
Displayed 13 items.
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone (Q684340) (← links)
- On Fourier's algorithm for linear arithmetic constraints (Q688575) (← links)
- Multiple objective linear programming models with interval coefficients -- an illustrated overview (Q877639) (← links)
- General criteria for redundant and nonredundant linear inequalities (Q1076606) (← links)
- Note on prime representations of convex polyhedral sets (Q1102183) (← links)
- A fuzzy multiobjective linear programming (Q1278864) (← links)
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Deriving constraints among argument sizes in logic programs (Q1360682) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
- Redundancy in linear inequality system (Q4210734) (← links)