Items X1 X2
Profit per Item 3 6
Resource constraints Available Usage Left over
1 7 3 40 0 40
Solve the following linear programming model by using the computer
Minimize Z= 3x1 + 6x2
7x1 + 3x2 ≥40
x1,x2 ≤ 0 and integer
I solved it by minimizing it but I keep getting 0 for x1, x2, and Z.
The solution examines a linear programming model.