Quantrex Quantrex AcademyJEE · NEET · NDA PYQs with solutions Open app
KCET2026MathematicsLinear Programming

In 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

Options

  1. A1
  2. B2
  3. C0
  4. DInfinity

Correct answer

D. Infinity

Step-by-step solution

According to the Fundamental Theorem of Linear Programming, if the optimal value of the objective function occurs at two distinct corner points of the feasible region, it also occurs at all points on the line segment joining these two points. Since a line segment contains an infinite number of points, the maximum value Z_ max occurs at infinitely many points. Answer: Infinity

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 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? 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 KCET PYQs