Quantrex Quantrex AcademyJEE · NEET · NDA PYQs with solutions Open app
MHT CET202526 Apr 2025Evening ShiftMathematicsLinear ProgrammingActual

A manufacturing company produces two items, A and B. Each toy should be processed by two machines, I and II. Machine I can be operated for maximum 10 hours 40 minutes. It takes 20 minutes for an item A and 15 minutes for B. Machine II can be operated for a total time at 8 hours 20 minutes. It takes 5 minutes for an item A and 8 minutes for B . The profit per item of A is ₹ 25 and per item of B is ₹18. The formulation

Options

  1. Aaligned & Maximize z =25 x+18 y & subject to 20 x+15 y 640 & array r 5 x+8 y 500 x, y 0 array aligned
  2. Barray r Maximize z =25 x+18 y subject to 20 x+15 y 640 5 x+8 y 500 x, y 0 array
  3. Caligned & Maximize z =25 x+18 y & subject to 20 x+5 y 8 & 5 x+8 y 10 & x, y 0 aligned
  4. Darray r Maximize z =25 x+18 y subject to 4 x+3 y 128 array r 5 x+8 y 500 x, y 0 array array

Correct answer

B. array r Maximize z =25 x+18 y subject to 20 x+15 y 640 5 x+8 y 500 x, y 0 array

Step-by-step solution

The linear programming problem requires maximizing profit given machine time constraints. Let x and y represent the quantities produced of items A and B respectively. The objective function to maximize is Z = 25x + 18y , representing the total profit. Machine I operates for 640 minutes (10 hours 40 minutes), with processing times of 20 minutes per unit of A and 15 minutes per unit of B, yielding the constraint 20x + 15y 640 . Machine II operates for 500 minutes (8 hours 20 minutes), with processing times of 5 minut

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.... 2026An 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 airli 2026The shaded region in the provided graph represents the solution set for which of the following systems of linear inequalities? 2026 Full Linear Programming list All MHT CET PYQs