PENGGUNAAN KAPASITAS

X1 X2
KAPASITAS TERSEDIA
DEP I 5 6 0 60
DEP II 1 2 0 16
PERMINTAAN X1 1 0 0 10
PERMINTAAN X2 0 1 0 6

MARGIN PER UNT 2 3

MARGIN TOTAL
PRODUKSI 0 0 0
 LP_max SOAL 1

BAWIKA This
This file
file was
was created
created POM-QM
POM-QM for
for Windows,
Windows, V5
V5 Go
Go to
to DATA,
DATA, SOLVER,
SOLVER, SOLVE
SOLVE on
on the
the menu
menu bb

Linear, Integer or Mixed Integer Programming

Signs
< less than or equal to
= equals (You need to enter an apostrophe first.)
> greater than or equal to

Data Results
X1 X2 LHS Slack/Surplus
Objective 2 3 0 0
Constraint 1 5 6< 60 0 60
Constraint 2 1 2< 16 0 16
Constraint 3 1 0< 10 0 10
Constraint 4 0 1< 6 0 6

Results
Variables
Objective 0

x1 x2 RHS Dual
Maximize 2 3
Constraint 1 5 6 <= 60 0.25

Constraint 2 1 2 <= 16 0.75

Constraint 3 1 0 <= 10 0

Constraint 4 0 1 <= 6 0

Solution 6 5 27

Page 2
 LP_max SOAL 1

, SOLVER,
SOLVER, SOLVE
SOLVEon
on the
the menu
menu bar
barat
atthe
the top.
top.

Problem setup area Variable Status Value

X1 Basic 6
< constraints > constraints X2 Basic 5
0 60 0 0 slack 1 NONBasic 0
0 16 0 0 slack 2 NONBasic 0
0 10 0 0 slack 3 Basic 4
0 6 0 0 slack 4 Basic 1
Optimal
27
Value (Z)

Reduced Original Lower

Variable Value Upper Bound
Cost Val Bound
X1 6 0 2 1.5 2.5
X2 5 0 3 2.4 4

Dual Value Slack/Surp Original

Lower
Upper Bound
lus Val Bound

Constraint 1 0.25 0 60 56 68

Constraint 2 0.75 0 16 13.33 16.8

Constraint 3 0 4 10 6 Infinity

Constraint 4 0 1 6 5 Infinity

Page 3
LP_max SOAL 1

Page 4
 2 3 0 0 0 0
Basic Variable Quantity X1 X2 SLACK 1 SLACK 2 SLACK 3 SLACK 4
Iteration
1
0 slack 1 60 5 6 1 0 0 0
0 slack 2 16 1 2 0 1 0 0
0 slack 3 10 1 0 0 0 1 0
0 slack 4 6 0 1 0 0 0 1
zj 0 0 0 0 0 0 0
cj-zj 2 3 0 0 0 0
Iteration
2
0 slack 1 24 5 0 1 0 0 -6
0 slack 2 4 1 0 0 1 0 -2
0 slack 3 10 1 0 0 0 1 0
3 X2 6 0 1 0 0 0 1
zj 18 0 3 0 0 0 3
cj-zj 2 0 0 0 0 -3
Iteration
3
0 slack 1 4 0 0 1 -5 0 4
2 X1 4 1 0 0 1 0 -2
0 slack 3 6 0 0 0 -1 1 2
3 X2 6 0 1 0 0 0 1
zj 26 2 3 0 2 0 -1
cj-zj 0 0 0 -2 0 1
Iteration
4
0 slack 4 1 0 0 0.25 -1.25 0 1
2 X1 6 1 0 0.5 -1.5 0 0
0 slack 3 4 0 0 -0.5 1.5 1 0
3 X2 5 0 1 -0.25 1.25 0 0
zj 27 2 3 0.25 0.75 0 0
cj-zj 0 0 -0.25 -0.75 0 0
Original Problem
Maximize X1 X2
Constraint 1 5 6 <= 60
Constraint 2 1 2 <= 16
Constraint 3 1 0 <= 10
Constraint 4 0 1 <= 6

Dual Problem
Constraint 1 Constraint 2 Constraint 3 Constraint 4
Minimize 60 16 10 6
X1 5 1 1 0 >=
X2 6 2 0 1 >=
2
3
bawka soal 2

