Home
Class 12
MATHS
Solve the linear programming problem. Ma...

Solve the linear programming problem. Maximise Z = x + 2y
Subject to constraints `x - y le 10, 2x +3y le 20 ` and ` x ge 0, y ge 0 `

A

Z=10

B

Z=30

C

Z=40

D

None of these

Text Solution

AI Generated Solution

The correct Answer is:
To solve the linear programming problem, we need to maximize the objective function \( Z = x + 2y \) subject to the given constraints. Let's go through the steps systematically. ### Step 1: Identify the Constraints The constraints given are: 1. \( x - y \leq 10 \) 2. \( 2x + 3y \leq 20 \) 3. \( x \geq 0 \) 4. \( y \geq 0 \) ### Step 2: Convert Inequalities to Equations To find the boundary lines, we convert the inequalities into equations: 1. \( x - y = 10 \) 2. \( 2x + 3y = 20 \) ### Step 3: Find the Intercepts For the first equation \( x - y = 10 \): - When \( x = 0 \): \( 0 - y = 10 \) → \( y = -10 \) (not valid since \( y \geq 0 \)) - When \( y = 0 \): \( x - 0 = 10 \) → \( x = 10 \) (point is \( (10, 0) \)) For the second equation \( 2x + 3y = 20 \): - When \( x = 0 \): \( 2(0) + 3y = 20 \) → \( y = \frac{20}{3} \) (point is \( (0, \frac{20}{3}) \)) - When \( y = 0 \): \( 2x + 3(0) = 20 \) → \( x = 10 \) (point is \( (10, 0) \)) ### Step 4: Find the Intersection of the Lines To find the intersection of the lines \( x - y = 10 \) and \( 2x + 3y = 20 \), we can solve these equations simultaneously. From \( x - y = 10 \), we can express \( y \) in terms of \( x \): \[ y = x - 10 \] Substituting \( y \) in the second equation: \[ 2x + 3(x - 10) = 20 \] \[ 2x + 3x - 30 = 20 \] \[ 5x - 30 = 20 \] \[ 5x = 50 \] \[ x = 10 \] Substituting \( x = 10 \) back to find \( y \): \[ y = 10 - 10 = 0 \] So, the intersection point is \( (10, 0) \). ### Step 5: Identify the Feasible Region The feasible region is determined by the constraints: - The line \( x - y = 10 \) is above the line. - The line \( 2x + 3y = 20 \) is below the line. - The region is also restricted to the first quadrant due to \( x \geq 0 \) and \( y \geq 0 \). The vertices of the feasible region are: 1. \( (0, 0) \) 2. \( (10, 0) \) 3. \( (0, \frac{20}{3}) \) ### Step 6: Evaluate the Objective Function at Each Vertex Now, we evaluate \( Z = x + 2y \) at each vertex: 1. At \( (0, 0) \): \( Z = 0 + 2(0) = 0 \) 2. At \( (10, 0) \): \( Z = 10 + 2(0) = 10 \) 3. At \( (0, \frac{20}{3}) \): \( Z = 0 + 2(\frac{20}{3}) = \frac{40}{3} \) ### Step 7: Determine the Maximum Value Comparing the values: - \( Z(0, 0) = 0 \) - \( Z(10, 0) = 10 \) - \( Z(0, \frac{20}{3}) = \frac{40}{3} \approx 13.33 \) The maximum value of \( Z \) occurs at the point \( (0, \frac{20}{3}) \) with \( Z = \frac{40}{3} \). ### Final Answer The maximum value of \( Z \) is \( \frac{40}{3} \) at the point \( (0, \frac{20}{3}) \). ---

To solve the linear programming problem, we need to maximize the objective function \( Z = x + 2y \) subject to the given constraints. Let's go through the steps systematically. ### Step 1: Identify the Constraints The constraints given are: 1. \( x - y \leq 10 \) 2. \( 2x + 3y \leq 20 \) 3. \( x \geq 0 \) 4. \( y \geq 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 linear programming problem Maximise Z = 4x + y. Subject to constraints x+y le 50, x +y ge 100 and x ,y ge 0 Then, maximum vlaue of Z is

Maximize : Z = x + y ,subject to the constraints: x - y le -1, -x + y le 0, x ge 0, y ge 0

Maximize z = 5x + 10y subject to constraints x + 2y le 10 , 3x + y le 12 , x ge 0 , y ge 0

Maximize Z = 5x + 3y subject to the constraints: 3x + 5y le 15, 5x + 2y le 10, x ge 0, y ge 0

Maximize Z = 400x + 500y subject to constraints x + 2y le 80 ,2x + y le 90, x ge 0 , y ge 0

Maximise Z=3x+4y, Subjected to the constraints x+y le1, x ge 0, y ge 0

The point which provides the solution of the linear programming problem, maximise Z = 45x + 55y. Subject to constraints Subject to constraints x,y ge 0, 6x +4y le 120 and 3x +10 y le 180 is

Minimize Z = -3x + 4y subject ot constraints : x + 2y le 8, 3x + 2y le 12, x ge 0, y ge 0 .

Minimize Z = 3x + 2y subject to the constraints : x + y ge 8, 3x + 5y le 15, x ge 0, y ge 0 .

The linear programming problem minimiseZ=3x+2y subject to the constraints x+y ge 8 3x +5y le 15 x ge 0, y ge 0 has

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. if x+y le 2,x ge 0 then point at which maximum value of 3x + 2y at...

    Text Solution

    |

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

    Text Solution

    |

  3. Solve the linear programming problem. Maximise Z = x + 2y Subject ...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  20. Shaded region is represented by , the constraints

    Text Solution

    |