Home
Class 12
MATHS
In a LPP, the maximum value of the objec...

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.

Text Solution

Verified by Experts

N/a
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

Consider the following statements I. If the feasible region of an LPP is undbounded then maximum or minimum value of the obJective function Z = ax + by may or may not exist . II. Maximum value of the objective function Z = ax + by in an LPP always occurs at only one corner point of the feasible region. Ill. In an LPP, the minimum value of the objective function Z = ax + by is always 0, if origin is one of the corner point of the feasible region. IV. In an LPP, the maximum value of the objective function Z = ax + by is always finite. Which of the following statements are true?

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

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

Define a corner point of a feasible region.

The maximum value of objective function Z = 3 x + y under given feasible region is

In a LPP, the objective function is always.

The maximum value of objective function z=2x+3y in the given feasible region is

The, objective function is maximum or minimum at a point, which lies on the boundary of the feasible region.

In a LPP, if the objective function Z=ax+by has the same maximum value of two corner points of the feasible region, then every point of the line segment joining these two points give the same ..value.

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

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

    |