Advertisements
Advertisements
प्रश्न
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
उत्तर
The system of constraints is
x + y ≤ 4 ...(1)
and x ≥ 0, y ≥ 0 ...(2)
Let l : x + y = 4
The shaded region in the figure is the feasible region determined by the system of constraints (1) and (2).
It is observed that the feasible region OAB is bounded.
Thus, we use the Corner Point Method to determine the maximum value of Z.
We have Z = 3x + 4y ...(3)
The coordinates of O, A and B are (0, 0), (4, 0) and (0, 4), respectively.
| Corner Point | Corresponding values of Z |
| (0, 0) | 0 |
| (4, 0) | 12 |
| (0, 4) | 16 (Maximum) |
Hence Zmax = 16 at the point (0, 4).
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
Solve the following Linear Programming Problems graphically:
Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = 5x + 10 y
subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Maximise Z = – x + 2y, Subject to the constraints:
x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.
A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?
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.
An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
Refer to Exercise 7 above. Find the maximum value of Z.
Refer to quastion 12. What will be the minimum cost?
Refer to question 15. Determine the maximum distance that the man can travel.
A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.
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?
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.
Compare the quantity in Column A and Column B
| Column A | Column B |
| Maximum of Z | 325 |
Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.
Refer to Question 30. Minimum value of F is ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
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.
Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
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?
For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:
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:
A linear programming problem is one that is concerned with ____________.
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 = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
