Home
Class 12
MATHS
The graphical solution of linear inequal...

The graphical solution of linear inequalities `x+y ge 5 " and " x -y le 3, `

A

B

C

D

Text Solution

AI Generated Solution

The correct Answer is:
To solve the given linear inequalities graphically, we will follow these steps: ### Step 1: Understand the inequalities We have two inequalities: 1. \( x + y \geq 5 \) 2. \( x - y \leq 3 \) ### Step 2: Convert inequalities to equations To graph these inequalities, we first convert them into equations: 1. \( x + y = 5 \) 2. \( x - y = 3 \) ### Step 3: Find intercepts for the first equation For the equation \( x + y = 5 \): - When \( x = 0 \), \( y = 5 \) (Point: \( (0, 5) \)) - When \( y = 0 \), \( x = 5 \) (Point: \( (5, 0) \)) ### Step 4: Plot the first line Plot the points \( (0, 5) \) and \( (5, 0) \) on the coordinate system and draw a straight line through these points. Since the inequality is \( \geq \), we shade the area above this line. ### Step 5: Find intercepts for the second equation For the equation \( x - y = 3 \): - When \( x = 0 \), \( y = -3 \) (Point: \( (0, -3) \)) - When \( y = 0 \), \( x = 3 \) (Point: \( (3, 0) \)) ### Step 6: Plot the second line Plot the points \( (0, -3) \) and \( (3, 0) \) on the coordinate system and draw a straight line through these points. Since the inequality is \( \leq \), we shade the area below this line. ### Step 7: Identify the feasible region The feasible region is where the shaded areas from both inequalities overlap. This region represents all the solutions that satisfy both inequalities. ### Step 8: Conclusion The graphical solution to the inequalities \( x + y \geq 5 \) and \( x - y \leq 3 \) is the shaded area where both conditions are satisfied. ---

To solve the given linear inequalities graphically, we will follow these steps: ### Step 1: Understand the inequalities We have two inequalities: 1. \( x + y \geq 5 \) 2. \( x - y \leq 3 \) ### Step 2: Convert inequalities to equations ...
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

The solution set of the linear inequalities 2x + 2y ge 10 and x+ 2y ge 10

The solution set of the linear inequalities 2x + y ge 8 and x + 2y ge 10 is

A vertex of common graph of inequalities 2x+y ge 2 and x-y le 3 , is

The solution of the system of inequalities x ge 0, x-5 le 0 and x ge y is a polygonal region with the vertices as

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  12. Shaded region is represented by , the constraints

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  15. Let the feasible region of the linear programming problem with the obj...

    Text Solution

    |

  16. The minimum and maximum values of the objective function, Z = 5x + 1...

    Text Solution

    |

  17. Consider the following statements I. If the feasible region of an L...

    Text Solution

    |

  18. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  19. (Allocation problem) A cooperative society of farmers has 50 hectar...

    Text Solution

    |

  20. Anil wants to invest at the most Rs.12000 in bonds. A and B. According...

    Text Solution

    |