Skip to content
Competitive Stats
Q37Section II (Mathematics)37 of 190

Feasible yet unbounded: a genuinely combined-letter key answer

Consider the following LP program: Max Z=−3x1+2x2Z=-3x_1+2x_2 subject to x1≤3,x1−x2≤0,x1,x2≥0x_1\le3, x_1-x_2\le0, x_1,x_2\ge0. Then the above LP problem has:

Options