Mechanical Engineering > GATE 2016 SET-1 > Linear Programming
Maximize Z = 15X1 + 20X2
subject to
12X1 + 4X2 ≥ 36
12X1 - 6X2 ≤ 24
X1, X2 ≥ 0
The above linear programming problem has
subject to
12X1 + 4X2 ≥ 36
12X1 - 6X2 ≤ 24
X1, X2 ≥ 0
The above linear programming problem has
Correct : b
Similar Questions
At the current basic feasible solution (bfs) v0 (v0 ∈ ℝ5), the simplex method yields the following form of a linear programming problem in standard form.
min...
Which one of the options given represents the feasible region of the linear programming model: Maximize
A manufacturing unit produces two products P1 and P2. For each piece of P1 and
P2, the table below provides quantities of materials M1, M2, and M3 required, a...
Total Unique Visitors
Loading......