Home
Class 12
MATHS
The optimal value of the objective funct...

The optimal value of the objective function is attained at the points ……..

A

given by intersection of inequations with the axes only

B

given by intersection of inequations with X - axis only

C

given by corner points of the feasible region

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE WORK|25 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise SOLUTIONS OF NCERT EXEMPLAR PROBLEMS|44 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

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

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

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 …………

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

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.

Objective function of a LPP is …………

Objective function of a LPP is …………

The objective function of a linear programming problem is ..........

If the vertices of a feasible region are O(0, 0), A(10, 0), B(0, 20), C(15, 15), then minimum value of a objective function Z = 10x - 20y + 30 is ………

KUMAR PRAKASHAN-LINEAR PROGRAMMING-MULTIPLE CHOICE QUESTIONS
  1. Solution set of the inequality 2x+y gt 5 is ………

    Text Solution

    |

  2. The optimal value of the objective function is attained at the points ...

    Text Solution

    |

  3. The region formed by the inequalities x, y ge 0, y le 6, x+y le 3 is …...

    Text Solution

    |

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

    Text Solution

    |

  5. For linear programming x+2y ge 10, 3x+4y le 24" and "x ge 0, y ge 0 ……...

    Text Solution

    |

  6. The region represented by the inequation x-y le -1, x-y le 0, x le 0, ...

    Text Solution

    |

  7. Let x and y are optimal solution of a LPP, then …

    Text Solution

    |

  8. The feasible solution of LPP ………..

    Text Solution

    |

  9. Which of the following statement is correct ?

    Text Solution

    |

  10. Consider a LPP given by minimise Z = 6x + 10y. Subject to x ge 6, y ge...

    Text Solution

    |

  11. Objective function of a LPP is …………

    Text Solution

    |

  12. The maximum value of Z = x + 4y subject to the constraints 3x+6y le 6,...

    Text Solution

    |

  13. The corner points of the feasible region determined by some inequality...

    Text Solution

    |

  14. Objective function of a LPP is …………

    Text Solution

    |

  15. The corner points of the feasible region are A(3, 3), B(20, 3), C(20, ...

    Text Solution

    |

  16. Cake-A requires 200g of flour and 25g of fat Cake-B requires 100 g of ...

    Text Solution

    |

  17. The shaded region in the given figure is a graph of ……………

    Text Solution

    |

  18. The point at which the maximum value of Z = 3x + 2y subject to the con...

    Text Solution

    |

  19. The solution of linear programming problem, maximize Z=3x(1)+5x(2) sub...

    Text Solution

    |

  20. The maximum value of Z = x + 3y subject to the constraints 2x+y le 20,...

    Text Solution

    |