Linear, Integer or Mixed Integer Programming

Signs
< less than or equal to
= equals (You need to enter an apostrophe first.)
> greater than or equal to

Data Results

X1 X2 LHS Slack/Surplus

Objective 3 2 0 0
Constraint 1 2< 6 0 6
Constraint 2 1< 8 0 8

Constraint -1 1< 1 0 1
Constraint 0 1< 2 0 2

Results
Variables
Objective 0

X1 X2 RHS DUAL
Maximize 3 2

Constraint 1 1 2 <= 6 0.33

Constraint 2 2 1 <= 8 1.33

Constraint 3 -1 1 <= 1 0

Constraint 4 0 1 <= 2 0

Solution 3.33 1.33 12.67

 VARIABLE STATUS VALUE
X1 Basic 3.33
Problem setup area X2 Basic 1.33

slack 1 NONBasic 0

slack 2 NONBasic 0
< constraints > constraints
0 6 0 0 slack 3 Basic 3
0 8 0 0 slack 4 Basic 0.67
Optimal
12.67
0 1 0 0 Value (Z)
0 2 0 0

Variable Value Reduced Original Lower Upper

Cost Val Bound Bound
X1 3.33 0 3 1 4
X2 1.33 0 2 1.5 6
Dual Slack/Sur Original Lower Upper
Value plus Val Bound Bound

Constraint 1 0.33 0 6 4 7

Constraint 2 1.33 0 8 6 12

Constraint 3 0 3 1 -2 Infinity

Constraint 4 0 0.67 2 1.33 Infinity

 3 2 0 0 0
Basic Variable Quantity X1 X2 SLACK 1 SLACK 2 SLACK 3
Iteration 1

0 slack 1 6 1 2 1 0 0

0 slack 2 8 2 1 0 1 0

0 slack 3 1 -1 1 0 0 1

0 slack 4 2 0 1 0 0 0

zj 0 0 0 0 0 0

cj-zj 3 2 0 0 0

Iteration 2
0 slack 1 2 0 1.5 1 -0.5 0

3 X1 4 1 0.5 0 0.5 0

0 slack 3 5 0 1.5 0 0.5 1

0 slack 4 2 0 1 0 0 0

zj 12 3 1.5 0 1.5 0
cj-zj 0 0.5 0 -1.5 0
Iteration 3
2 X2 1.3333 0 1 0.6667 -0.3333 0
3 X1 3.3333 1 0 -0.3333 0.6667 0
0 slack 3 3 0 0 -1 1 1
0 slack 4 0.6667 0 0 -0.6667 0.3333 0
zj 12.6667 3 2 0.33 1.33 0
cj-zj 0 0 -0.3333 -1.3333 0
 0
SLACK 4

Original
0
Problem

0 Maximize X1 X2

0 Constrain 1 2 <= 6
t1
Constrain
1 2 1 <= 8
t2
Constrain
0 t3 -1 1 <= 1

Constrain
0 t4 0 1 <= 2

0
Dual
0
Problem
Constrain Constrain Constrain Constrain
0 t1 t2 t3 t4

1 Minimize 6 8 1 2

0 X1 1 2 -1 0 >= 3
0 X2 2 1 1 1 >= 2

0
0
0
1
0
0
BAWKA SOAL 3

Linear, Integer or Mixed Integer Programming

Signs
< less than or equal to
= equals (You need to enter an apostrophe first.)
> greater than or equal to

Data Results
X1 X2 X3 X4 LHS Slack/Surplus

Objective 2 1 -3 5 0 0
Constraint 1 7 3 7< 46 0 46

Constraint 3 -1 1 2< 8 0 8
Constraint 2 3 -1 1< 10 0 10

Results
Variables

Objective 0

X1 X2 X3 X4 RHS DUAL
Maximize 2 1 -3 5

Constrain
1 7 3 7 <= 46 0.33
t1
Constrain
3 -1 1 2 <= 8 1.33
t2
Constrain
t3 2 3 -1 1 <= 10 0

Solution 0 1.71 0 4.86 26

 Problem setup area
Slack/Surplus Variable Status

X1 NONBasic
< constraints > constraints
0 46 0 0 X2 Basic

X3 NONBasic
0 8 0 0
0 10 0 0 X4 Basic

slack 1 NONBasic

slack 2 NONBasic

