Home
Class 12
MATHS
The minimum value of the objective funct...

The minimum value of the objective function Z=x+2y
Subject to the constraints,
`2x+ y ge 3 , x +2y ge 6 , x, y ge 0` occurs

A

at every point on the line x + 2y = 6

B

at every point on the line 2x + y = 3

C

at every point on the line x + 2y = 3 d

D

at every point on the line 2x + y = 6

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the minimum value of the objective function \( Z = x + 2y \) subject to the constraints \( 2x + y \geq 3 \), \( x + 2y \geq 6 \), and \( x, y \geq 0 \), we will follow these steps: ### Step 1: Write the constraints in standard form The constraints given are: 1. \( 2x + y \geq 3 \) 2. \( x + 2y \geq 6 \) 3. \( x \geq 0 \) 4. \( y \geq 0 \) We can rewrite the inequalities as: 1. \( 2x + y = 3 \) 2. \( x + 2y = 6 \) ### Step 2: Find the intersection points of the lines To find the feasible region, we first need to determine the points where the lines intersect. **For the first line \( 2x + y = 3 \):** - When \( x = 0 \): \[ 2(0) + y = 3 \implies y = 3 \quad \text{(Point A: (0, 3))} \] - When \( y = 0 \): \[ 2x + 0 = 3 \implies x = \frac{3}{2} \quad \text{(Point B: (1.5, 0))} \] **For the second line \( x + 2y = 6 \):** - When \( x = 0 \): \[ 0 + 2y = 6 \implies y = 3 \quad \text{(Point C: (0, 3))} \] - When \( y = 0 \): \[ x + 0 = 6 \implies x = 6 \quad \text{(Point D: (6, 0))} \] ### Step 3: Identify the feasible region Now, we plot the lines on the coordinate system and identify the feasible region that satisfies all constraints. The feasible region is where both inequalities hold true. ### Step 4: Determine the vertices of the feasible region From the points calculated: - Point A: (0, 3) - Point B: (1.5, 0) - Point D: (6, 0) The feasible region is bounded by these points and the axes. ### Step 5: Evaluate the objective function at each vertex Now, we will evaluate the objective function \( Z = x + 2y \) at each vertex of the feasible region: 1. At Point A (0, 3): \[ Z = 0 + 2(3) = 6 \] 2. At Point B (1.5, 0): \[ Z = 1.5 + 2(0) = 1.5 \] 3. At Point D (6, 0): \[ Z = 6 + 2(0) = 6 \] ### Step 6: Find the minimum value From the evaluations: - At (0, 3), \( Z = 6 \) - At (1.5, 0), \( Z = 1.5 \) - At (6, 0), \( Z = 6 \) The minimum value of \( Z \) occurs at the point (1.5, 0) where \( Z = 1.5 \). ### Final Answer The minimum value of the objective function \( Z = x + 2y \) occurs at the point \( (1.5, 0) \) with a minimum value of \( Z = 1.5 \). ---

To solve the problem of finding the minimum value of the objective function \( Z = x + 2y \) subject to the constraints \( 2x + y \geq 3 \), \( x + 2y \geq 6 \), and \( x, y \geq 0 \), we will follow these steps: ### Step 1: Write the constraints in standard form The constraints given are: 1. \( 2x + y \geq 3 \) 2. \( x + 2y \geq 6 \) 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

The maximum and minimum values of the objective function Z = x + 2y subject to the constraints x+2y ge 100, 2x -y le 0, 2x +y le 200 occurs respectively at

Determine graphically the minimum value of the objective function: Z = -50x + 20y subject to the constraints: 2x - y ge -5, 3x + y ge 3, 2x - 3y le 12, x, y ge 0 .

The maximum and minimum values of the objective function Z = 3x - 4 y subject to the constraints x- 2y le 0, -3x +y le 4 x-y le 6 , x,y ge 0 are respectively

Determine graphically the minimum value of the objective function z = - 50x + 20 y, subject to he constraints. 2x - y ge - 5 3x + y ge 3 2x - 3y le 12 x ge 0, y ge 0

The minimum and maximum values of the objective function, Z = 5x + 10y subject to the constraints x +2yle 120, x+y ge 60, x -2y ge 0 , x,y le 0 are respectively

2x + y ge 6, x + 2y ge 8, x ge 0, y ge 0

The minimum value of the objective function Z=2x+10y for linear constraints x ge 0 , y ge 0, x -y ge 0, x -5y le -5 is

Find the ratio of the maximum and minimum values of the objective function f=3x+5y subject to the constraints : x ge 0, y ge0, 2x+3y ge 6 and 9x+ 10y le 90 .

The minimum value of linear objective function z =2x + 2y under linear constraints 3x + 2y ge 12 , x + 3y ge 11 and x,y ge 0 is

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

    |