Home
Class 12
MATHS
Let the feasible region of the linear pr...

Let the feasible region of the linear programming problem with the objective function Z = ax + by is unbounded and let M and m be the maximum and minimum value of Z, respectively. Now, consider the following statements
I. M is the maximum value of Z, if the open half plane determined by ax + by gt M has no point in common with the feasible region. Otherwise, Z has no maximum value.
II. mis the minimum value of Z, if the open half plane determined by ax + by lt m has no point in common with the feasible region. Otherwise, Z has no minimum value. Choose the correct option.

A

Only I is true .

B

Only II is true

C

Both I and II are true

D

Neither I nor II is true

Text Solution

Verified by Experts

The correct Answer is:
C

In case, the feasible region is unbounded, we have I. Mis the maximum value of Z, if the open half plane determined `ax+ by gt M ` M has no point in common with the feasible region. Otherwise, Z has no maximum value.
II. Similarly, mis the minimum value of Z, if the open half plane determined by `ax+by gt m ` has no point in common with the feasible region. Otherwise, Z has no minimum value.
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

Q.Let f(x)=10-|x-10|AA x in[-9,9] If M and m be the maximum and minimum value of f(x) respectively then

If |z+3|<=3 then minimum and maximum value of |z+1| are respectively

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

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

If the feasibile region for a LPP is undoubed, maximum or minimum of the objective function Z = ax + by may or may not exist.

The feasible region of a system of linear inequalities is shown below. If the objective function is maximise Z = 25x + 15y, then the maximum value of Z occurs at:

Maximum value of the objective function Z = ax +by in a LPP always occurs at only one corner point of the feasible region.

In a LPP, the maximum value of the objective function Z = ax +by is always 0, if origin is one of the corner point of the feasible region.

Find the maximum and minimum values of |z| satisfying |z+(1)/(z)|=2

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

    |