Advertisements
Advertisements
प्रश्न
Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?
पर्याय
x1 = 18, x2 = 24
x1 = 15, x2 = 30
x1 = 2.5, x2 = 35
x1 = 20.5, x2 = 19
Advertisements
उत्तर
x1 = 2.5, x2 = 35
Explanation:
z = 3x1 + 4x2
Let us solve the equations
2x1 + x2 = 40 ………(1)
2x1 + 5x2 = 180 ……….(2)
− 4x2 = − 140 ....[Equation (1) − (2)]
x2 = 35
We have 2x1 + x2 = 40
2x1 + 35 = 40
2x1 = 5
x1 = 2.5
APPEARS IN
संबंधित प्रश्न
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to machine shop for finishing. The number of man hours of labour required in each shop for production of A and B and the number of man hours available for the firm are as follows:
| Gadgets | Foundry | Machine Shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hours) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per unit. Formulate the L.P.P. to have maximum profit.
Fill in the blank :
“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.
x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?
State whether the following statement is True or False:
Objective function of LPP is a relation between the decision variables
The variables involved in LPP are called ______
The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is:
Solve the following linear programming problem graphically.
Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.
The set of feasible solutions of LPP is a ______.
For the following shaded region, the linear constraint are:
