Quantrex Quantrex AcademyJEE · NEET · NDA PYQs with solutions Open app
MHT CET202619 April 2026Evening ShiftMathematicsLinear ProgrammingActual

An airplane can carry a maximum of 250 passengers. A profit of Rs 1500 is made on each executive class ticket and a profit of Rs 900 is made on each economy class ticket. The airline reserves at least 30 seats for executive class. However at least 4 times as many passengers prefer to travel by economy class than by executive class. Let x₁ be the number of passengers of executive class and x₂ be the number of passenge

Options

  1. AMaximize z = 1500x₁ + 900x₂ subject to x₁ + x₂ 250 , x₁ 30 , x₂ 4x₁ , x₁ 0, x₂ 0 .
  2. BMinimize z = 150x₁ + 90x₂ subject to x₁ + x₂ 250 , x₁ 30 , x₂ 4x₁ , x₁ 0, x₂ 0 .
  3. CMinimize z = 1500x₁ + 900x₂ subject to x₁ + x₂ 250 , x₁ 30 , x₂ 4x₁ , x₁ 0, x₂ 0 .
  4. DMaximize z = 1500x₁ + 900x₂ subject to x₁ + x₂ 250 , x₁ 30 , x₂ 4x₁ , x₁ 0, x₂ 0 .

Correct answer

D. Maximize z = 1500x₁ + 900x₂ subject to x₁ + x₂ 250 , x₁ 30 , x₂ 4x₁ , x₁ 0, x₂ 0 .

Step-by-step solution

Let x₁ be the number of executive class passengers and x₂ be the number of economy class passengers. The profit on each executive class ticket is Rs 1500 and on each economy class ticket is Rs 900 . The objective is to maximize the total profit z , which is given by: Maximize z = 1500x₁ + 900x₂ The airplane can carry a maximum of 250 passengers, which gives the constraint: x₁ + x₂ 250 The airline reserves at least 30 seats for executive class, which gives: x₁ 30 At least 4 times as many passengers prefer to travel

Practice Linear Programming on Quantrex Academy →

More from Linear Programming

The feasible region represented by the constraints: x + 2y 120 ; x + y 60 ; x - 2y 0 ; x 0 and y 0 2026Which of the following is NOT a corner point of the feasible region determined by the constraints: x + 2y 4 ; x + y 2 ; x 0 and y 0 2026The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20) . Let z = px + qy where p, q > 0 . The relation betwe 2026In Linear Programming Problem (LPP), the objective function Z = ax + by has the same maximum value at two corner points. The number of points at which Z_ max occurs is 2026The LPP maximize z = 2x + 5y subject to x + 3y 6 , 2x + 6y 18 , x 0 , y 0 has 2026The difference between the maximum value and the minimum value of the objective function z = 3x + y subject to the constraints 2x + 3y 6 , x + y 1 , x 0 , y 0 is.... 2026The shaded region in the provided graph represents the solution set for which of the following systems of linear inequalities? 2026The maximum value of z = 4x + y subject to the constraints x + y 5, 2x + y 7, 3x + 2y 11, x 0, y 0 is 2026 Full Linear Programming list All MHT CET PYQs