Scribd
Upload
55 views4 pages

OR1 Example

The document presents multiple linear programming problems, detailing their objective functions, constraints, intercepts, and optimal solutions. Each problem is analyzed with feasible regions and endpoints, leading to specific maximum or minimum values for the objective functions. The solutions are visually represented through graphs, highlighting the optimal points for each scenario.

Uploaded by

Throwaway Two
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views4 pages

OR1 Example

The document presents multiple linear programming problems, detailing their objective functions, constraints, intercepts, and optimal solutions. Each problem is analyzed with feasible regions and endpoints, leading to specific maximum or minimum values for the objective functions. The solutions are visually represented through graphs, highlighting the optimal points for each scenario.

Uploaded by

Throwaway Two
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

Max z= 2x+3y subject to 3x+y<= 6, x+ y <= 4, x+ 2y <=6 , x, y >=0

Constraints Intercepts
3x+y<= 6 (2,0) (0,6)
x+ y <= 4 (4,0) (0,4)
x+ 2y <=6 (6,0) (0,3)
x>=0 (0,0)
y >=0 (0,0)
Endpoints of feasible region Optimal Solution as seen in the graph
(1.2, 2.4) X=1.2 Y=2.4; z=9.6
(2,0)
(0,3)
(0,0)
(2,0)
2. Min z=5x-3y subject to x+2y<=4, x+3y>=6, x>=0, y>=0
Will become max z= -5x+3y

Constraints Intercepts
x+2y<=4 (4,0) (0,2)
x+3y>=6 (6,0) (0,2)
x>=0 (0,0)
y >=0 (0,0)
Endpoints of feasible region Optimal Solution as seen in the graph
(0,0) X=0 Y=2; z=6
(0,2) So, since min problem, z=-6 when x=0, y=2
(4,0)
3. Max z=2x+5y subject to 2x+y>= 2 , x+y<=8 , x+y>=3 , 2x+y<=12 , x>=0 , y>=0

Constraints Intercepts
2x+y>= 2 (1,0) (0,2)
x+y<=8 (8,0) (0,8)
x+y>=3 (3,0) (0,3)
2x+y<=12 (6,0) (0,12)
x>=0 (0,0)
y >=0 (0,0)
Endpoints of feasible region Optimal Solution as seen in the graph
(0,8) X=0 Y=8; z=40
(4,4)
(6,0)
(3,0)
(0,3)
4. Max z=2x+5y subject to 2x+y>= 2 , x+y<=8 , x+y>=3 , 2x+y<=12 , x>=0 , y>=0

Constraints Intercepts
2x+y>= 2 (1,0) (0,2)
x+y<=8 (8,0) (0,8)
x+y>=3 (3,0) (0,3)
2x+y<=12 (6,0) (0,12)
x>=0 (0,0)
y >=0 (0,0)
Endpoints of feasible region Optimal Solution as seen in the graph
(0,8) X=0 Y=8; z=40
(4,4)
(6,0)
(3,0)
(0,3)

You might also like