Advertisements
Advertisements
Question
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 |
Options
The quantity in column A is greater
The quantity in column B is greater
The two quantities are equal
The relationship can not be determined on the basis of the information supplied
Advertisements
Solution
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 the quantity in column B is greater.
Compare the quantity in Column A and Column B
| Column A | Column B |
| Maximum of Z | 325 |
Explanation:
| Corner points | Value of Z = 4x + 3y | |
| (0, 0) | Z = 0 | |
| (0, 40) | Z = 0 + 3(40) = 120 | |
| (20, 40) | Z = 4(20) + 3(40) = 200 | |
| (60, 20) | Z = 4(60) + 3(20) = 300 | → Maximum |
| (60, 0) | Z = 4(60) + 3(0) = 240 |
APPEARS IN
RELATED QUESTIONS
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.
Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, 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 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?
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.
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
Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0
Refer to Exercise 7 above. Find the maximum value of Z.
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
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?
A company makes 3 model of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimise the operating costs and still meet the demand.
Refer to Question 27. Maximum of Z occurs at ______.
Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.
In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
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 minimum value of the objective function Z = ax + by is always 0 if the origin is one of the 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?
In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:
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:
Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
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. If M and m respectively be the largest and smallest values at corner points then ____________.
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 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.
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.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
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 ____________.