slack 3 Basic
Optimal
Value (Z)

Reduced Original Lower Upper

Variable Value
Cost Val Bound Bound
X1 0 2.33 2 -Infinity 4.33
X2 1.71 0 1 -2.5 3.58
X3 0 5.33 -3 -Infinity 2.33
X4 4.86 0 5 2.77 Infinity
Dual Slack/Sur Original Lower Upper
Value plus Val Bound Bound

Constraint 1 0.33 0 46 28 46

Constraint 2 1.33 0 8 8 13.14

Constraint 3 0 0 10 10 Infinity
Value

1.71

4.86

26
 2 1 -3 5 0 0
Basic Variable Quantity X1 X2 x3 X4 SLACK 1 SLACK 2
Iteration 1

0 slack 1 46 1 7 3 7 1 0

0 slack 2 8 3 -1 1 2 0 1

0 slack 3 10 2 3 -1 1 0 0

zj 0 0 0 0 0 0 0

cj-zj 2 1 -3 5 0 0

Iteration 2
0 slack 1 18 -9.5 10.5 -0.5 0 1 -3.5

5 X4 4 1.5 -0.5 0.5 1 0 0.5

0 slack 3 6 0.5 3.5 -1.5 0 0 -0.5

zj 20 7.5 -2.5 2.5 5 0 2.5

cj-zj -5.5 3.5 -5.5 0 0 -2.5

Iteration 3
1 X2 1.7143 -0.9048 1 -0.0476 0 0.0952 -0.3333
5 X4 4.8571 1.0476 0 0.4762 1 0.0476 0.3333
0 slack 3 0 3.6667 0 -1.3333 0 -0.3333 0.6667
zj 26 4.33 1 2.33 5 0.33 1.33
cj-zj -2.3333 0 -5.3333 0 -0.3333 -1.3333
 0
SLACK 3

0 Original Problem

0 Maximize X1 X2 X3

1 Constraint 1 1 7 3

0 Constraint 2 3 -1 1

0 Constraint 3 2 3 -1

0 Dual Problem

1 Constraint 1 Constraint 2 Constraint 3

0 Minimize 46 8 10

0 X1 1 3 2
X2 7 -1 3
0 X3 3 1 -1
0 X4 7 2 1
1
0
0
X4

7 <= 46

2 <= 8

1 <= 10

>= 2
>= 1
>= -3
>= 5
BAWKA SOAL 4

Linear, Integer or Mixed Integer Programming

Signs
< less than or equal to
= equals (You need to enter an apostrophe first.)
> greater than or equal to

Data Results

X1 X2 LHS Slack/Surplus

Objective 100 50 0 0
Constraint 1 2 6< 16 0 16
Constraint 2 12 16 < 76 0 76
Constraint 3 9 3< 21 0 21

Results
Variables
Objective 0

x1 x2 RHS DUAL
Minimize 100 50

Constraint 1 2 6 <= 16 0

Constraint 2 12 16 <= 76 0

Constraint 3 9 3 <= 21 0

Solution 0 0 0

Reduced Original Lower Upper

Variable Value
Cost Val Bound Bound
X1 0 100 100 0 Infinity
X2 0 50 50 0 Infinity

Dual Value Slack/Sur Original Lower Upper

plus Val Bound Bound
Constraint 1 0 16 16 0 Infinity

Constraint 2 0 76 76 0 Infinity

Constraint 3 0 21 21 0 Infinity
 Problem setup area Variable Status Value

X1 NONBasic 0
Slack/Surplus

X2 NONBasic 0
< constraints > constraints
0 16 0 0 slack 1 Basic 16
0 76 0 0 slack 2 Basic 76
0 21 0 0 slack 3 Basic 21
Optimal Value
0
(Z)
 100 50 0 0 0
Basic Variable Quantity X1 X2 SLACK 1 SLACK 2 SLACK 3
Iteration
1
0 slack 1 16 2 6 1 0 0
0 slack 2 76 12 16 0 1 0
0 slack 3 21 9 3 0 0 1
zj 0 200 100 0 0 0
cj-zj -100 -50 0 0 0

Original
Problem

Minimize X1 X2

Constrain
2 6 <= 16
t1
Constrain
12 16 <= 76
t2
Constrain
t3 9 3 <= 21

Dual
Problem
Constrain
Constraint 1 Constraint 2
t3

