Home
Class 12
MATHS
In a LPP if the objective function z = a...

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

Text Solution

Verified by Experts

The correct Answer is:
Has same maximum value
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

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 minimum value of the objective function Z = ax + by is always 0, if origin is one of the corner point of the feasible region.

A corner point of a feasible region is a point in the region which is the ……….. of two boundary lines.

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

Determine the maximum value of z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure.

Find the value of a, for which point P(a/3 ,2) is the midpoint of the line segment joining the points Q (-5, 4) and R (-1, 0) .

If the graphs of the functions y= log _(e)x and y = ax intersect at exactly two points,then find the value of a .

On which points the electric field intensity of the dipole is parallel to the line joining the two charges of the electric dipole ?

Find the ratio in which the point (-3, p) divides the line segment joining points (-5, -4) and (-2, 3) . Hence find the value of p

Prove that line segment joining mid points of the two sides of the triangle is parallel to third side.

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

    |