Home
Class 12
MATHS
Minimise Z=13x-15y subject to the constr...

Minimise Z=13x-15y subject to the constraints ` x+y le 7, 2x-3y+6 ge 0, x ge 0, x ge 0, and y ge 0`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the linear programming problem of minimizing \( Z = 13x - 15y \) subject to the constraints: 1. \( x + y \leq 7 \) 2. \( 2x - 3y + 6 \geq 0 \) (which can be rewritten as \( 2x - 3y \geq -6 \)) 3. \( x \geq 0 \) 4. \( y \geq 0 \) we will follow these steps: ### Step 1: Identify the constraints We have the following constraints: - \( x + y \leq 7 \) - \( 2x - 3y \geq -6 \) - \( x \geq 0 \) - \( y \geq 0 \) ### Step 2: Rewrite the inequalities The second constraint can be rewritten as: - \( 2x - 3y \geq -6 \) can be rearranged to \( 2x - 3y = -6 \). ### Step 3: Find the intersection points of the constraints To find the feasible region, we need to find the intersection points of the lines defined by the equations of the constraints. 1. **For \( x + y = 7 \)**: - If \( x = 0 \), then \( y = 7 \) (point \( (0, 7) \)). - If \( y = 0 \), then \( x = 7 \) (point \( (7, 0) \)). 2. **For \( 2x - 3y = -6 \)**: - If \( x = 0 \), then \( -3y = -6 \) → \( y = 2 \) (point \( (0, 2) \)). - If \( y = 0 \), then \( 2x = -6 \) → \( x = -3 \) (not feasible since \( x \geq 0 \)). ### Step 4: Find the intersection of the two lines To find the intersection point of \( x + y = 7 \) and \( 2x - 3y = -6 \): 1. From \( x + y = 7 \), we can express \( y \) as \( y = 7 - x \). 2. Substitute \( y \) in \( 2x - 3(7 - x) = -6 \): \[ 2x - 21 + 3x = -6 \implies 5x - 21 = -6 \implies 5x = 15 \implies x = 3. \] 3. Substitute \( x = 3 \) back into \( y = 7 - x \): \[ y = 7 - 3 = 4. \] So, the intersection point is \( (3, 4) \). ### Step 5: Identify the feasible region The feasible region is bounded by the points: - \( (0, 0) \) - \( (7, 0) \) - \( (0, 2) \) - \( (3, 4) \) ### Step 6: Evaluate the objective function at the vertices Now we evaluate \( Z = 13x - 15y \) at each of the vertices: 1. At \( (0, 0) \): \[ Z = 13(0) - 15(0) = 0. \] 2. At \( (7, 0) \): \[ Z = 13(7) - 15(0) = 91. \] 3. At \( (0, 2) \): \[ Z = 13(0) - 15(2) = -30. \] 4. At \( (3, 4) \): \[ Z = 13(3) - 15(4) = 39 - 60 = -21. \] ### Step 7: Determine the minimum value The minimum value of \( Z \) occurs at \( (0, 2) \) where \( Z = -30 \). ### Final Answer The minimum value of \( Z \) is \( -30 \) at the point \( (0, 2) \). ---

To solve the linear programming problem of minimizing \( Z = 13x - 15y \) subject to the constraints: 1. \( x + y \leq 7 \) 2. \( 2x - 3y + 6 \geq 0 \) (which can be rewritten as \( 2x - 3y \geq -6 \)) 3. \( x \geq 0 \) 4. \( y \geq 0 \) we will follow these steps: ...
Promotional Banner

Topper's Solved these Questions

  • INVERSE TRIGONOMETRIC FUNCTIONS

    NCERT EXEMPLAR|Exercise Inverse Trigonometric Functions|55 Videos
  • MATRICES

    NCERT EXEMPLAR|Exercise Matrices|101 Videos

Similar Questions

Explore conceptually related problems

Maximize z= 7x+11y subject to the constraints 3x+5y le 26,5x+3y le 30 , x ge 0, y ge 0

Maximize P=8x+3y subject to the constraints: x+y le 3, 4x+y le 6, x ge 0, y ge0 is

Maximum Z = 3x + 5y subject to the constraints : x + 2y ge 10, x + y ge 6, 3x + y ge 8, x ge 0, y ge 0 .

Maximize : Z = x + y ,subject to the constraints: x - y le -1, -x + y le 0, 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 .

Minimize Z = x + 4y subject to constraints x + 3y ge 3 , 2x + y ge 2, x ge 0 , y ge 0

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

Minimize Z= 3x+y, subject to constriants 2x +3y le 6, x +y ge 1, x ge 0 , y ge 0 Then

Minimize Z = 2x + 3y subject to constraints x + y ge 6 , 2x + y ge 7, x + 4y ge 8 , x ge 0 , y ge 0

Minimize 3x+2y subject to the constraints x+y ge 5 and x+2 y ge 6, x ge0, y ge 0

NCERT EXEMPLAR-LINEAR PROGRAMMING-Linear Programming
  1. Maximise Z=3x+4y, Subjected to the constraints x+y le1, x ge 0, y ge ...

    Text Solution

    |

  2. Maximise the function Z=11x+7y, subject to the constraints x le 3, yle...

    Text Solution

    |

  3. Minimise Z=13x-15y subject to the constraints x+y le 7, 2x-3y+6 ge 0,...

    Text Solution

    |

  4. Determine the maximum value of Z=3x+4y, if the feasible reigon (shaded...

    Text Solution

    |

  5. Feasible region (shaded) for a LPP is shown in following figure. Maxim...

    Text Solution

    |

  6. The feasible region for an LPP is shown in following figure. Find the ...

    Text Solution

    |

  7. Refer to question 7 above. Find the maximum value of Z.

    Text Solution

    |

  8. The feasible region for a LPP is shown in the following figure. Evalua...

    Text Solution

    |

  9. In the following the feasible region (shaded) for a LPP is shown Deter...

    Text Solution

    |

  10. In the manufacturer of electronic circuits has a stock of 200 resistor...

    Text Solution

    |

  11. A firm has to transport 1200 packages using large vans which can carry...

    Text Solution

    |

  12. A company manufactures two types of screws A and B. all the screws hav...

    Text Solution

    |

  13. A company manufacutres two types of sweaters type A and type B. It cos...

    Text Solution

    |

  14. A man rides his motorcycle to the speed 50 km/h. He has to spend 2per...

    Text Solution

    |

  15. Refers to question 11. How many of circuit of type A and of type B, sh...

    Text Solution

    |

  16. Refers to question 12. i.e Z represents cost , if Z=400x+200y, x+2y ...

    Text Solution

    |

  17. Refers to question 13. Solve the liner progamming problem and deterimi...

    Text Solution

    |

  18. Refers to question 14. How many sweaters of each type of should the co...

    Text Solution

    |

  19. Refers to question 15. Determine the maximum distance that the man ca...

    Text Solution

    |

  20. Maximise Z=x+y subject to x+4y le 8 , 2x+3y le 12, 3x+y le 9, x ge 0, ...

    Text Solution

    |