This question is from linear programming.
I want to use duality (it's so obvious), farkas lemma (alternative solution) and all.
(See attached file for full problem description with equations)
(a) Let . Prove that one of the following systems has a solution but not both:
(b) Prove or disprove the following claim:
Assume that both the linear program
and its dual
are feasible. Then at least one of them has an unbounded feasible region.
Duality and the Farkas Lemma are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.