For a given Linear Programming problem, the objective function is Z=3 x+2 y Subject to constraints are aligned & 4 x+3 y 60 & x 3 & y 2 x & y 0 aligned P is one of the corner points of the feasible region for the given Linear Programming problem. Then the coordinate of P is

Step-by-step solution

The feasible region is defined by the constraints 4x + 3y 60 , x 3 , y 2x , and y 0 . First, identify the intersection points of the boundary lines: 1. The line x = 3 intersects y = 0 at (3, 0) . 2. The line x = 3 intersects y = 2x at (3, 6) . 3. The line y = 2x intersects 4x + 3y = 60 . Substituting y = 2x into the equation: 4x + 3(2x) = 60 4x + 6x = 60 10x = 60 x = 6 . Then y = 2(6) = 12 . So, the point is (6, 12) . 4. The line 4x + 3y = 60 intersects y = 0 at 4x = 60 x = 15 . So, the point is (15, 0) . The corne