Linear Algebra and Its Applications · Problem 8.1.8
Linear Programming and Game Theory — Gilbert Strang
Mathematics · linear-programming-general-motors
Problem
In the feasible set for the General Motors problem, the nonnegativity x,y,z≥0 leaves an eighth of three-dimensional space (the positive octant). How is this cut by the two planes from the constraints, and what shape is the feasible set? How do its corners show that, with only these two constraints, there will be only two kinds of cars in the optimal solution?