The vertices of a closed - convex polygon representing the feasible region of the objective function f =5x+3y , are (0,0),(3,0),(3,1),(1,3) and (0,4) . Find the maximum value of the objective function.

The vertices of a closed - convex polygon representing the feasible region of the objective function f are (4,0), (2,4),(3,2) and (1,4) . Find the maximum value of the objective function f=7x+8y.

The vertices of a closed convex polygon representing the feasible region of the objective function are (6,2),(4,6),(5,4) and (3,6). Find the maximum value of the function f=7x+11y

The corner points of the feasible region of an LPP are (0,0),(0,8),(2,7),(5,4) and (6,0). The maximum value of the objective function Z = 3x + 2y is:

If the corner points of the feasible region for an L.P.P. are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5), then the minimum value of the objective function F=4x+6y occurs at

If the vertices of a closed - convex polygon are A(8,0), O(0,0), B (20,10), C(24,5) and D(16,20), then find the maximum value of the objective function f=(1)/(4)x+(1)/(5) y .

The corner points of the feasible region are (0, 0), (16, 0), (8, 12), (0, 20). The maximum value of the objective function Z = 22x + 18y is …………

The corner points of the feasible region of a system of linear inequalities are (0, 0), (4,0), (3,9), (1, 5) and (0, 3). If the maximum value of objective function, Z = ax + by occurs at points (3, 9) and (1, 5), then the relation between a and b is: