Home
Class 12
MATHS
Consider the inequalities x1+x2 le 3,2x1...

Consider the inequalities `x_1+x_2 le 3,2x_1+5x_2ge 10x_1,x_2 ge 0` then feasible region is

A

(2,2)

B

(1,2)

C

(2,1)

D

(4,2)

Text Solution

AI Generated Solution

The correct Answer is:
To find the feasible region defined by the inequalities \( x_1 + x_2 \leq 3 \), \( 2x_1 + 5x_2 \geq 10 \), and \( x_1, x_2 \geq 0 \), we will follow these steps: ### Step 1: Graph the first inequality \( x_1 + x_2 \leq 3 \) 1. **Find the intercepts**: - Set \( x_1 = 0 \): \( x_2 = 3 \) (point \( (0, 3) \)) - Set \( x_2 = 0 \): \( x_1 = 3 \) (point \( (3, 0) \)) 2. **Draw the line**: - Plot the points \( (0, 3) \) and \( (3, 0) \) on the graph. - Draw a line through these points. Since the inequality is \( \leq \), shade the area below the line.

To find the feasible region defined by the inequalities \( x_1 + x_2 \leq 3 \), \( 2x_1 + 5x_2 \geq 10 \), and \( x_1, x_2 \geq 0 \), we will follow these steps: ### Step 1: Graph the first inequality \( x_1 + x_2 \leq 3 \) 1. **Find the intercepts**: - Set \( x_1 = 0 \): \( x_2 = 3 \) (point \( (0, 3) \)) - Set \( x_2 = 0 \): \( x_1 = 3 \) (point \( (3, 0) \)) ...
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|13 Videos
  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 Videos
  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos
  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

Consider the inequalities x_(1)+x_(2) le,2, 2x_(1)+5x_(2) ge 10, x_(1),x_(2) ge0 . Which of the following point lie in the fesible region ?

Consider the inequalities 5x_1+4x_2ge9,x_1+x_2 le 3, x_1 ge 0 , x_2 ge 0 Which of the following point lies inside the solution set ?

Consider the inequalities 5x_(1) + 4x_(2) ge 9,x_(1) x_(2) ge 3 , x_(1) gt 0 , x_(2) gt 0 . Which of the following point does not lie inside the solution set ?

Draw the graph of inequalities x le 6,y-2le 0 , xge 0, y ge 0 and indicate the feasible region

Solution set of the inequalities x+2y ge11, 3x+4y le 30, 2x+5y le 30, x ge0, y ge0 includes the point

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.

For the LPP, Min Z= x_1 +x_2 such that inequalities 5x_1+10 x_2 ge 0,+x_2 le 1, x_2le 4 " and " x_1, x_2 ge 0

Find graphically the solution sets of each of the following systems of inequalities : x_(1) - x_(2) le 1 x_(1) + x_(2) ge 3 x_(1), x_(2) ge 0

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. Solve the linear programming problem. Maximise Z = x + 2y Subject ...

    Text Solution

    |

  2. For an LPP, minimise Z = 2x + y subject to constraint 5x+10y le 50 , x...

    Text Solution

    |

  3. Consider the inequalities x1+x2 le 3,2x1+5x2ge 10x1,x2 ge 0 then feas...

    Text Solution

    |

  4. Z=4x+2y,4x+2y ge 46, x +3y le 24 and x and y are greater than or equ...

    Text Solution

    |

  5. The minimum vlaue Z = 2x1 +3x2 subject to the conditions 2x1+7x2ge22...

    Text Solution

    |

  6. The maximum value P = 3x + 4y subjected to the constraints x + y le 40...

    Text Solution

    |

  7. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

  8. The minimum and maximum values problem, of Z for the minimise and ma...

    Text Solution

    |

  9. The linear programming problem minimiseZ=3x+2y subject to the constrai...

    Text Solution

    |

  10. The maximum and minimum values of the objective function Z = x + 2y s...

    Text Solution

    |

  11. The maximum value of the objective function Z=3x+4y subject to th...

    Text Solution

    |

  12. Let x and y are the number of tables and chairs respectively, on which...

    Text Solution

    |

  13. The graphical solution of linear inequalities x+y ge 5 " and " x -y ...

    Text Solution

    |

  14. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  15. A toy company manufactures two types of doll; a basic version doll; a ...

    Text Solution

    |

  16. The minimum value of Z = 10x + By subject to 4x +y ge 4, x +3y ge 6, ...

    Text Solution

    |

  17. The point which provides the solution of the solution to the linear pr...

    Text Solution

    |

  18. Shaded region is represented by , the constraints

    Text Solution

    |

  19. Let R be the feasible region (convex polygon) for a linear programming...

    Text Solution

    |

  20. The minimum value of the objective function Z=x+2y Subject to the c...

    Text Solution

    |