Advertisements
Advertisements
प्रश्न
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
Advertisements
उत्तर
OAED is the feasible region.
At A, y = 0
∴ 2x + y = 104
⇒ x = 52
At D, x = 0
∴ x + 2y = 76
⇒ y = 38
Which gives corner point D = (0, 38)
Now solving the given equations, we get
x + 2y = 76
2x + y = 104
2x + 4y = 152
2x + y = 104
(–) (–) (–)
3y = 48
⇒ y = 16
x + 2(16) = 76
⇒ x = 76 – 32 = 44
So, the corner point E = (44, 16)
Evaluating the maximum value of Z, we get
| Corner points | Z = 3x + 4y | |
| O(0, 0) | Z = 3(0) + 4(0) = 0 | |
| A(52, 0) | Z = 3(52) + 4(0) = 156 | |
| E(44, 16) | Z = 3(44) + 4(16) = 196 | ← Maximum |
| D(0, 38) | Z = 3(0) + 4(38) = 152 |
Hence, the maximum value of Z is 196 at (44, 16).
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Minimise Z = – 3x + 4 y
subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Maximise Z = 5x + 3y
subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?
A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Type of toy | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.
The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
Refer to quastion 12. What will be the minimum cost?
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:
| Tablets | Iron | Calcium | Vitamin |
| X | 6 | 3 | 2 |
| Y | 2 | 3 | 4 |
The person needs atleast 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamin. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?
Refer to Question 27. Maximum of Z occurs at ______.
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ______.
The feasible region for an LPP is always a ______ polygon.
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.
Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?
A linear programming problem is as follows:
Minimize Z = 30x + 50y
Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0
In the feasible region, the minimum value of Z occurs at:
In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:
In linear programming infeasible solutions
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.
In a LPP, the objective function is always ____________.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
Which statement best describes a Linear Programming Problem (LPP)?
In the expression \[Z=250x+75y\], which quantities are the decision variables?
What are constraints in a Linear Programming Problem?
Which condition represents non-negative restrictions for two decision variables?
Which inequality is one of the given resource constraints in the formulation with objective function \[Z=250x+75y\]?
Which set gives the complete non-negative restrictions for the profit-maximization formulation?
Linear Programming is a method of optimisation under which type of constraints?
What is the name of the quantity to be optimised in linear programming?
What are the unknown quantities in a Linear Programming Problem called?
Which component must always be included in a Linear Programming Problem?
