Scribd
Upload
101 views

Modul6 - LP Graphical Solution

The manager has formulated an LP model to maximize profit from two construction activities with constraints on time and materials. The optimal solution is found to be x1 = 45, x2 = 20, with maximum profit of 1725. The second problem minimizes an objective function subject to four constraints. The optimal solution is found to be x1 = 0.43, x2 = 3.43, with minimum value of 11.15.

Uploaded by

yoyoq12
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
101 views

Modul6 - LP Graphical Solution

The manager has formulated an LP model to maximize profit from two construction activities with constraints on time and materials. The optimal solution is found to be x1 = 45, x2 = 20, with maximum profit of 1725. The second problem minimizes an objective function subject to four constraints. The optimal solution is found to be x1 = 0.43, x2 = 3.43, with minimum value of 11.15.

Uploaded by

yoyoq12
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 24

PROBLEM 1

1.

The manager of a construction project has formulated this LP model:


maximize
Z 25x1 30 x2
(profit)
subject to
Time
20 x1 15x2 1,200 hours

8 x1 12 x2 600 hours

Material
a.
b.
c.

x1 , x2 0
Graph the model.
Determine the optimal values of the decision variables using objective function app
profit?
Use the extreme point approach to determine the optimal solution.

MAXIMIZE Z = 25x1 + 30x2


Subject to :
TIME

TIME
20x1 + 15x2 <= 1200

MATERIAL

MATERIAL
8x1 + 12x2 <= 600

NON NEGATIVE
x1 >= 0
x2 >= 0

NON NEGATIVE

GRAPH THE MODEL

90
80
70
60
50

Time

40

Material
Objective Function

30
20
10
0
0

20

40

60

80

0
0

Extreme Points
(0,0)
(60,0)
(0,50)
(45,20)

20

40

60

Z values
0
1500
1500
1725

maximum profit : 1725

80

Optimal Point

(45,20)

PROBLEM 1

ormulated this LP model:

ecision variables using objective function approach. What is the maximum

ermine the optimal solution.

TIME
20x1 + 15x2 = 1200

8x1 + 12x2 = 600

x1 >= 0
x2 >= 0

X1
X2

0
80

60
0

(0,80) dan (60,0)

MATERIAL
X1
X2

0
50

75
0

(0,50) dan (75,0)

NON NEGATIVE
x1 >= 0
x2 >= 0

Objective Function
X1
6
X2
0

0
5

PERPOTONGAN DUA PERSAMAAN GARIS


20x1 + 15x2 = 1200
8x1 + 12x2 = 600

titik optimal :

with optimal values : (45,20)

(0,80) dan (60,0)

(0,50) dan (75,0)

PROBLEM 2

Minimize : f 2 x1 3 x2
4 x1 3 x2 12
x1 x2 3
x2 6
2 x1 3 x2 0
MINIIMIZE Z = 2x1 + 3x2
Subject to :
C1

C1
4x1 + 3x2 >= 12

C2

C2
x1 - x2 >= -3

C3

C3
- x2 >= -6

C4

C4
-2x1+3x2 >= 0

NON NEGATIVE
x1 >= 0
x2 >= 0

NON NEGATIVE

GRAPH THE MODEL

7
6
5

C1

C1

C2

C3

C4
2

Objective Function

1
0

-10

-5

Extreme Points
(1.33,2)
(0.43, 3.43)
(3,6)
(9,6)

minimum value :

Z values
7.99
11.15
24
36

10

15

Optimal Point

PROBLEM 2

C1
4x1 + 3x2 = 12

X1
X2

0
4

3
0

(0,4) dan (3,0)

X1
X2

3
6

-3
0

(0,3) dan (-3,0)

X1
X2

-6
6

10
6

(0,6) dan (0,0)

X1
X2

9
6

0
0

(0,0) dan (0,0)

C2
x1 - x2 = -3

C3
- x2 = -6

C4
x2 =(2/3)x1

x1 >= 0
x2 >= 0

NON NEGATIVE
x1 >= 0
x2 >= 0

Objective Function
X1
3
X2
0

0
2

PERPOTONGAN DUA PERSAMAAN GARIS


x1 - x2 = -3
4x1 - 4x2 = -12
4x1 + 3x2 = 12
4x1 + 3x2 = 12
-7x2= -24
x2=
3.43
x1=
0.43
-2x1 + 3x2 = 0
4x1 + 3x2 = 12
x2=
x1=

with optimal values :

-4x1 + 6x2 = 0
4x1 + 3x2 = 12
9x2= 12
1.33
2.00

Minimize : f 2 x1 10 x 2
x1 x 2 4
2 x1 x 2 14
x1 x 2 9
x1 3 x 2 15
x1 , x 2 0
2 x1 3 x 2 0

You might also like