Home
Class 12
MATHS
Minimise Z = 3x + 5y such that x + 3y ...

Minimise `Z = 3x + 5y`
such that `x + 3y ge 3, x + y ge 12, x , y ge 0`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the linear programming problem of minimizing \( Z = 3x + 5y \) subject to the constraints \( x + 3y \geq 3 \), \( x + y \geq 12 \), and \( x, y \geq 0 \), we can follow these steps: ### Step 1: Identify the Constraints We have the following constraints: 1. \( x + 3y \geq 3 \) 2. \( x + y \geq 12 \) 3. \( x \geq 0 \) 4. \( y \geq 0 \) ### Step 2: Convert Inequalities to Equations To find the boundary lines of the constraints, we convert the inequalities to equations: 1. \( x + 3y = 3 \) 2. \( x + y = 12 \) ### Step 3: Find Intercepts of the Lines For the first equation \( x + 3y = 3 \): - Set \( x = 0 \): \( 3y = 3 \) → \( y = 1 \) (Point A: \( (0, 1) \)) - Set \( y = 0 \): \( x = 3 \) (Point B: \( (3, 0) \)) For the second equation \( x + y = 12 \): - Set \( x = 0 \): \( y = 12 \) (Point C: \( (0, 12) \)) - Set \( y = 0 \): \( x = 12 \) (Point D: \( (12, 0) \)) ### Step 4: Plot the Lines and Identify the Feasible Region Plot the points A, B, C, and D on a graph. The feasible region is determined by the inequalities: - For \( x + 3y \geq 3 \), the region is above the line. - For \( x + y \geq 12 \), the region is above the line. ### Step 5: Check Feasibility of the Origin Check if the origin (0,0) satisfies the constraints: - \( 0 + 3(0) \geq 3 \) → False - \( 0 + 0 \geq 12 \) → False Since the origin does not satisfy the constraints, the feasible region is above the lines. ### Step 6: Identify the Corner Points of the Feasible Region The corner points of the feasible region are: - Point C: \( (0, 12) \) - Point D: \( (12, 0) \) ### Step 7: Evaluate the Objective Function at the Corner Points Now we evaluate \( Z = 3x + 5y \) at the corner points: 1. At Point C \( (0, 12) \): \[ Z = 3(0) + 5(12) = 60 \] 2. At Point D \( (12, 0) \): \[ Z = 3(12) + 5(0) = 36 \] ### Step 8: Determine the Minimum Value The minimum value of \( Z \) occurs at Point D \( (12, 0) \), where \( Z = 36 \). ### Final Answer The minimum value of \( Z \) is **36** at the point **(12, 0)**. ---
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

x + 2y le 3, 3x + 4y ge 12, x ge 0, y ge 1

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

Minimise Z = -3x + 4y subject to x + 2y le 8, 3x + 2y le 12, x ge 0, y ge 0 .

Minimize z = 7x + y , subject to 5x + y ge 5, x + y ge 3, x ge 0 , y ge 0 .

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

x +2y le 3, 3x + 4y ge 12 , x ge 0, y ge 1

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

3x + 4y le 60, x ge 2y , x ge1 , y ge 0

Minimum of Z = x+ y subject to : 2x + y ge 3, x + 2y ge 6, x ge 0, y ge 0 is .........at ............

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