KCET2022MathematicsLinear Programming

The corner points of the feasible region of an LPP are (0,2),(3,0),(6,0),(6,8) and (0,5) , then the minimum value of z=4 x+6 y occurs at

Options

AFinite number of points
BInfinite number of points
COnly one point
DOnly two points

Correct answer

D. Only two points

Step-by-step solution

Given, the corner points of the feasible region of an LPP are (0,2),(3,0),(6,0),(6,8) and (0,5) Minimum value of z occurs at (0,2) and (3,0) . Hence, minimum value of z lies at any point on the line joining two points (0,2) and (3,0) .

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 2026 Which 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 2026 The 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 2026 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 2026 The LPP maximize z = 2x + 5y subject to x + 3y 6 , 2x + 6y 18 , x 0 , y 0 has 2026 The 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.... 2026 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 airli 2026 The 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 KCET PYQs