English

An Aeroplane Can Carry a Maximum of 200 Passengers 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
Advertisements

Question

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

Solution

Let the airline sell tickets of executive class and y tickets of economy class.

The mathematical formulation of the given problem is as follows.

Maximize z = 1000+ 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.

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Linear Programming - Exercise 12.3 [Page 526]

APPEARS IN

NCERT Mathematics Part 1 and 2 [English] Class 12
Chapter 12 Linear Programming
Exercise 12.3 | Q 5 | Page 526

RELATED QUESTIONS

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:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

subject to 2x + y ≥ 3, x + 2y ≥ 6, 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?


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


Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.


Refer to Exercise 7 above. Find the maximum value of Z.


In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.


Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer


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.


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 ______.


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 ____________.


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.


The feasible region for an LPP is always a ______ polygon.


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:


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:


The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.


In linear programming infeasible solutions


In a LPP, the objective function is always ____________.


Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.


The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×