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 finite.

Text Solution

Verified by Experts

The correct Answer is:
True statement
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise MULTIPLE CHOICE QUESTIONS|42 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise TEXTBOOK ILLUSTRATIONS FOR PRACTICE WORK|11 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

In a 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.

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

The corner points of the feasible region are (0, 0), (16, 0), (8, 12), (0, 20). The maximum value of the objective function Z = 22x + 18y is …………

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

Objective function of a LPP is …………

Objective function of a LPP is …………

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

What is the maximum value of the function sin x + cos x ?

The corner points of the bounded feasible region for L.P problem are A (0,4) ,B (0,5) , C( 3,5) , D(5,3) , E(5,0) ,F(4,0) . Obtain the maximum and minimum value of the objective function z=10 x -7y +1900 .

KUMAR PRAKASHAN-LINEAR PROGRAMMING-SOLUTIONS OF NCERT EXEMPLAR PROBLEMS
  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 Figure Let z = -3x - 4y ...

    Text Solution

    |

  3. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  4. The corner points of the bounded feasible region are (0, 0), (0, 8), (...

    Text Solution

    |

  5. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

  6. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

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

    Text Solution

    |

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

    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 are...

    Text Solution

    |

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

    Text Solution

    |

  12. If the feasible region for a LPP is …………, then the optimal value of th...

    Text Solution

    |

  13. In a LPP if the objective function z = ax + by has the same maximum va...

    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 region which is ...

    Text Solution

    |

  16. The feasible region for an LLP is always a …….. polygon.

    Text Solution

    |

  17. If the feasible region for a LPP is unbounded, maximum or minimum of t...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |