Tugas 1

Rachmadi Norcahyo
1. Dua produk diproduksi secara berurutan pada dua mesin. Waktu kerja adalah 8 jam per
hari dan jika dibutuhkan akan dilakukan kerja lembur hingga 4 jam, dengan biaya
tambahan 100 dolar per jam. Tabel dibawah menunjukkan laju produksi (produktivitas)
kedua mesin dan harga per unit dari masing-masing produk. Tentukan jadwal produksi
yang optimal dan penggunaan jam kerja lembur jika dibutuhkan.
Production rate (unit/hour)
Product 1
Product 2
Machine 1
5
5
Machine 2
8
4
Price per unit ($)
110
118
Jawab:
Decision Variable:
X1: jumlah unit produk 1
X2: jumlah unit produk 2
L1: jumlah jam lembur mesin 1
L2: jumlah jam lembur mesin 2
Z1: jumlah jam nganggur mesin 1
Z2: jumlah jam nganggur mesin 2
Fungsi Objektif:
Max P = 110*X1 + 118*X2 - 100*(L1 + L2)
Constraints:
X1/5 + X2/5+Z1-L1 = 8;
X1/8 + X2/4+Z2-L2 = 8;
L1 <= 4;
L2 <=4;
X1; X2; Z1; Z2 0
Perhitungan Lingo:
Global optimal solution found.
Objective value:
Infeasibilities:
Total solver iterations:
6232.000
0.000000
2
Model Class:
LP
Total variables:
Nonlinear variables:
Integer variables:
6
0
0
Total constraints:
Nonlinear constraints:
5
0
Total nonzeros:
Nonlinear nonzeros:
14
0
1
|
Operasional
Riset
Rachmadi Norcahyo
Variable
X1
X2
L1
L2
Z1
Z2
Row
1
2
3
4
5
Value
56.00000
4.000000
4.000000
0.000000
0.000000
0.000000
Slack or Surplus
6232.000
0.000000
0.000000
0.000000
4.000000
Reduced Cost
0.000000
0.000000
0.000000
36.00000
510.0000
64.00000
Dual Price
1.000000
510.0000
64.00000
410.0000
0.000000
Kesimpulan
Dari perhitungan dengan menggunakan LINGO didapatkan nilai X1 dan X2 berturutturut adalah 56 unit dan 4 unit, nilai L1 dan L1 berturut-turut adalah 4 jam dan 4 jam,
sedangkan nilai Z1 dan Z2 adalah 0 jam. Sehingga bisa disimpulkan bahwa jam kerja
yang digunakan pada masing-masing mesin adalah sebagai berikut:
Mesin satu:
Total jam kerja mesin satu
X1/5 + X2/5 = 56/5 + 4/5

= 12 jam
Jam kerja normal mesin 1
= Tot jam kerja mesin 1 jam lembur mesin 1 (L1)
= 12 4
= 8 jam
Sehingga jam kerja mesin satu adalah: 8 jam/hari ditambah lembur 4 jam/hari
Mesin dua:
Total jam kerja mesin dua
X1/8 + X2/4 = 56/8 + 4/4

