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 refer 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?
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,
\(x+y≤200\) .....(2)
\(x≥20 \) ......(3)
\(y-4x≥0\) ......(4)
\(x,y≥0\) ......(5)
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.
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.
What is the Planning Process?
The Linear Programming Problems (LPP) is a problem that is concerned with finding the optimal value of the given linear function. The optimal value can be either maximum value or minimum value. Here, the given linear function is considered an objective function. The objective function can contain several variables, which are subjected to the conditions and it has to satisfy the set of linear inequalities called linear constraints.
Step 1: Establish a given problem. (i.e.,) write the inequality constraints and objective function.
Step 2: Convert the given inequalities to equations by adding the slack variable to each inequality expression.
Step 3: Create the initial simplex tableau. Write the objective function at the bottom row. Here, each inequality constraint appears in its own row. Now, we can represent the problem in the form of an augmented matrix, which is called the initial simplex tableau.
Step 4: Identify the greatest negative entry in the bottom row, which helps to identify the pivot column. The greatest negative entry in the bottom row defines the largest coefficient in the objective function, which will help us to increase the value of the objective function as fastest as possible.
Step 5: Compute the quotients. To calculate the quotient, we need to divide the entries in the far right column by the entries in the first column, excluding the bottom row. The smallest quotient identifies the row. The row identified in this step and the element identified in the step will be taken as the pivot element.
Step 6: Carry out pivoting to make all other entries in column is zero.
Step 7: If there are no negative entries in the bottom row, end the process. Otherwise, start from step 4.
Step 8: Finally, determine the solution associated with the final simplex tableau.