Skip to content
Competitive Stats
Q9Section I (General (compulsory))9 of 190

Locating the optimum along a shared-value edge of the feasible polygon

The graph given below shows the bounded feasible region for the problem: Max z=2x1+x2−12,x1,x2≥0z=2x_1+x_2-12, x_1,x_2\ge0, over the polygon with vertices (reading the graph) (1,7),(2,6),(3,4),(4,2), (4,0),(0,0)(1,7), (2,6), (3,4), (4,2),\ (4,0), (0,0). The objective function attains its maximum when:

Options

Pick an option to check your answer.