Home
Class 12
MATHS
Solve the following linear programming p...

Solve the following linear programming problem graphically:
Minimize : `z=3x+5y`
Subject to: `x+yge2`
`x+3yge3`
`xge0`
`yge0`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the given linear programming problem graphically, we will follow these steps: ### Step 1: Formulate the Problem We need to minimize the objective function: \[ z = 3x + 5y \] Subject to the constraints: 1. \( x + y \geq 2 \) 2. \( x + 3y \geq 3 \) 3. \( x \geq 0 \) 4. \( y \geq 0 \) ### Step 2: Convert Inequalities to Equations Convert the inequalities into equations to find the boundary lines: 1. \( x + y = 2 \) 2. \( x + 3y = 3 \) ### Step 3: Find Intercepts for Each Line **For the line \( x + y = 2 \)**: - Set \( x = 0 \): \[ 0 + y = 2 \Rightarrow y = 2 \] Point: \( (0, 2) \) - Set \( y = 0 \): \[ x + 0 = 2 \Rightarrow x = 2 \] Point: \( (2, 0) \) **For the line \( x + 3y = 3 \)**: - Set \( x = 0 \): \[ 0 + 3y = 3 \Rightarrow y = 1 \] Point: \( (0, 1) \) - Set \( y = 0 \): \[ x + 0 = 3 \Rightarrow x = 3 \] Point: \( (3, 0) \) ### Step 4: Plot the Lines on a Graph Plot the points \( (0, 2) \), \( (2, 0) \), \( (0, 1) \), and \( (3, 0) \) on a graph. Draw the lines for the equations \( x + y = 2 \) and \( x + 3y = 3 \). ### Step 5: Determine the Feasible Region To find the feasible region, we will test a point (e.g., \( (0, 0) \)): - For \( x + y \geq 2 \): \[ 0 + 0 \geq 2 \quad \text{(False)} \] - For \( x + 3y \geq 3 \): \[ 0 + 0 \geq 3 \quad \text{(False)} \] Since both conditions are false, the feasible region is away from the origin. Shade the region that satisfies both inequalities. ### Step 6: Identify Corner Points The corner points of the feasible region are: 1. \( (0, 2) \) 2. \( (2, 0) \) 3. Intersection of \( x + y = 2 \) and \( x + 3y = 3 \) ### Step 7: Find the Intersection Point To find the intersection of the lines \( x + y = 2 \) and \( x + 3y = 3 \): 1. Solve the system of equations: \[ x + y = 2 \quad (1) \] \[ x + 3y = 3 \quad (2) \] Subtract (1) from (2): \[ (x + 3y) - (x + y) = 3 - 2 \Rightarrow 2y = 1 \Rightarrow y = \frac{1}{2} \] Substitute \( y = \frac{1}{2} \) into (1): \[ x + \frac{1}{2} = 2 \Rightarrow x = \frac{3}{2} \] Intersection Point: \( \left(\frac{3}{2}, \frac{1}{2}\right) \) ### Step 8: Evaluate the Objective Function at Each Corner Point 1. At \( (0, 2) \): \[ z = 3(0) + 5(2) = 10 \] 2. At \( (2, 0) \): \[ z = 3(2) + 5(0) = 6 \] 3. At \( \left(\frac{3}{2}, \frac{1}{2}\right) \): \[ z = 3\left(\frac{3}{2}\right) + 5\left(\frac{1}{2}\right) = \frac{9}{2} + \frac{5}{2} = 7 \] ### Step 9: Determine the Minimum Value The minimum value of \( z \) occurs at the point \( \left(\frac{3}{2}, \frac{1}{2}\right) \) with: \[ \text{Minimum } z = 7 \] ### Final Result The minimum value of the objective function \( z = 3x + 5y \) is \( 7 \) at the point \( \left(\frac{3}{2}, \frac{1}{2}\right) \). ---

To solve the given linear programming problem graphically, we will follow these steps: ### Step 1: Formulate the Problem We need to minimize the objective function: \[ z = 3x + 5y \] Subject to the constraints: 1. \( x + y \geq 2 \) 2. \( x + 3y \geq 3 \) ...
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12 B|15 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12.1|10 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exercise|9 Videos
  • INVERES TRIGONOMETRIC FUNCTIONS

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exercise (prove That )|9 Videos
  • MATRICES

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exerice|15 Videos

Similar Questions

Explore conceptually related problems

Solve the following linear programming problem graphically: Maximize : z=x+2y Subject to: x-yle2 x+yle4 xge0 yge0

Solve the following linear programming problem graphically: Minimize: z=x+3y Subject to: x+yle8 3x+5yge15 xge0 yge0

Solve the following linear programming problem graphically: Minimize : z=200x+500y Subject to: x+2yge10 3x+4yle24 xge0 yge0

Solve the following linear programming problem graphically. Minimize :z=2x+3y-1 Subject to: x-yge0 -x+2yge2 xge3 yle4 yge0

Solve the following linear programming problem graphically: Maximize : z=x+9y Subject to: x+3yle60 x+yge10 xley xge0 yge0

Solve the following linear programming problem graphically: Maximize : z=5x+3y Subject to: x+3yle5 x+yle3 xge0 yge0

Solve the following linear programming problem graphically: Maximize : z=4x+3y Subject to: 2x+yge40 x+2yge50 x+yle35 xge0 yge0

Solve the following linear programming problem graphically: minimize : z=x+2y Subject to: 2x+yge3 x+2yge6 xge0 yge0 Show that z is minimum at two points.

Solve the following linear programming problem graphically: Maximize : z=30x+25y Subject to: x+yle6 3x+2yle15 xge0 yge0

Solve the following linear programming problem graphically: Maximize : z=60x+15y Subject to : x+yle50 3x+yle90 xge0 yge0