Analisa dan Sistem Keputusan (Assignment 2)

Fransiscus Geraldo Sianipar

6032211053
Manajemen Industri – MMT ITS

1. Truckco manufactures two types of trucks: 1 and 2. Each truck must go through the
painting shop and assembly shop. If the painting shop were completely devoted to
painting Type 1 trucks, then 800 per day could be painted; if the painting shop were
completely devoted to painting Type 2 trucks, then 700 per day could be painted. If
the assembly shop were completely devoted to assembling truck 1 engines, then 1,500
per day could be assembled; if the assembly shop were completely devoted to
assembling truck 2 engines, then 1,200 per day could be assembled. Each Type 1 truck
contributes $300 to profit; each Type 2 truck contributes $500. Formulate an LP that
will maximize Truckco’s profit and solve it by using graphical method.
Ans:
A. Decision Variable:
a. Truck 1 = X1
b. Truck 2 = X2
B. Objective function is maximized the profit.
Max Z = $ 300 (X1) + 500 (X2)
C. The Constraints

Type Truck Painting Shop Assembly Shop Profit

X1 1⁄800 1⁄1500 $ 300

X2 1⁄700 1⁄1200 $ 500

• Painting shop constraint, X1 ≥ 0, X2 ≥ 0

𝐗𝟏 𝐗𝟐
+ ≤𝟏
𝟖𝟎𝟎 𝟕𝟎𝟎
700
X2 ≤ 700 − X1
800
7
X2 ≤ 700 − X1
8
If X1 = 0, thus X2 = 700
If X2 = 0, thus X1 = 800

1
Analisa dan Sistem Keputusan (Assignment 2)
Fransiscus Geraldo Sianipar
6032211053
Manajemen Industri – MMT ITS

800

700

600

500

X2 400
300

200

100

0
0 100 200 300 400 500 600 700 800
X1
• Assembly shop constraint, X1 ≥ 0, X2 ≥ 0
X1 X2
+ ≤1
1500 1200
1200
X2 ≤ 1200 − X1
1500
4
X2 ≤ 1200 − X1
5
If X1 = 0, thus X2 = 1200
If X2 = 0, thus X1 = 1500

1400

1200

1000

800
X2
600

400

200

0
0 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500
X1

• Feasible Region on both constraint is the region for painting shop constraint.

2
Analisa dan Sistem Keputusan (Assignment 2)
Fransiscus Geraldo Sianipar
6032211053
Manajemen Industri – MMT ITS

1400

1200

1000

800
X2

600 B
i
400 o

200

A C
0
0 100 200 300 400 500 600 700c 800 900 1000 1100 1200 1300 1400 1500
X1

Assembly Shop Constraint Painting Shop Constraint

Based on the feasible region, there are 3-point coordinates:

Coordinate X1 X2 Profit $ (Z=300 X1 + 500 X2)

A 0 0 0
B 0 700 35000
C 800 0 24000

The maximum profit will be achieved by producing Truck Type 1 with quantity of
0 unit per day and Truck Type 2 with quantity of 700 units per day, that will
contribute $35,000 profit per day.

3
Analisa dan Sistem Keputusan (Assignment 2)
Fransiscus Geraldo Sianipar
6032211053
Manajemen Industri – MMT ITS

2. Leary Chemical manufactures three chemicals: A, B, and C. These chemicals are

produced via two production processes: 1 and 2. Running process 1 for an hour, costs
$4 and yields 3 units of A, 1 of B, and 1 of C. Running process 2 for an hour-costs $1
and produces 1 unit of A and 1 of B. To meet customer demands, at least 10 units of
A, 5 of B, and 3 of C must be produced daily. Graphically determine a daily production
plan that minimizes the cost of meeting Leary Chemical’s daily demands.
Ans:
A. Decision Variable:
a. Process 1 = X1
b. Process 2 = X2
B. Objective function is minimized the cost.
Min Z = $ 4 (X1) + 1 (X2)
C. The Constraints
• There are 24 hours a day, so
X1 + X2 ≤ 24
• Process 1 yields 3 units of A, Process 2 yields 1 unit of A then the demand for
chemical A at least 10 units
3X1 + X2 ≥ 10
• Process 1 & 2 yields each 1 unit of B, then the demand for chemical B at least 5
units
X1 + X2 ≥ 5
• Process 1 yields 1 unit of C while Process 2 yields none of C, then the demand for
chemical C at least 3
𝑋1 ≥ 3
• Non-negativity X1 ≥ 0, X2 ≥ 0

4
Analisa dan Sistem Keputusan (Assignment 2)
Fransiscus Geraldo Sianipar
6032211053
Manajemen Industri – MMT ITS

• Feasible Region on the 4 constraints is shown by the graph below.

26
25
24
23
22
21
20
19
18
17
16 Cons 1
15
14 Cons 3
X2 13 Cons 2
12
Linear (Cons 1)
11
10 Linear (Cons 3)
9
Linear (Cons 2)
8
7 Cons 4
6
5
4
3
B
2
1
0
A
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
X1

The coordinate A (5,0) and B (3,2) represent the low cost for process 1 & 2 (near
from 0,0). Which one the lowest is shown by the table below:

Coordinate X1 X2 Profit in $, Z= 4(X1) + X2

A 5 0 20
B 3 2 14

The minimum cost is obtained when Process 1 is used for 3 hours, and Process 2
is used for 2 hours with minimum cost 14$.