Home
Class 12
MATHS
The minimum value of Z = 10x + By subjec...

The minimum value of Z = 10x + By subject to ` 4x +y ge 4, x +3y ge 6, x +y ge 3, xge 0, y ge 0` is

A

60

B

27

C

`74/3 `

D

32

Text Solution

AI Generated Solution

The correct Answer is:
To find the minimum value of \( Z = 10x + 8y \) subject to the constraints: 1. \( 4x + y \geq 4 \) 2. \( x + 3y \geq 6 \) 3. \( x + y \geq 3 \) 4. \( x \geq 0 \) 5. \( y \geq 0 \) we will follow these steps: ### Step 1: Convert Inequalities to Equations First, we convert the inequalities into equations to find the boundary lines: 1. \( 4x + y = 4 \) 2. \( x + 3y = 6 \) 3. \( x + y = 3 \) ### Step 2: Find Intersection Points Next, we will find the intersection points of these lines. - **Intersection of \( 4x + y = 4 \) and \( x + 3y = 6 \)**: \[ y = 4 - 4x \quad \text{(from the first equation)} \] Substitute into the second equation: \[ x + 3(4 - 4x) = 6 \\ x + 12 - 12x = 6 \\ -11x = -6 \\ x = \frac{6}{11} \] Substitute \( x \) back to find \( y \): \[ y = 4 - 4\left(\frac{6}{11}\right) = 4 - \frac{24}{11} = \frac{44 - 24}{11} = \frac{20}{11} \] So, one intersection point is \( \left(\frac{6}{11}, \frac{20}{11}\right) \). - **Intersection of \( x + 3y = 6 \) and \( x + y = 3 \)**: \[ x + 3y = 6 \quad \text{(from the second equation)} \\ y = 3 - x \quad \text{(from the third equation)} \] Substitute into the second equation: \[ x + 3(3 - x) = 6 \\ x + 9 - 3x = 6 \\ -2x = -3 \\ x = \frac{3}{2} \] Substitute \( x \) back to find \( y \): \[ y = 3 - \frac{3}{2} = \frac{3}{2} \] So, another intersection point is \( \left(\frac{3}{2}, \frac{3}{2}\right) \). - **Intersection of \( 4x + y = 4 \) and \( x + y = 3 \)**: \[ y = 4 - 4x \\ x + (4 - 4x) = 3 \\ x + 4 - 4x = 3 \\ -3x = -1 \\ x = \frac{1}{3} \] Substitute \( x \) back to find \( y \): \[ y = 3 - \frac{1}{3} = \frac{8}{3} \] So, another intersection point is \( \left(\frac{1}{3}, \frac{8}{3}\right) \). ### Step 3: Identify Feasible Region Now we need to check which of these points satisfy all the original inequalities to determine the feasible region. ### Step 4: Evaluate Z at Each Vertex Evaluate \( Z = 10x + 8y \) at each of the feasible vertices: 1. For \( \left(\frac{6}{11}, \frac{20}{11}\right) \): \[ Z = 10\left(\frac{6}{11}\right) + 8\left(\frac{20}{11}\right) = \frac{60}{11} + \frac{160}{11} = \frac{220}{11} = 20 \] 2. For \( \left(\frac{3}{2}, \frac{3}{2}\right) \): \[ Z = 10\left(\frac{3}{2}\right) + 8\left(\frac{3}{2}\right) = 15 + 12 = 27 \] 3. For \( \left(\frac{1}{3}, \frac{8}{3}\right) \): \[ Z = 10\left(\frac{1}{3}\right) + 8\left(\frac{8}{3}\right) = \frac{10}{3} + \frac{64}{3} = \frac{74}{3} \approx 24.67 \] ### Step 5: Determine Minimum Value The minimum value of \( Z \) occurs at the point \( \left(\frac{6}{11}, \frac{20}{11}\right) \) with \( Z = 20 \). ### Final Answer The minimum value of \( Z \) is **20**. ---

To find the minimum value of \( Z = 10x + 8y \) subject to the constraints: 1. \( 4x + y \geq 4 \) 2. \( x + 3y \geq 6 \) 3. \( x + y \geq 3 \) 4. \( x \geq 0 \) 5. \( 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

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

x + y le 10, 4x + 3y le 24, x ge , x ge 0, y ge 0

Z = 3x + 5y x + 3y ge 3, x + y ge 2,x ge 0, y ge 0

The maximum value of z = 6x + 8y subject to x- y ge 0, x + 3y le 12, x ge0 is …….

Z = 3x + 5y x + y ge 2, x + 3y ge 3 x ge 0 ,y ge 0

The minimum value of Z = 4x + 5y subjected to the constraints x + y ge 6, 5x + y ge 10 , x ge 0, y ge 0 is

Maximize Z = x + 2y subject to: 2x + y ge 3, x + 2y ge 6, x, y ge 0 .

Z = 4x + y x + y le 50, 3x + y le 90, x ge 0, y ge 0

The point at which the minimum value of z = 8x + 12y subject to the constraints 2x +y ge 8, x + 2y ge 10 x ge 0, y ge 0 is obtained 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

    |