Home
Class 12
MATHS
The feasible region is the set of point ...

The feasible region is the set of point which satisfy

A

common region determined by all the constraints

B

common region determined by the non-negativity constraints

C

either of the options a or b

D

either of the options a or b

Text Solution

Verified by Experts

The correct Answer is:
D
Promotional Banner

Topper's Solved these Questions

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II LINEAR PROGRAMMING PROBLEMS (B. State whether each of the following statement is TRUE or FALSE)|12 Videos

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II LINEAR PROGRAMMING PROBLEMS (C. Fill in each of the following blanks)|12 Videos

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II 5. INDEX NUMBERS (V Activity)|1 Videos

  • PROBABILITY DISTRIBUTION

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|9 Videos

  • THREE DIMENSIONAL GEOMETRY

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|8 Videos

Similar Questions

Explore conceptually related problems

Feasible region is represented by

The corner points of the feasible region of the system of linear inequations x+yge2,x+yle5,x-yge0,x,yge0 are :

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

Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y is maximum?

Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?

Define the feasible region.

Consider the following LPP: Maximize Z = 3x + 2y subject to the constraints: x + 2y le 10, 3x + y le 15, x, y ge 0 . (a) Draw the feasible region. (b)Find the corner points of the feasible region. (c) Find the maximum value of Z.

The corner point method for bounded feasible region comprises of the following steps I. When the feasible region is bounded, M and m are the maximum and minimum values of Z. II. Find the feasible region of the linear programming problem and determine its corner points. Ill. Evaluate the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values of these points. The correct order of these above steps is

In the given figure, if the shaded region is the feasible region and the objective function is z = x - 2y, the minimum value of Z occurs at: