Home
Class 12
MATHS
Let R be the feasible region (convex pol...

Let R be the feasible region (convex polygon) for a linear programming problem and Z = ax + by be the objective function. Then, which of the following statements is false? A) When Z has an optimal value, where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region . B)If R is bounded, then the objective function Z has both a maximum and a minimum value on Rand each of these occurs at a corner point of R . C) If R is unbounded, then a maximum or a minimum value of the objective function may not exist D) If R is unbounded and a maximum or a minimum value of the objective function z exists, it must occur at corner point of R

A

When Z has an optimal value, where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region .

B

If R is bounded, then the objective function Z has both a maximum and a minimum value on Rand each of these occurs at a corner point of R .

C

If R is unbounded, then a maximum or a minimum value of the objective function may not exist

D

If R is unbounded and a maxil'TUJm or a minimum value of the objective function z exists, it must occur at corner point of R

Text Solution

Verified by Experts

The correct Answer is:
D

If the feasible region is unbounded and the maximum or a minimum value of Z exists, it must occur at a corner point of R.
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|13 Videos
  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 Videos
  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos
  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

Define a corner point of a feasible region.

One of the corner points of the feasible region of inequalities gives

The optimal value of the objective function is attained at the points

The optimal value of the objective function is attained at the points

The feasible region for an LPP is shown in the Let Z = 4x + 3y be the objective function. Maximum of Z occur at :

In the given graph, the feasible region for a LPP is shaded. The objective function Z = 2x – 3y, will be minimum at:

In the feasible region for a LPP is ..., then the optimal value of the objective function Z= ax + by may or may not exist.

In case of a linear programming problem, feasible region is always

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

  2. The minimum and maximum values problem, of Z for the minimise and ma...

    Text Solution

    |

  3. The linear programming problem minimiseZ=3x+2y subject to the constrai...

    Text Solution

    |

  4. The maximum and minimum values of the objective function Z = x + 2y s...

    Text Solution

    |

  5. The maximum value of the objective function Z=3x+4y subject to th...

    Text Solution

    |

  6. Let x and y are the number of tables and chairs respectively, on which...

    Text Solution

    |

  7. The graphical solution of linear inequalities x+y ge 5 " and " x -y ...

    Text Solution

    |

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

    Text Solution

    |

  9. A toy company manufactures two types of doll; a basic version doll; a ...

    Text Solution

    |

  10. The minimum value of Z = 10x + By subject to 4x +y ge 4, x +3y ge 6, ...

    Text Solution

    |

  11. The point which provides the solution of the solution to the linear pr...

    Text Solution

    |

  12. Shaded region is represented by , the constraints

    Text Solution

    |

  13. Let R be the feasible region (convex polygon) for a linear programming...

    Text Solution

    |

  14. The minimum value of the objective function Z=x+2y Subject to the c...

    Text Solution

    |

  15. Let the feasible region of the linear programming problem with the obj...

    Text Solution

    |

  16. The minimum and maximum values of the objective function, Z = 5x + 1...

    Text Solution

    |

  17. Consider the following statements I. If the feasible region of an L...

    Text Solution

    |

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

    Text Solution

    |

  19. (Allocation problem) A cooperative society of farmers has 50 hectar...

    Text Solution

    |

  20. Anil wants to invest at the most Rs.12000 in bonds. A and B. According...

    Text Solution

    |