Pages that link to "Item:Q1221941"
From MaRDI portal
The following pages link to Theorems on the dimensions of convex sets (Q1221941):
Displaying 17 items.
- Limiting Lagrangians: A primal approach (Q761250) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- A primal-dual projection method for solving systems of linear inequalities (Q1058270) (← links)
- Complete controllability (Q1061663) (← links)
- Boundedness relations in linear semi-infinite programming (Q1097166) (← links)
- A theory of linear inequality systems (Q1103695) (← links)
- Clark's theorem for semi-infinite convex programs (Q1150527) (← links)
- Minimal representation of convex polyhedral sets (Q1158127) (← links)
- A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
- Description of the optimal solution set of the linear programming problem and the dimension formula (Q1208298) (← links)
- Selected applications of linear semi-infinite systems theory (Q2022431) (← links)
- Voronoi cells via linear inequality systems (Q2427910) (← links)
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges (Q3783052) (← links)
- Duality gaps in semi-infinite linear programming—an approximation problem (Q3895225) (← links)
- On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> (Q4143032) (← links)
- A note about linear inequality systems and duality (Q4726050) (← links)