Maximize -16 -76 -21

X1 -2 -12 -9 <= 100

X2 -6 -16 -3 <= 50
SOAL 5

Linear, Integer or Mixed Integer Programming

Signs
< less than or equal to
= equals (You need to enter an apostrophe first.)
> greater than or equal to

Data Results Problem setup area

X1 X2 LHS Slack/Surplus

Objective 4 1 0 0 < constraints

Constraint 1 3 1> 3 0 3 0
Constraint 2 4 3> 6 0 6 0

Constraint 3 1 2> 4 0 4 0

Results
Variables 0 0
Objective 0

X1 X2 RHS DUAL
Minimize 4 1

Constraint 1 3 1 >= 3 -1

Constraint 2 4 3 >= 6 0

Constraint 3 1 2 >= 4 0

Solution 0 3 3

Reduced Original Lower Upper

Variable Value
Cost Val Bound Bound
X1 0 1 4 3 Infinity
X2 3 0 1 0 1.33
Dual Slack/Sur Original Lower Upper
Value plus Val Bound Bound
Constraint 1 -1 0 3 2 Infinity
Constraint 2 0 3 6 -Infinity 9
Constraint 3 0 2 4 -Infinity 6
 Variable Status Value

X1 NONBasic 0
Problem setup area
X2 Basic 3

surplus 1 NONBasic 0
< constraints > constraints
0 0 3 surplus 2 Basic 3
0 0 6 surplus 3 Basic 2
Optimal
3
0 0 4 Value (Z)
 4 1 0 0 0 0
Basic variable quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
Phase 1 -
Iteration
1

1 artfcl 1 3 3 1 1 -1 0 0

1 artfcl 2 6 4 3 0 0 1 -1

1 artfcl 3 4 1 2 0 0 0 0

zj 13 -8 -6 1 1 1 1

cj-zj 8 6 0 -1 0 -1

Iteration
2
0 X1 1 1 0.3333 0.3333 -0.3333 0 0

1 artfcl 2 2 0 1.6667 -1.3333 1.3333 1 -1

1 artfcl 3 3 0 1.6667 -0.3333 0.3333 0 0

zj 5 0 -3.33 3.67 -1.67 1 1

cj-zj 0 3.3333 -2.6667 1.6667 0 -1

Iteration
3
0 X1 0.6 1 0 0.6 -0.6 -0.2 0.2
0 X2 1.2 0 1 -0.8 0.8 0.6 -0.6
1 artfcl 3 1 0 0 1 -1 -1 1
zj 1 0 0 1 1 3 -1
cj-zj 0 0 0 -1 -2 1
Iteration
4
0 X1 0.4 1 0 0.4 -0.4 0 0
0 X2 1.8 0 1 -0.2 0.2 0 0
0 surplus 2 1 0 0 1 -1 -1 1
zj 0 0 0 2 0 2 0
cj-zj 0 0 -1 0 -1 0
Phase 2
4 X1 0.4 1 0 0.4 -0.4 0 0
1 X2 1.8 0 1 -0.2 0.2 0 0
0 surplus 2 1 0 0 1 -1 -1 1
zj 3.4 4 1 -1.4 1.4 0 0
 cj-zj 0 0 1.4 -1.4 0 0
Iteration
6
0 surplus 3 2 5 0 2 -2 0 0
1 X2 3 3 1 1 -1 0 0
0 surplus 2 3 5 0 3 -3 -1 1
zj 3 5 1 -1 1 0 0
cj-zj -1 0 1 -1 0 0
 0 0
artfcl 3 surplus 3

0 0 Original Problem

0 0 Minimize X1 X2

1 -1 Constraint 1 3 1 >= 3

1 1 Constraint 2 4 3 >= 6

0 -1 Constraint 3 1 2 >= 4

0 0

0 0 Dual Problem

Constrain Constrain Constrain

1 -1
t1 t2 t3

1 1 Maximize 3 6 4

0 -1 X1 3 4 1 <=

X2 1 3 2 <=

0 0
0 0
1 -1
1 1
0 -1

-0.2 0.2
0.6 -0.6
1 -1
2 0
-1 0

-0.2 0.2
0.6 -0.6
1 -1
0.2 -0.2
-0.2 0.2

-1 1
0 0
0 0
0 0
0 0
4