Home
Class 12
MATHS
Maximise Z= -x + 2y, subject to the cons...

Maximise `Z= -x + 2y`, subject to the constraints: `x ge 3, x + y ge 5, x + 2y ge 6, y ge 0`.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of maximizing \( Z = -x + 2y \) subject to the constraints \( x \geq 3 \), \( x + y \geq 5 \), \( x + 2y \geq 6 \), and \( y \geq 0 \), we will follow these steps: ### Step 1: Identify the Constraints We have the following constraints: 1. \( x \geq 3 \) 2. \( x + y \geq 5 \) 3. \( x + 2y \geq 6 \) 4. \( y \geq 0 \) ### Step 2: Convert Inequalities to Equations To find the boundary lines of the inequalities, we convert them into equations: 1. \( x = 3 \) 2. \( x + y = 5 \) (or \( y = 5 - x \)) 3. \( x + 2y = 6 \) (or \( y = \frac{6 - x}{2} \)) 4. \( y = 0 \) ### Step 3: Find Intersection Points We will find the intersection points of the lines formed by the equations. **Intersection of \( x + y = 5 \) and \( x + 2y = 6 \):** - From \( x + y = 5 \), we can express \( y = 5 - x \). - Substitute into \( x + 2(5 - x) = 6 \): \[ x + 10 - 2x = 6 \implies -x + 10 = 6 \implies x = 4 \] - Substitute \( x = 4 \) back into \( y = 5 - x \): \[ y = 5 - 4 = 1 \] - So, the intersection point is \( (4, 1) \). **Intersection of \( x + y = 5 \) and \( y = 0 \):** - Substitute \( y = 0 \) into \( x + y = 5 \): \[ x + 0 = 5 \implies x = 5 \] - So, the intersection point is \( (5, 0) \). **Intersection of \( x + 2y = 6 \) and \( y = 0 \):** - Substitute \( y = 0 \) into \( x + 2y = 6 \): \[ x + 0 = 6 \implies x = 6 \] - So, the intersection point is \( (6, 0) \). ### Step 4: Identify Feasible Region Now we need to determine the feasible region defined by the constraints. We will test the origin (0,0) in each inequality: - For \( x \geq 3 \): Not satisfied. - For \( x + y \geq 5 \): Not satisfied. - For \( x + 2y \geq 6 \): Not satisfied. - For \( y \geq 0 \): Satisfied. Since the origin does not satisfy the inequalities, we check the region above the lines defined by the constraints. ### Step 5: Evaluate the Objective Function at Corner Points The corner points of the feasible region are \( (4, 1) \), \( (5, 0) \), and \( (6, 0) \). We will evaluate \( Z = -x + 2y \) at these points: 1. At \( (4, 1) \): \[ Z = -4 + 2(1) = -4 + 2 = -2 \] 2. At \( (5, 0) \): \[ Z = -5 + 2(0) = -5 + 0 = -5 \] 3. At \( (6, 0) \): \[ Z = -6 + 2(0) = -6 + 0 = -6 \] ### Step 6: Determine the Maximum Value The maximum value of \( Z \) occurs at the point \( (4, 1) \): \[ \text{Maximum } Z = -2 \] ### Conclusion Thus, the maximum value of \( Z \) is \( -2 \) at the point \( (4, 1) \). ---
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    MODERN PUBLICATION|Exercise Exercise 12.2|11 Videos
  • LINEAR PROGRAMMING

    MODERN PUBLICATION|Exercise Miscellaneous Exercise|10 Videos
  • LINEAR PROGRAMMING

    MODERN PUBLICATION|Exercise EXERCISE 12 (C ) (Very Short Answer Type Questions)|15 Videos
  • INVERSE - TRIGONOMETRIC FUNCTIONS

    MODERN PUBLICATION|Exercise CHAPTER TEST (2)|11 Videos
  • MATRICES

    MODERN PUBLICATION|Exercise CHAPTER TEST (3)|12 Videos

Similar Questions

Explore conceptually related problems

Maximize: Z = -x + 2y , subject to the constraints: x ge 3, x + y ge 5, x + 2y ge 6, 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 .

Maximise Z=3x+4y, Subjected to the constraints x+y le1, 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

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 = 5x + 3y subject to the constraints: 3x + 5y le 15, 5x + 2y le 10, x ge 0, y ge 0

Graphically maximise Z = 9x + 10y subject to constraints : 9x + 2y ge 20, x - 2y ge 0, x + y le 9, x ge 0, y ge 0 .

(i) Z = 20x + 10y x + 2y le 28, 3x + y le 24, x ge 2, x, y ge 0 (ii) Z = 7x + 10y 4x + 6y le 240, 6x + 3y le 240, x ge 10, x ge 0, y ge 0 (iii) Z = 22x + 44y subject to the constraints: x + y ge 3, 3x + 8y le 24, x - y ge 0, x, y ge 0 .

Solve the following L.P.P graphically Minimise and maximise z = 3x + 9y Subject to the constraints x + 3y le 60 x + y ge 10 x le y 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