Home
Class 12
MATHS
Corner points of the feasible region for...

Corner points of the feasible region for an LPP are `(0,2),(3,0),(6,0),(6,8)`, and `(0,5)`. Let `F = 4x+6y` be the objective function. Determine the minimum value of `F` occurs at

A

only (0,2)

B

only (3,0)

C

the mid point of the line segment joining the points (0,2) and (3,0)

D

any point of the line segment joining the points (0,2) and (3,0)

Text Solution

Verified by Experts

The correct Answer is:
D

Hence, minimum value of F occurs at any points on the line segement joining the points (0,2) and (3,0).
Promotional Banner

Topper's Solved these Questions

  • INVERSE TRIGONOMETRIC FUNCTIONS

    NCERT EXEMPLAR|Exercise Inverse Trigonometric Functions|55 Videos

  • MATRICES

    NCERT EXEMPLAR|Exercise Matrices|101 Videos

Similar Questions

Explore conceptually related problems

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:

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:

The corner points of the feasible region of an LPP are (0,0), (0,8), (2,7),(5,4),and (6,4). the maximum profit P= 3x + 2y occurs at the point_____.

The corner points of a feasible region of a LPP are (0, 0), (0, 1) and (1, 0). If the objective function is Z = 7x + y, then Z_("max") - Z_("min") =

The corner points of the feasible region are A (50,50), B(10,50),C(60,0) and D (60,4) . The objective function is P=(5)/(2)x+(3)/(2)y+410 . The minimum value of P is at point

The feasible region for an LPP is shown in the below. Let F = 3x - 4y be the objective function. Maximum value of F 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.

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:

The corner points of the feasible region are (0,3), (3,0), (8,0), (12/5,38/5) and (0,10) , then the point of maximum z = 6x + 4y= 48 is at

NCERT EXEMPLAR-LINEAR PROGRAMMING-Linear Programming
  1. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  2. The feasible solution for a LPP is shown in following figure. Let Z=3x...

    Text Solution

    |

  3. Refers to question 27. Maximum of Z occurs at

    Text Solution

    |

  4. Refers to question 7, maximum value of Z+minimum value of Z is equal t...

    Text Solution

    |

  5. The feasible region for an LPP is shown in the following figure. Let F...

    Text Solution

    |

  6. Refers to question 30. Minimum value of F is

    Text Solution

    |

  7. Corner points of the feasible region for an LPP are (0,2),(3,0),(6,0),...

    Text Solution

    |

  8. Refers to question 32, maximum of F-minimum of F is equal to

    Text Solution

    |

  9. Corner points of the feasible region determined by the system of linea...

    Text Solution

    |

  10. In a LPP, the linear inequalities or restrictions on the variables cal...

    Text Solution

    |

  11. In a LPP, the objective function is always.

    Text Solution

    |

  12. In the feasible region for a LPP is ..., then the optimal value of the...

    Text Solution

    |

  13. In a LPP, if the objective function Z=ax+by has the same maximum value...

    Text Solution

    |

  14. A feasible region of a system of linear inequalities is said to be ......

    Text Solution

    |

  15. A corner point of a feasible region is a point in the reqion which is ...

    Text Solution

    |

  16. The feasible region for an LPP is always a..polygon

    Text Solution

    |

  17. If the feasibile region for a LPP is undoubed, maximum or minimum of t...

    Text Solution

    |

  18. Maximum value of the objective function Z = ax +by in a LPP always occ...

    Text Solution

    |

  19. In a LPP, the maximum value of the objective function Z = ax +by is al...

    Text Solution

    |

  20. In a LPP, the maximum value of the objective function Z = ax +by is al...

    Text Solution

    |