Home
Class 12
MATHS
If the feasible region for a linear prog...

If the feasible region for a linear programming problem is bounded, then the objective function Z = ax+by has both a maximum and a minimum value on R.

Text Solution

Verified by Experts

The correct Answer is:
True
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 6 MARKS |7 Videos

  • LINEAR PROGRAMMING

    ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 1 MARK (TYPE-II : FILL IN THE BLANKS QUESTIONS) |11 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 4 MARKS|27 Videos

  • MATRICES

    ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 6 MARKS |4 Videos

Similar Questions

Explore conceptually related problems

True or false If the feasible region R for an LPP is bounded, then the objective function Z=ax+by has both the maximum and the minimum values of the region R.

Show that the function f(x) =x^3 +x^2 + x + 1 has neither a maximum value nor a minimum value.

Knowledge Check

  • The feasible region for an LPP is shown in the figure. Let F = 3 x - 4 y be the objective function. Maximum value of F is:

    A
    0
    B
    8
    C
    12
    D
    `-18`

    • Similar Questions

    Explore conceptually related problems

    In linear programming, objective function and objective constraints are:

    The function f(x) = x^2, x inR has no maximum value.

    Fill ups If the feasible region for an LPP is ……………..then the optimal value of the objective function Z=ax+by may or may not exist.

    Feasible region for an LPP is shown shaded in the figure 12.46. Maximize the objective function Z=5x+7y.

    The feasible region for an LPP is shown shaded in the figure 12.83. Let f=3x-4y be the objective function, the maximum vlaue of f is

    If |z+(4)/(z)|=2, find the maximum and minimum values of |z|.

    Solve the following linear programming problem graphically. Minimize the objective function Z = 2x + 3y subject to the constraints x + y le 120, x + y ge 80, x le 80, y ge 60, x ge 0, y ge 0 .

    Home
    Profile