Home
Class 12
MATHS
Objective function of a LPP is …………...

Objective function of a LPP is …………

A

a constraint

B

a function to be optimized

C

a relation between the variables

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
B
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

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

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.

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

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

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

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

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

KUMAR PRAKASHAN-LINEAR PROGRAMMING-MULTIPLE CHOICE QUESTIONS
  1. The maximum value of Z = x + 4y subject to the constraints 3x+6y le 6,...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  10. The solution set of the constraints x+2y ge 11, 3x+4y le 30, 2x+5y le ...

    Text Solution

    |

  11. The feasible region of the inequality x+y le 1" and "x-y le 1 lies in ...

    Text Solution

    |

  12. The following five inequalities form the feasible region. 2x-y le 8, x...

    Text Solution

    |

  13. The position of the points O(0, 0) and P(2, -1) is ………, in the region ...

    Text Solution

    |

  14. The constraints x+y le 4, 3x+3y ge 18, x ge 0, y ge 0 defines on ………

    Text Solution

    |

  15. The solution set of the constraints x+2y le 2000, x+y le 1500, y le 60...

    Text Solution

    |

  16. Out of the following points, how many points are satisfied the inequal...

    Text Solution

    |

  17. How many points having integer co-ordinates are there in the feasible ...

    Text Solution

    |

  18. z = 30x - 30y + 1800 is a objective function. The corner points of the...

    Text Solution

    |

  19. The corner points of the bounded feasible region are (0, 1), (0, 7), (...

    Text Solution

    |

  20. The constraints -x+y le 1, -x+3y le 9, x ge 0, y ge 0 defines on ………

    Text Solution

    |