= 8 jam
Jam kerja normal mesin 2
= Tot jam kerja mesin 2 jam lembur mesin 2 (Z2)
=80
= 8 jam
Sehingga jam kerja mesin dua adalah: 8 jam kerja per hari tanpa lembur.
Dengan pola jam kerja seperti di atas, pemasukan dari penjualan kedua produk yang
diperoleh perusahaan adalah sebesar Rp 6.232,- per hari.
2. Colcau memproduksi batu baru dari tiga pertambangan dan mengiriminya kepada
konsumen. Biaya produksi batu bara per ton, ash dan sulfur yang mengandung (per ton)
batu bara, dan kapasitas produksi (dalam ton) untuk setiap pertambangan ditunjukkan oleh
Table 1. Informasi banyaknya permintaan batu bara (dalam ton) oleh masing-masing
konsumen disajikan pada Tabel 2. Biaya (dalam dolar) pengiriman batu bara per ton dari
pertambangan ke setiap konsumen bisa dilihat pada Tabel 3. Kandungan maksimal ash dan
sulfur dalam batu bara setiap kali pengiriman berturut-turut adalah 5% dan 4%. Buatlah
2
|
Operasional
Riset
Rachmadi Norcahyo
formulasi LP yang bertujuan meminimalkan biaya untuk bisa memenuhi permintaan
konsumen.
Tambang
1
2
3
Biaya produksi
($)
50
55
62
kapasita
s
120
100
140
Table 1
Kandungan Ash
(Tons)
0,08
0,06
0,04
Kandungan Sulfur
(Tons)
0,05
0,04
0,03
Table 2
Konsumen 1($)
80
Konsumen 2($)
70
Tambang
1
2
3
1
4
9
8
Konsumen 3($)
60
Table 3
Konsumen
2
3
6
8
9
7
12
3
Konsumen 4($)
40
4
12
11
5
Jawab :
Fungsi Objektif:
Min P = 50*( X11+X12 +X13 + X14) + 55*(X21+ X22 + X23 + X24) + 62*(X31 +
X32 + X33 + X34) + 4*X11 + 6*X1.2 + 8*X13 + 12*X14 + 9*X21 + 9*X22 + 7*X23
+ 11*X24 + 8*X31 + 12*X32 + 3*X33 + 5*X34
Constraints:
X11+X12 +X13 + X14 120
X21+ X22 + X23 + X24 100
X31 + X32 + X33 + X34 140
X11 + X21 + X31 = 80
X12 + X22 + X32 = 70
X13 + X23 + X33 = 60
X14 + X24 + X34 = 40
0,08*( X11+X12 +X13 + X14) + 0,06*(X21+ X22 + X23 + X24) + 0,04*(X31 + X32
+ X33 + X34) 15
0,05*( X11+X12 +X13 + X14) + 0,04*(X21+ X22 + X23 + X24) + 0,03*(X31 + X32
+ X33 + X34) 12
X11 , X12 , X13 , X14 0
X21 , X22 , X23 , X24 0
X31 ,X32 , X33 , X34 0
Perhitungan Lingo :
Objective value:
15220.00
Infeasibilities:
0.000000
10
Model Class:
LP
3
|
Operasional
Riset
Rachmadi Norcahyo
Total variables:
Integer variables:
12
0
0
Total constraints:
10
0
Total nonzeros:
Nonlinear nonzeros:
60
0
Variable
X11
X12
X13
X14
X21
X22
X23
X24
X31
X32
X33
X34
Value
60.00000
60.00000
0.000000
0.000000
0.000000
10.00000
0.000000
0.000000
20.00000
0.000000
60.00000
40.00000
Reduced Cost
0.000000
0.000000
9.000000
11.00000
2.000000
0.000000
5.000000
7.000000
0.000000
2.000000
0.000000
0.000000
Row
Slack or Surplus
Dual Price
1
15220.00
-1.000000
2
0.000000
0.000000
3
90.00000
0.000000
4
20.00000
0.000000
5
0.000000
-86.00000
6
0.000000
-88.00000
7
0.000000
-81.00000
8
0.000000
-83.00000
9
0.000000
400.0000
10
2.000000
0.000000
Kesimpulan
Untuk memenuhi permintaan konsumen namun dengan biaya yang seminimal mungkin
maka dilakukan penambangan dengan skema berikut
Tambang
Konsumen
Jumlah Produksi (Tons)
1
1
60
1
2
60
2
2
10
3
1
20
3
3
60
3
4
40
Dengan mengikuti skema produksi diatas maka biaya yang dikeluarkan oleh perusahaan
adalah $15220,-
4
|
Operasional
Riset
Rachmadi Norcahyo
3. Chemco produces 3 chemicals: B, C, and D. They begin by purchasing chemical A for a
cost of $6/100 liters. For an additional cost of $3 and the use of 3 hours of skilled labor,
100 liters of A can be transformed into 40 liters of C and 60 liters of B. Chemical C can
either be sold or processed further. It costs $1 and takes 1 hour of skilled labor to process
100 liters of C into 60 liters of D and 40 liters of B. For each chemical the sales price per
100 liters and the maximum amount (in 100s of liters) that can be sold are given in Table
1. A maximum of 200 labor hours are available. Formulate an LP whose solution will tell
Chemco how to maximize their profit.
Table 1
Chemicals
Price ($)
Max demand
B
12
30
C
16
60
D
26
40
Jawab :
Donovan enterprises produces electric mixers.
100 A
0.4 A
ACJ
0.6 AB
AC
ACD
ACB
A
= Bahan baku
AB dan ACB = Produk B
ACJ
= produk C yang dijual
ACD
= produk D
Max P = 12* ( AB + ACB) + 16* (ACJ + 26* ACD (6+3)*A ACD
St:
AB + AC = A
AB = 0.6* A
ACJ + AC = 0.4 A
ACD = 0.6*AC
ACB = 0.4*AC
AB + ACB < 30
ACJ <= 60
ACD <= 40
3A + AC < 200
4. Each of donovans workers works three quarters of the year and gets one quarter off. Thus,
a worker may work during quarters 1, 2, and 4 get quarter 3 off. Each worker is paid
$30.000 per year and (if working) can produce up to 500 mixers during a quarter. At the
end of each quarter, Donovan incurs a holding cost of $30 per mixer on each mixer in
inventory. Formulate an LP to help Donovan minimize the cost (labor and inventory) of
meeting the next years deamand (on time). At the begining of quarter 1, 600 mixers are
available.
Jawab :
Decision Variable:
5
|
Operasional
Riset
Rachmadi Norcahyo
x1=Bekerja pada kuarter 1,2,3, istirahat pada kuarter 4

Fungsi Objektif:
Min P = 500*(X1+X2+X3+X4) + 30 *( I1 + I2 + I3 + I4 )
Constrains:
500*(X1+X2+X3+X4) + 600 >= 4000 + I1
I1 +500*(X1+X2+X3+X4)>= 2000 + I2
I2 + 500*(X1+X2+X3+X4)>= 3000 + I3
I3 + 500*(X1+X2+X3+X4)> 1000 + I4
Perhitungan Lingo:
Objective value:
Infeasibilities:
3400.000
0.000000
2
Model Class:
LP
Total variables:
Integer variables:
8
0
0
Total constraints:
5
0
Total nonzeros:
Nonlinear nonzeros:
Variable
X1
X2
X3
X4
I1
I2
I3
I4
Value
4.800000
0.000000
2.000000
0.000000
0.000000
0.000000
0.000000
0.000000
27
0
Reduced Cost
0.000000
500.0000
0.000000
0.000000
31.00000
30.00000
30.00000
30.00000
Row
Slack or Surplus
Dual Price
1
3400.000
-1.000000
2
0.000000
-1.000000
3
1400.000
0.000000
4
400.0000
0.000000
5
2400.000
0.000000
Kesimpulan
Untuk meminimalkan biaya namun tetap memenuhi target, maka perlu ada 4,8 orang yang
bekerja pada kuarter 1,2,3 kemudian beristirahat pada kuarter 4 dan 2 orang yang bekerja
pada kuarter 1,3,4 kemudian beristirahat pada kuarter 2
6
|
Operasional
Riset
Rachmadi Norcahyo
5. Pertimbangkan masalah penugasan pesawat untuk empat rute dengan data sebagai berikut:
Jml perjalanan harian pada rute
kapasitas
Jenis
Jumlah
(penumpang
1
2
3
4
pesawat
Pesawat
)
1
50
5
3
2
2
1
2
30
8
4
3
3
2
3
20
10
5
5
4
2
Jumlah pelanggan harian
1000
2000
900
1200
Biaya yang berkaitan, termasuk penalti untuk kelihangan konsumen karena ketersediaan
tempat, adalah
Operating cost ($) per trip on route
Aircraft type
1
2
3
4
1
1000
1100
1200
1500
2
800
900
1000
1000
3
600
800
800
900
Penalty ($) per
40
50
45
70
lost customer
Tentukan pengalokasian pesawat dengan optimum sesuai dengan kebutuhan agar biaya
operasi menjadi murah
Jawab:
Decision Variable:
Xij
= Jumlah jenis pesawat tipe i (1,2,3) yang digunakan untuk rute perjalanan j
(1,2,3,4)
Sj
= Jumlah penumpang yang tidak terlayani pada rute j(1,2,3,4)
Fungsi Objektif:
Min P = 1000*( 3*X11) + 1100*(2*X12) + 1200*(2*X13) + 1500*(X14) + 800*(4*X12) +
400*(4*X22) + 1000*(3*X23) + 1000*(2*X24) + 600*(5*X31) + 800*(5*X32) +
800*(4*X34) + 900*(2*X34) + 40*S1 + 50*S2+ 45*S3 + 70*S4
Constrains:
50*(3*X11) + 30*(4*X21) + 20*(5*X31) + S1 =1000
50*(2*X12) + 30*(3*X22) + 20*(5*X32) + S2 = 2000
50*(2*X13) + 30*(3*X23) + 20*(4*X33) + S3 = 900
50*( X14) + 30*(2*X24) + 20*(2*X34) + S4 = 1200
X11+ X12+ X13+ X14 <= 5
X21+ X22+ X23+ X24 <= 8
X31+ X32+ X33+ X34 <= 10
Perhitungan Lingo:
Objective value:
221900.0
Infeasibilities:
0.000000
16
Model Class:
LP
7
|
Operasional
Riset
Rachmadi Norcahyo
Total variables:
Integer variables:
Total constraints:
Total nonzeros:
Nonlinear nonzeros:
Variable
X11
X12
X13
X14
X21
X22
X23
X24
X31
X32
X33
X34
S1
S2
S3
S4
Value
5.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
8.000000
0.000000
10.00000
0.000000
0.000000
250.0000
1000.000
900.0000
720.0000
16
0
0
8
0
44
0
Reduced Cost
0.000000
200.0000
900.0000
1000.000
600.0000
400.0000
1150.000
0.000000
0.000000
0.000000
600.0000
0.000000
0.000000
0.000000
0.000000
0.000000
Row
Slack or Surplus
Dual Price
1
221900.0
-1.000000
2
0.000000
-40.00000
3
0.000000
-50.00000
4
0.000000
-45.00000
5
0.000000
-70.00000
6
0.000000
3000.000
7
0.000000
2200.000
8
0.000000
1000.000
Kesimpulan:
Untuk menghasilkan biaya operasional yang minimum, maka tipe pesawat-rute yang
terpilih adalah
Jenis Pesawat
Rute
Jumlah Penerbangan
1
1
5
2
4
8
3
1
2.5
3
2
7.5
Biaya operasional yang dikeluarkan dengan kombinasi jenis pesawat-rute-jumlah
penerbangan yang dilakukan adalah $221.900
8
|
Operasional
Riset
Rachmadi Norcahyo
6. Three types of coal, C1, C2, and C3 are pulverized and mixed together to produce 50 tons
per hour needed to power a plant for generating electricity. The burning of coal emits
sulfur oxide (in parts per million) wich must meet the Evironmental Protection Agency
(EPA) specification of at most 2000 parts per million. The following table summarizes the
data of the situation.
C1
C2
C3
Sulfur (parts per million)
2500
1500
1600
Pulverized capacity (ton/hour)
30
30
30
Cost per ton
$30
$35
$33
Jawab
Decision Variabel:
X1 = Jumlah berat coal C1 yang digunakan
Fungsi Objektif:
Min P = 30*C1+ 33*C2+ 33*C3
Constraint:
2500*C1 + 1500*C2 + 1600*C3 <= 2000*(C1 + C2 + C3)
C1 <= 30
C2 <=30
C3 <= 30
C1 + C2 + C3 >= 50
Perhitungan Lingo:
Objective value:
Infeasibilities:
1583.333
0.000000
2
Model Class:
LP
Total variables:
Integer variables:
3
0
0
Total constraints:
6
0
Total nonzeros:
Nonlinear nonzeros:
Variable
C1
C2
C3
Value
22.22222
00.00000
27.77778
12
0
Reduced Cost
0.000000
1.666667
0.000000
9
|
Operasional
Riset
Rachmadi Norcahyo
Row
Slack or Surplus
Dual Price
1
1583.333
-1.000000
2
0.000000
0.3333333E-02
3
7.777778
0.000000
4
30.00000
0.000000
5
2.222222
0.000000
6
0.000000
-31.66667
Kesimpulan:
Untuk memenuhi kebutuhan power plant dengan meminimalisir kandungan oxida
sulfur maka dibuat skema pencampuran sebagai berikut
Tipe Coal
Jumlah Berat (Tons)
C1
22.22
C2
0
C3
27.78
Dengan mengikuti skema diatas maka biaya yang dibutuhkan adalah $1583.33
7. A company that has a two-year contract to haul ore from an open-pit mine to loading
docks need 200 additional trucks. The company can purchase truck only at the beginning
of the two-year period. Alternatively, the company can lease truck for $80,000 per year
(paid at the beginning of the year). Truck cost $140,000 each to purchase and have a
useful life of two years. They have no salvage value at the end of the two years. The
mining company has $8 million cash available to lease and/or buy truck trucks at the
beginning of year 1. In additional, the company can obtain loan each year for as much as
$20 million at 16% interest per year. The loan agreement required that the company repay
the borrowed amount plus interest at the end of the year. Each truck will earn $12,000 per
year, which becomes part of the flow of cash available for truck leasing and loan
repayment. The company wants to minimize the total cost of expanding its fleet of truck
over a two-year period. Formulate a linier programming model for this problem.
Fungsi Objektif:
max=120000*x1a+120000*x1b+120000*x2b;
Constrains:
140000*x1a+80000*x1b<=8000000;
80000*x2b<=(140000*x1a+80000*x1b);
x1a+x1b+x2b>=200;
Perhitungan Lingo:
Objective value:
0.2400000E+08
Infeasibilities:
0.000000
2
Model Class:
LP
Total variables:
Integer variables:
3
0
0
Total constraints:
4
0
10
|
Operasional
Riset
Rachmadi Norcahyo
Total nonzeros:
Nonlinear nonzeros:
Variable
X1A
X1B
X2B
Row
1
2
3
4
8.
11
0
Value
Reduced Cost
90000.00
0.000000
0.000000
0.000000
100.0000
100.0000
Slack or Surplus
0.2400000E+08
0.000000
0.000000
0.000000
Dual Price
1.000000
3.000000
1.500000
0.000000
The Arkansas Highway Department is planning new 10-km highway om uneven

terrains shown by the profile in the figure below. The widthof the construction terrain
is approximately 50 meters. To simplify the situation, the terrain profile can be
replaced by a step function as shown in the figure. Using heavy machinery, earth
removed from high terrain is hauled to fill low areas. There are also two borrows pits,
I and II located as shown in the figure from which additional earth can be hauled, if
needed. Pit I has capacity of 2,000,000 m3 and pit II a capacity of 1,500,000 m3. The
cost of removing earth from pit I and pit II are, respectively, $1.50 and $01.90 per m 3.
The transportation cost per m3 per km is $.15 and the cost using a machinery to load
hauling truck is $0.20 per m3. This means that a m3 from pit I hauled 1 km will cost a
total of (1.5 + .20) + 1 x 0.15 = $1.85 and a m3 hauled 1 km from hill to a fill area will
cost 0.20 + 1 x 0.15 = $0.35. Development minimum cost plan for leveling the 10 km
srestch.
JAWAB:
A1
A3
A2
P1
A4
11
|
Operasional
Riset
Rachmadi Norcahyo
P2
Volume sumber timbunan A1 dan A3 serta cekungan A2 dan A3

A1: 10 X 50 X 2000 = 1.000.000 m3
A2: 20 X 50 X 2000 = 2.000.000 m3
A3: 10 X 50 X 2000 = 1.000.000 m3
A4: 10 X 50 X 4000 = 2.000.000 m3
Jarak antar timbunan A1, A3 dan pit 1, 2 dengan cekungan 2, 4
A2 (5)
A4 (6)
A1 (1)
2
7
A3 (2)
2
3
P1 (3)
7
2
P2 (4)
7
2
Biaya ($) per m3

A1 (1)
A3 (2)
P1 (3)
P2 (4)
A2 (5)
A4 (6)
0,2 + (2 X 0,15) = 0,5
0,2 + (7 X 0,15) = 1,25
0,2 + (2 X 0,15) = 0,5
0,2 + (3 X 0,15) = 0,65
(1,5 + 0,2) + (7 X 0,15) = 2,75 (1,5 + 0,2) + (2 X 0,15) = 2
(1,9 + 0,2) + (7 X 0,15) = 3,15 (1,9 + 0,2) + (2 X 0,15) = 2,4
Simbol/Kode
A1: 1
A3: 2
P1: 3
P2: 4
A2: 5
A4: 6
Decision Variable
Xij: Jumlah volum tanah (m3)yang dipindahkan dari sumber i ke tujuan j
catatan:
i = 1, 2, 3, dan 4
j = 5 dan 6
Fungsi Objektif
Min Z = 0.5*X15 + 1.25*X16 + 0.5*X25 + 0.65*X26 + 2.75*X35 + 2*X36 +
3.15*X45 + 2.4*X46;
Constraints
X15 + X16 <= 1000000;
X25 + X26 <= 1000000;
X35 + X36 <= 2000000;
X45 + X46 <= 1500000;
X15 + X25 + X35 + X45 >= 2000000;
X16 + X26 + X36 + X46 >= 2000000;
Perhitungan Lingo
Objective value:
5000000.
12
|
Operasional
Riset
Rachmadi Norcahyo
Infeasibilities:
0.000000
5
Model Class:
LP
Total variables:
Integer variables:
8
0
0
Total constraints:
7
0
Total nonzeros:
Nonlinear nonzeros:
Variable
X15
X16
X25
X26
X35
X36
X45
X46
Value
1000000.
0.000000
1000000.
0.000000
0.000000
2000000.
0.000000
0.000000
24
0
Reduced Cost
0.000000
0.6000000
0.000000
0.000000
0.9000000
0.000000
1.300000
0.4000000
Row
Slack or Surplus
Dual Price
1
5000000.
-1.000000
2
0.000000
1.350000
3
0.000000
1.350000
4
0.000000
0.000000
5
1500000.
0.000000
6
0.000000
-1.850000
7
0.000000
-2.000000
Kesimpulan
Untuk meminimalisir biaya yang dikeluarkan maka nilai dari X15=1000000,
X25=1000000, X36=2000000 dengan biaya total adalah sebesar $5.000.000,-
9. Hawaii Sugar Company produces brown sugar, processed (white) sugar, powdered sugar,
and molasses from sugar cane syrup. The company purchases 4000 ton of syrup weekly
and is contracted to deliver at least 25 tons weekly of each type of sugar. The production
process start by manufacturing a brown sugar and molasses from syrup. A ton of syrup
produces 0.3 ton of brown sugar and 0.1 ton of molasses. White sugar is produced by
processing brown sugar. It takes 1 ton of brown sugar to produce 0.8 ton white sugar.
Powdered sugar is produced from white sugar through special grinding process that has a
95% conversion efficiency (1 ton of white sugar produces 0.95 ton of powdered sugar).
The profit per ton for brown sugar, white sugar, powdered sugar, and molasses are $150,
$200, $230, and $35, respectively. Formulate the problem as a linear program, and
determine the weekly production schedule.
13
|
Operasional
Riset
Rachmadi Norcahyo
Jawab:
x 1+
x3
0. 9 5
0.8
x 2+
Decision Variable:
X1= Jumlah berat brown sugar yang diproduksi per minggu
X2= Jumlah berat white sugar yang diproduksi per minggu
X3= Jumlah berat powdered sugar yang diproduksi per minggu
X4= Jumlah berat molasses yang diproduksi per minggu
Fungsi Objektif:
Max = 150*X1 + 200*X2 + 230*X3 + 35*X4
Constrains:
X4<=4000*X1
X4<=400
SM + SB = S;
SM = 0.1*S;
SB + SBP = 0.3*S;
BW = 0.8*SBP;
WP = 0.95*BW;
SB >= 25;
BW >= 25;
WP >= 25;
SM >= 25;
Perhitungan Lingo:
Objective value:
Infeasibilities:
222677.5
0.000000
14
|
Operasional
Riset
Rachmadi Norcahyo
Model Class:
LP
Total variables:
Integer variables:
4
0
0
Total constraints:
7
0
Total nonzeros:
Nonlinear nonzeros:
Variable
X1
X2
X3
X4
Value
25.00000
25.00000
869.2500
400.0000
12
0
Reduced Cost
0.000000
0.000000
0.000000
0.000000
Row
Slack or Surplus
Dual Price
1
222677.5
1.000000
2
0.000000
35.00000
3
0.000000
230.0000
4
0.000000
-24.80000
5
0.000000
-18.50000
6
844.2500
0.000000
7
400.0000
0.000000
Kesimpulan:
Untuk menghasilkan untung yang maksimum maka perusahaan harus memproduksi
X1= 25 Ton brown sugar yang diproduksi per minggu
X2= 25 Ton white sugar yang diproduksi per minggu
X3= 869.25 Ton powdered sugar yang diproduksi per minggu
X4= 400 Ton molasses yang diproduksi per minggu
Dengan mengikuti skema diatas maka perushaan akan mendapatkan keuntungan
sebesar $222677.50
10 The manager of the Ewing and Barnes Department Store has four employees available to
assign to three departments in the storelamps, sporting goods, and linen. The manager
wants each of these departments to have at least one employee, but no more than two.
Each employee has different area of expertise, which area reflected in the daily sales
each employee is expected to generate in each department, as follows.
Department Sales ($)
Employee
Lamps
Sporting Goods
Linen
1
130
150
90
2
275
300
100
3
180
225
140
4
200
120
160
15
|
Operasional
Riset
Rachmadi Norcahyo
The manager wishes to know which employee(s) to assign to each department in order to
maximize the expected sales. Formulate a linear programming model for this problem.
Suppose that the department manager plans to assign only one employee to each
department and to lay off the least productive employee. Formulate a new linear
programming model that reflects this new condition.
Jawab
Fungsi Objektif:
Max :
P = 130*X1a + 150*X1b + 90*X1c + 275*X2a + 300*X2b + 100*X2c+ 180*X3a
+ 225*X3b + 140*X3c + 200*X4a + 120*X4b + 160* X4c
Constrains:
X1a + X1b + X1c = 1
X2a + X2b + X2c = 1
X3a + X3b + X3c = 1
X4a + X4b + X4c = 1
X1a + X2a + X3a + X4a <=2
X1a + X2a + X3a + X4a >=1
X1b + X2b + X3b + X4b <=2
X1b + X2b + X3b + X4b >=1
X1c + X2c + X3c + X4c <= 2
X1c + X2c + X3c + X4c >= 1
Perhitungan Lingo:
Objective value:
815.0000
Infeasibilities:
0.000000
7
Model Class:
LP
Total variables:
Integer variables:
12
0
0
Total constraints:
11
0
Total nonzeros:
Nonlinear nonzeros:
48
0
Variable
X1A
X1B
X1C
X2A
X2B
X2C
X3A
X3B
Value
1.000000
0.000000
0.000000
0.000000
1.000000
0.000000
0.000000
1.000000
Reduced Cost
0.000000
5.000000
0.000000
0.000000
0.000000
135.0000
20.00000
0.000000
16
|
Operasional
Riset
Rachmadi Norcahyo
X3C
X4A
X4B
X4C
0.000000
0.000000
0.000000
1.000000
20.00000
0.000000
105.0000
0.000000
Row
Slack or Surplus
Dual Price
1
815.0000
1.000000
2
0.000000
130.0000
3
0.000000
275.0000
4
0.000000
200.0000
5
0.000000
200.0000
6
1.000000
0.000000
7
0.000000
0.000000
8
0.000000
25.00000
9
1.000000
0.000000
10
1.000000
0.000000
11
0.000000
-40.00000
Kesimpulan:
Untuk memaksimalkan keuntungan perusahaan maka penempatan karyawan mengikuti
skema seperti :
Karyawan ke
Departemen Penempatan
1
Lamps
2
Sporting goods
3
Sporting goods
4
Linen
Dengan mengikuti skema diatas maka keuntungan yang didapat oleh perusahaan adalah
$.815
11. The overhead crane with two lifting yokes is used to transport mixed concrete to a yard for
casting concrete barrier. The concrete bucket hangs at midpoint from the yoke. The crane
end rails can support a maximum of 25 kip each and the yoke cable have a 20-kip capacity
each. Determine the maximum load capacity, W1 and W2.
Jawab
Fungsi Objektif:
Max ; P = W1 + W2
Constrains:
R1 + R2 = W1 + W2
2*( 0.5 *W1) + 8* (0.5*W1) + 16 *(0.5*W2) + 28*(0.5*W2) = 30*R2
R1 <= 25;
R2<= 25
0.5* W1<= 20;
0.5*W2 <= 20;
Perhitungan Lingo:
Objective value:
50.00000
Infeasibilities:
0.000000
2
Model Class:
LP
17
|
Operasional
Riset
Rachmadi Norcahyo
Total variables:
Integer variables:
4
0
0
Total constraints:
7
0
Total nonzeros:
Nonlinear nonzeros:
Variable
W1
W2
R1
R2
Value
20.58824
29.41176
25.00000
25.00000
13
0
Reduced Cost
0.000000
0.000000
0.000000
0.000000
Row
Slack or Surplus
Dual Price
1
50.00000
1.000000
2
0.000000
-1.000000
3
0.000000
0.000000
4
0.000000
1.000000
5
0.000000
1.000000
6
9.705882
0.000000
7
5.294118
0.000000
Kesimpulan:
Kemampuan berat maksimum yang mampu ditahan oleh W1 adalah 20.59 Kips dan W2
adalah 29.41 Kips.
12. The Goliath Tool and Machine Shop produces a single product that consists of three
subcomponents that are assembled to form the product. The three components are
manufactured in an operation that involves two lathes and three presses. The production
time (in minutes per unit) for each machine for the three components is as follows:
Lathe
Press
Production Time (min)

Component 1
Component 2
10
8
9
21
Component 3
6
15
The shop splits the lathe workload evenly between the two lathes, and it splits the press
workload evenly among the three presses. In addition, the firm wishes to produce
quantities of components that will balance the daily loading among lathes and presses
so that, on the average, no machine is operated more than 1 hour per day longer than
any other machine. Each machine operates 8 hours per day. The firm also wishes to
produce a quantity of components that will result in completely assembled products,
without any partial assemblies (i.e., in-process inventories). The objective of the firm is
to maximize the number of units of assembled product per day. Formulate a linear
programming model for this problem.
Fungsi Objektif:
18
|
Operasional
Riset
Rachmadi Norcahyo
Max
P = Y;
Constrain:
Y - X1 = 0 ;
Y - X2 = 0;
Y - X3 = 0;
10*X1 + 8*X2 + 6*X3 <= 960;
9*X1 + 21*X2 + 15*X3 <= 1.440;
2*X1 3*X2 2*X3 <= 60;
-2*X1 + 3*X2 + 2*X3 <= 60;
Perhitungan Lingo:
Objective value:
Infeasibilities:
0.3200000E-01
0.000000
0
Model Class:
LP
Total variables:
Integer variables:
4
0
0
Total constraints:
8
0
Total nonzeros:
Nonlinear nonzeros:
Variable
Value
Y
0.3200000E-01
X1
0.3200000E-01
X2
0.3200000E-01
X3
0.3200000E-01
Row
1
2
3
4
5
6
7
8
Slack or Surplus
0.3200000E-01
0.000000
0.000000
0.000000
959.2320
0.000000
60.09600
59.90400
19
0
Reduced Cost
0.000000
0.000000
0.000000
0.000000
Dual Price
1.000000
0.2000000
0.4666667
0.3333333
0.000000
0.2222222E-01
0.000000
0.000000
19
|
Operasional
Riset

Tugas 1

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Tugas 1

Diunggah oleh

Hak Cipta:

Format Tersedia

Rachmadi Norcahyo

X1/5 + X2/5 = 56/5 + 4/5

X1/8 + X2/4 = 56/8 + 4/4

x1=Bekerja pada kuarter 1,2,3, istirahat pada kuarter 4

The Arkansas Highway Department is planning new 10-km highway om uneven

Volume sumber timbunan A1 dan A3 serta cekungan A2 dan A3

Biaya ($) per m3

Production Time (min)

Anda mungkin juga menyukai