Advertisements
Advertisements
प्रश्न
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?
Advertisements
उत्तर
Let the airline sell x tickets of executive class and y tickets of economy class.
The mathematical formulation of the given problem is as follows.
Maximize z = 1000x + 600y … (1)
subject to the constraints,
The feasible region determined by the constraints is as follows.
The corner points of the feasible region are A (20, 80), B (40, 160), and
C (20, 180).
The values of z at these corner points are as follows.
| Corner point | z = 1000x + 600 | |
| A (20, 80) | 68000 | |
| B (40, 160) | 136000 | → Maximum |
| C (20, 180) | 128000 |
The maximum value of z is 136000 at (40, 160).
Thus, 40 tickets of executive class and 160 tickets of economy class should be sold to maximize the profit and the maximum profit is Rs 136000.
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:
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 = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; 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?
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
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
Refer to Exercise 7 above. Find the maximum value of Z.
The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.
Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.
Refer to question 15. Determine the maximum distance that the man can travel.
Refer to question 15. Determine the maximum distance that the man can travel.
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
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.
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 ______.
The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.
Refer to Question 30. Minimum value of F is ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
In a LPP, the objective function is always ______.
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 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.
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:
Objective function of a linear programming problem is ____________.
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. 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.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.
