Home
Class 12
MATHS
The corner points of the feasible region...

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

A

q = 3p

B

p = 2q

C

q = 2p

D

p = q

Text Solution

Verified by Experts

The correct Answer is:
A
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Evaluation Test|11 Videos

  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Critical Thinking|28 Videos

  • LINE

    TARGET PUBLICATION|Exercise Evaluation Test|1 Videos

  • MATHEMATICAL LOGIC

    TARGET PUBLICATION|Exercise EVALUATION TEST|14 Videos

Similar Questions

Explore conceptually related problems

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 ………

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 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:

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 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 system of linear contraints are (0,0), (0,40),( 20,40),(60,20),(60,0). The objective function is Z=4x+3y. Compare the quantity in Column A and Column B.

The corner points of the feasible region of the system of linear inequations x+yge2,x+yle5,x-yge0,x,yge0 are :

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:

The corner points of the feasible region of a system of linear inequations are (0, 0), (5, 0), (6,5), (6, 8), (4, 10) and (0,8). If Z = 3x - 4y, then the minimum value of Z occurs at:

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. The maximum value of 2x+y subject to 3x+5yle26and5x+3yle30,xge0,yge0...

    Text Solution

    |

  2. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  3. The maximum value of 4x +5y subject to the constraints x+yle20,x+2yle...

    Text Solution

    |

  4. Max value of z equal 3x + 2y subject to x+yle3,xle2,-2x+yle1,xge0,yge...

    Text Solution

    |

  5. The point at which , the maximum value of (3x+2y) subject to the const...

    Text Solution

    |

  6. The point which provides the solution of the linear programming proble...

    Text Solution

    |

  7. The points which provides the solution to the linear programming probl...

    Text Solution

    |

  8. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  9. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  10. The minimum value of z=2z(1)+3x-(2) subjected to the constraints 2x(1)...

    Text Solution

    |

  11. The minimum value of the objective function Z=2x+10y for linear const...

    Text Solution

    |

  12. For the following linear programming problem minimize Z=4x+6y subject ...

    Text Solution

    |

  13. The co-ordinates of the point for minimum value z = 7x - 8y subject ...

    Text Solution

    |

  14. Minimise and Maximise Z=5x+10y Subject to x+2yle120,x+yge60,x-2yge0,...

    Text Solution

    |

  15. The objective function, z=4x(1)+5x(2), subject to 2x(1)+x(2)ge7,2x(1)+...

    Text Solution

    |

  16. The objective function z = x1 + x2, subject to x1 + x2 leq 10,-2x1 + 3...

    Text Solution

    |

  17. Minimize z = 30x+20y subject to x+yle8,x+2yge4,6x+4yge12,xge,yge0

    Text Solution

    |

  18. The maximum value of z = 4x +3y subject to the constraints 3x+2yge160...

    Text Solution

    |

  19. For the LPP , maximize z = x + 4y subject to the constraints x+2yle2,...

    Text Solution

    |

  20. The maximum value of z = 4x +2y subject to the constraints 2x+3yle18,x...

    Text Solution

    |