Home
Class 12
MATHS
Maximize z =2x + 3y subject to constrain...

Maximize `z =2x + 3y` subject to constraints `x + 4y le 8, 3x + 2y le 14 , x ge 0, y ge 0`.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of maximizing \( z = 2x + 3y \) subject to the constraints \( x + 4y \leq 8 \), \( 3x + 2y \leq 14 \), \( x \geq 0 \), and \( y \geq 0 \), we will follow these steps: ### Step 1: Identify the Constraints We have the following constraints: 1. \( x + 4y \leq 8 \) 2. \( 3x + 2y \leq 14 \) 3. \( x \geq 0 \) 4. \( y \geq 0 \) ### Step 2: Convert Inequalities to Equations To find the boundary lines of the feasible region, we convert the inequalities into equations: 1. \( x + 4y = 8 \) 2. \( 3x + 2y = 14 \) ### Step 3: Find Intercepts of the Constraints For the first equation \( x + 4y = 8 \): - When \( x = 0 \), \( 4y = 8 \) → \( y = 2 \) (Point: \( (0, 2) \)) - When \( y = 0 \), \( x = 8 \) (Point: \( (8, 0) \)) For the second equation \( 3x + 2y = 14 \): - When \( x = 0 \), \( 2y = 14 \) → \( y = 7 \) (Point: \( (0, 7) \)) - When \( y = 0 \), \( 3x = 14 \) → \( x = \frac{14}{3} \approx 4.67 \) (Point: \( \left(\frac{14}{3}, 0\right) \)) ### Step 4: Find the Intersection of the Constraints To find the intersection of the lines \( x + 4y = 8 \) and \( 3x + 2y = 14 \), we can solve these equations simultaneously. From \( x + 4y = 8 \): \[ x = 8 - 4y \] Substituting this into the second equation: \[ 3(8 - 4y) + 2y = 14 \] \[ 24 - 12y + 2y = 14 \] \[ 24 - 10y = 14 \] \[ -10y = 14 - 24 \] \[ -10y = -10 \] \[ y = 1 \] Now substituting \( y = 1 \) back into \( x + 4y = 8 \): \[ x + 4(1) = 8 \] \[ x + 4 = 8 \] \[ x = 4 \] So the intersection point is \( (4, 1) \). ### Step 5: Identify the Feasible Region The feasible region is bounded by the points: 1. \( (0, 2) \) 2. \( (8, 0) \) 3. \( (0, 7) \) 4. \( (4, 1) \) ### Step 6: Evaluate the Objective Function at Each Vertex Now we evaluate \( z = 2x + 3y \) at each vertex: 1. At \( (0, 2) \): \( z = 2(0) + 3(2) = 6 \) 2. At \( (8, 0) \): \( z = 2(8) + 3(0) = 16 \) 3. At \( (0, 7) \): \( z = 2(0) + 3(7) = 21 \) 4. At \( (4, 1) \): \( z = 2(4) + 3(1) = 8 + 3 = 11 \) ### Step 7: Determine the Maximum Value The maximum value of \( z \) occurs at \( (8, 0) \) where \( z = 16 \). ### Final Answer The maximum value of \( z \) is \( 16 \) at the point \( (8, 0) \). ---
Promotional Banner

Topper's Solved these Questions

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II LINEAR PROGRAMMING PROBLEMS (E. Activities)|3 Videos
  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II ASSIGNMENT PROBLEMS AND SEQUENCING (I. Select and write the most appropriate answer from the given alternatives for each sub question.)|12 Videos
  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II LINEAR PROGRAMMING PROBLEMS (C. Fill in each of the following blanks)|12 Videos
  • PROBABILITY DISTRIBUTION

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|9 Videos
  • THREE DIMENSIONAL GEOMETRY

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|8 Videos

Similar Questions

Explore conceptually related problems

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

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

2x + y le 6, x + 2y le 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

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

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

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

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

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