Advertisements
Advertisements
प्रश्न
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.
विकल्प
(0, 0)
(0, 8)
(5, 0)
(4, 10)
Advertisements
उत्तर
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at (0, 8).
Explanation:
| Corner points | Value of Z = 3x – 4y | |
| O(0, 0) | Z = 0 | |
| A(5, 0) | Z = 3(5) – 0 = 15 | |
| B(6, 5) | Z = 3(6) – 4(5) = – 2 | |
| C(6, 8 | Z = 3(6) – 4(8) = – 14 | |
| D(4, 10) | Z = 3(4) – 4(10) = – 28 | ← Minimum |
| E(0, 8) | Z = 3(0) – 4(8) = – 32 |
APPEARS IN
संबंधित प्रश्न
Two tailors, A and B, earn Rs 300 and Rs 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, 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.
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
| Food I (per lb) |
Food II (per lb) |
Minimum daily requirement for the nutrient |
||||
| Calcium | 10 | 5 | 20 | |||
| Protein | 5 | 4 | 20 | |||
| Calories | 2 | 6 | 13 | |||
| Price (Rs) | 60 | 100 |
What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.
If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.
Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
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.
Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.
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 ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
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:
A maximum or a minimum may not exist for a linear programming problem if ____________.
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 the feasible region is unbounded, m is the minimum value of the objective function.
If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.
In a LPP, the objective function is always ____________.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, 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 ____________.
The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.
