Boundedness relations for linear constraint sets
From MaRDI portal
Publication:2540811
DOI10.1016/0024-3795(70)90009-1zbMath0201.22003MaRDI QIDQ2540811
Publication date: 1970
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(70)90009-1
Related Items
Boundedness relations in linear semi-infinite programming, A theory of linear inequality systems, Optimal simplex tableau characterization of unique and bounded solutions of linear programs, Theorems on the dimensions of convex sets, On copositive matrices, On the primal and dual constraint sets in geometric programming, On polyhedral extension of some LP theorems, A Variable-Complexity Norm Maximization Problem, Polyhedral extensions of some theorems of linear programming, The complementary unboundedness of dual feasible solution sets in convex programming
Cites Work
- The Jacobian matrix and global univalence of mappings
- Remark on the Constraint Sets in Linear Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- A Probelm in Linear Inequalities
- On a Problem in Linear Inequalities
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item