Tagged Questions
1
vote
2answers
137 views
Explain `All polyhedrons are convex sets´
My teacher in course in Mat-2.3140 of Aalto University claims that 'All polyhedrons are convex sets' here. This premise was in a false-or-not-problem 'The feasible set of linear integer problem is ...
1
vote
1answer
2k views
Degeneracy in Linear Programming
Consider the standard form polyhedron, and assume that the rows of the matrix A are linearly independent.
$$ \left \{ x | Ax = b, x \geq 0 \right \} $$
(a) Suppose that two different bases lead to ...