Corner poins of the feasible region determned by the system of linear constrainsts are (0,3), (1,1), and (3,0). Let Z=px+qy. Where `p, q lt 0` Condition on p and q, so that the minimum f Z occurs at (3,0) and (1,1) is

Corner poins of the feasible region determned by the system of linear constrainsts are (0,3), (1,1), and (3,0). Let Z=px+qy. Where p, q lt 0 Condition on p and q, so that the minimum of Z occurs at (3,0) and (1,1) is

The corner points of the feasible region determined by the system of linear constraints are (0,10) , (5,5) (25,20),(0,30) Let z = px + qy , where p,qgt0 Condition on p and q so that te maximum of z occurs at both the points (25,20 ) and (0,30) is ………

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 gt 0 . Then, the condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20), is

The corner points of the feasible region determined by the system of linear constraints are as shown below: Let Z=px +qy where p,q gt 0 be the objective function. Find the condition on p and q so that the maximum value of Z occurs at B ( 4,10 ) and C (6,8 ) Also mention the number of optimal solutions in this case.

The corner points of the feasible region determined by the following system of linear inequalities: 2x+yge10, x+3yle15,x,yge0 are (0,0),(5,0),(3,4) and (0,5) . Let Z=px+qy , where p,qge0 . Condition on p and q so that the maximum of Z occurs at both (3,4) and (0,5) is: (a) p=q (b) p=2q (c) p=eq (d) q=3p

For an objective function Z = ax + by," where "a,b gt 0, the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:

The corner points of a feasible region determined by a system of linear inequations are (0, 0), (4,0), (5,2), (2, 2) and (0, 1). If the objective function is Z = x + y, then maximum of Z occurs at:

For an objective function Z = ax + by, where a, bgt0 , the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20). (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum z occurs at both the points (30, 30) and (0, 40) is:

The corneer points of a feasible region, determined by a system of linear inequations, are (0,0),(1,0),(4,3),(2,1) and (0,1). If the objective function is Z = 2x - 3y, then the minimum value of Z is :

The corner points of a feasible region determined by a system of linear inequalities are (20,40),(50,100),(0,200) and (0,50). If the objective funtion Z=x+2y , then maximum of Z occurs at.