Home
Class 12
MATHS
Consider a LPP given by minimise Z = 6x ...

Consider a LPP given by minimise Z = 6x + 10y. Subject to `x ge 6, y ge 2, 2x+y ge 10, x ge 0, y ge 0`. Redundant constraints in this LPP are ………..

A

`x ge 6, y ge 2`

B

`2x+y ge 10, x ge 0, y ge 0`

C

`x ge 6`

D

`x ge 6, y ge 0`

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE WORK|25 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise SOLUTIONS OF NCERT EXEMPLAR PROBLEMS|44 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 2 (SECTION - D)|2 Videos

  • MATRICES

    KUMAR PRAKASHAN|Exercise Practice Paper - 3 (Section - D)|1 Videos

Similar Questions

Explore conceptually related problems

x ge 3, y ge 2

2x+y ge 6

in solving the L.P problem " minimize z= 6 x + 10 y subject to x ge 6, y ge 2, 2x +y ge 10 , x ge 0 y ge 0" redundant constraints are ……..

x+2y le 10, x+y ge 1, x-y le 0, x ge0, y ge0

4x+3y le 60, y ge 2x, x ge 3, x, y ge 0

x-2y le 3, 3x+4y ge 12, x ge 0, y ge 1

3x+2y le 12, x ge 1, y ge 2

5x+4y le 20, x ge 1, y ge 2

Maximise z = x + y subject ot x+4y le 8, 2x+3y le 12, 3x+y le 9, x ge 0, y ge 0 .

3x+4y le 60, x +3y le 30, x ge 0, y ge0

KUMAR PRAKASHAN-LINEAR PROGRAMMING-MULTIPLE CHOICE QUESTIONS
  1. The feasible solution of LPP ………..

    Text Solution

    |

  2. Which of the following statement is correct ?

    Text Solution

    |

  3. Consider a LPP given by minimise Z = 6x + 10y. Subject to x ge 6, y ge...

    Text Solution

    |

  4. Objective function of a LPP is …………

    Text Solution

    |

  5. The maximum value of Z = x + 4y subject to the constraints 3x+6y le 6,...

    Text Solution

    |

  6. The corner points of the feasible region determined by some inequality...

    Text Solution

    |

  7. Objective function of a LPP is …………

    Text Solution

    |

  8. The corner points of the feasible region are A(3, 3), B(20, 3), C(20, ...

    Text Solution

    |

  9. Cake-A requires 200g of flour and 25g of fat Cake-B requires 100 g of ...

    Text Solution

    |

  10. The shaded region in the given figure is a graph of ……………

    Text Solution

    |

  11. The point at which the maximum value of Z = 3x + 2y subject to the con...

    Text Solution

    |

  12. The solution of linear programming problem, maximize Z=3x(1)+5x(2) sub...

    Text Solution

    |

  13. The maximum value of Z = x + 3y subject to the constraints 2x+y le 20,...

    Text Solution

    |

  14. The solution set of the constraints x+2y ge 11, 3x+4y le 30, 2x+5y le ...

    Text Solution

    |

  15. The feasible region of the inequality x+y le 1" and "x-y le 1 lies in ...

    Text Solution

    |

  16. The following five inequalities form the feasible region. 2x-y le 8, x...

    Text Solution

    |

  17. The position of the points O(0, 0) and P(2, -1) is ………, in the region ...

    Text Solution

    |

  18. The constraints x+y le 4, 3x+3y ge 18, x ge 0, y ge 0 defines on ………

    Text Solution

    |

  19. The solution set of the constraints x+2y le 2000, x+y le 1500, y le 60...

    Text Solution

    |

  20. Out of the following points, how many points are satisfied the inequal...

    Text Solution

    |