Please wait...
The feasible region for an LPP is shown in the given figure. Let F = 3x - 4y be the objective function. The maximum value of F is?
The problem of maximizing z = x1 - x2 subject to constraints x1 + x2 ≤ 10, x1 ≥ 0, x2 ≥ 0 and x2 ≤ 5 has
The following LPP problem has
Zmin = 1.5x1 + 4.5x2
Subject to
x1 + 3x2 > 3
x1 + x2 > 2
x1, x2 > 0
Consider the following linear programming problem:
Maximize z = 6x + 10y
Subject to x ≤ 4
y ≤ 6
3x + 2y ≤ 18
x ≥ 0, y ≥ 0
For a company manufacturing products X and Y, details are given below: Then which of the following mathematical formulation is correct for this L.P.P. to maximize the profit?
Machines
Time (hr)
Available capacity (hrs)
X
Y
A
1
4
B
3
8
24
C
10
7
35
Profit unit (rs)
5
Where the number of the products of X and Y types are x and y.
10x + 7y ≤ 35,
x ≥ 0 and y. ≥ 0
subjected to Max Z = 5x + 7y
3x + 8y = 24,
3x + 8y ≥ 24,
Answered - 0
Un-answered - 10