0% found this document useful (0 votes)
739 views

DGDA ISYE6189037 DeterministicOptimizationStochasticProcesses-Answer

1. The cement company has 3 factories located in A, B, and C, with different production costs. It sends cement to 3 distributors, X, Y, and Z, with varying demand levels. 2. The company wants to determine the optimal production and distribution plan to minimize total costs, which include production costs at each factory and shipping costs to distributors via warehouses. 3. The optimization problem can be modeled as assigning production quantities from each factory to warehouses, and quantities from warehouses to distributors, while respecting capacity, demand and cost constraints. The objective is to minimize the total costs.

Uploaded by

Bunga Afriesta
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
0% found this document useful (0 votes)
739 views

DGDA ISYE6189037 DeterministicOptimizationStochasticProcesses-Answer

1. The cement company has 3 factories located in A, B, and C, with different production costs. It sends cement to 3 distributors, X, Y, and Z, with varying demand levels. 2. The company wants to determine the optimal production and distribution plan to minimize total costs, which include production costs at each factory and shipping costs to distributors via warehouses. 3. The optimization problem can be modeled as assigning production quantities from each factory to warehouses, and quantities from warehouses to distributors, while respecting capacity, demand and cost constraints. The objective is to minimize the total costs.

Uploaded by

Bunga Afriesta
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/ 10

FM-BINUS-AA-FPU-78/V2R1

BINUS University

Academic Career: Class Program:


Undergraduate / Master / Doctoral *) International / Regular / Smart Program /
Global Class / BINUS Online Learning *)

 Mid Exam  Compact Term Exam Term : Odd / Even / Compact *)


 Final Exam  Others Exam : Period (Only for BOL) : 1 / 2 *)

 Kemanggisan  Senayan  Semarang Academic Year :


 Alam Sutera  Bandung
 Bekasi  Malang 2022 / 2023
Exam Type* : Onsite / Online Faculty / Dept. : Industrial Engineering
Day / Date** : Rabu / 16 Agustus 2023 Code - Course : ISYE6189037 -
Deterministic
Optimization &
Stochastic Processes-
Time** : Pk.12.00 WIB Code - Lecturer : D6714 – Kumara
Pinasthika Dharaka, S.T.,
M.Sc
D5821 – Fauzi Khair
S.T., M.Sc.
Exam :  Open Book  Open Notes BULC (Only for BOL) : Bandung, Batam, Bekasi,
Specification***  Close Book  Submit Project Jakarta, Semarang,
 Open E-Book  Oral Test Palembang, Malang,
Makassar, Medan,
Pekanbaru, Samarinda
Class : TMDA, DGDA, DHDA,
DIDA
Equipment*** : Student ID *** :2602252316
 Exam Booklet  Laptop  Drawing Paper – A3 Name *** :Bunga Afriesta w p
 Calculator  Tablet  Drawing Paper – A2 Signature ***
 Dictionary  Smartphone  Notes
:
🞸) Strikethrough the unnecessary items **) For Online Exam, this is the due date ***) Only for Onsite Exam

Please insert the test paper into the exam booklet and submit both papers after the test.

The penalty for CHEATING is DROP OUT!

No. Learning Outcome Weight (%)


LO1 Explain objectives and constraints based on problem descriptions in mathematical 15
optimization models.
LO2 Apply some methods and the techniques used to solve linear optimization models 25
using their mathematical structure.
LO3 Apply the concept of discrete and continuous time Markov chain, transition matrices 25
and state classifications.
LO3 Apply the concept of discrete and continuous time Markov chain, transition matrices 10
and state classifications.
LO4 Analyze given problems using the concepts of Poisson process, renewal process, or 25
queuing theory.
Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 1 of 7
FM-BINUS-AA-FPU-78/V2R1

1. LO1 (15%) A food company wants to produce brownies, bread and martabak dough to sell
to other companies. The 3 main ingredients in each product are flour, eggs, and water. If
the company only has 63 Kg of flour, 71 eggs and 46 liters of water and other supporting
materials are abundantly available. To make brownies, you need 3 kg of flour, 4 eggs and 6
liters of water. To make bread dough, you need 7 kg of flour, 4 eggs and 3 liters of water.
Meanwhile, the martabak dough requires 6 kg of flour, 9 kg of eggs and 12 liters of water.
The profit on the sale of one batch of brownies, bread and martabak is $20, $29, $37,
respectively. If the company wants to maximize profit, what amount of each dough is needed
along with the profit earned?
Perusahaan makanan ingin memproduksi adonan brownis, roti, dan martabak untuk dijual
kepada perusahaan lain. 3 bahan utama pada setiap produk adalah tepung, telur, dan air. Jika
perusahaan hanya memilik 63 Kg tepung, 71 butir telur dan 46-liter air serta bahan
pendukung lainnya tersedia melimpah. Untuk membuat adonan brownis membutuhkan 3 Kg
tepung, 4 telur, dan 6-liter air. Untuk membuat adonan roti membutuhkan 7 Kg tepung, 4
butir telur, dan 3-liter air. Sementara adonan martabak membutuhkan 6 Kg tepung, 9 Kg
telur, dan 12-liter air. Keuntungan penjualan satu adonan brownis, roti, dan martabak
berturut-turut sebesar $20, $29, $37. Jika perusahaan ingin memaksimalkan profit berapa
jumlah masing masing adonan yang dibutuhkan beserta keuntungan yang didapat?
Additional notes for Brownies, Bread, and Martabak Profit:
Denoted by the last two from your NIM added to the profit.
Example, if your NIM is 2201700826, then the last two numbers used are “26” so the profit
will be $20+26, $29+26, $37+26 respectively.

Jawab :
1. decision variable
x = jumlah adonan brownis
y = jumlah adonan roti
z = jumlah adonan martabak

2. fungsi tujuan :
maximize z : 36x + 45y +53z

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 2 of 7
FM-BINUS-AA-FPU-78/V2R1
3. fungsi kendala
Tepung: 3x + 7y + 6z ≤ 63
Telur: 4x + 4y + 9z ≤ 71
Air: 6x + 3y + 12z ≤ 46
x,y, z ≥ 0 (karena kita tidak bisa memproduksi jumlah negatif)

Jadi profit jumlah masing masing adonan yang dibutuhkan beserta keuntungan yang
didapat adalah 36x + 45y +53z yaitu 36(4,030) + 45(7,27) + 53(0)

2. LO1 (25%) A cement company has 3 (three) factories in different locations, namely in A, B,
and C. Production costs in A are Rp. 600,000 per ton, in B Rp. 400,000 per ton and in C Rp.
500.000,- per ton. Each factory currently only produces 100,000 tons per day according to
market demand, even though the actual installed capacity of the three factories is capable
of producing 120,000 tons per day. The company sends production from the three factories
to 3 (three) distributor locations, namely X, Y, and Z. The demand for Distributor X is
100,000 tons per day, Distributor Y is 120,000 tons per day, and Distributor Z is 80,000
tons per day. The company wants to use warehouses located at J and K with a storage
capacity of 125,000 tons and 175,000 tons per day respectively and shipping costs (in

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 3 of 7
FM-BINUS-AA-FPU-78/V2R1
thousands of rupiah) as shown in the table below. The value "M" means it is not possible to
make a delivery.

Warehouse
Factory
J K
A 75+”6” M
B M 85+”6”
C 60+ ”6” 90+”6”

Distributor
Warehouse
X Y Z
J M 80+”6” 125+”6”
K 80+”6” 90+”6” M

Note: “x” in the table denoted by the last number of your NIM
Example, if your NIM is 2201700826, then the number used are “6”
The goal of the company is to minimize total costs. Therefore, help the company with:
a. Formulate this problem by drawing a conceptual model with a network model (5 points)
b. Defining the decision variables, modeling the objective function mathematically and
modeling the constraints (10 points)
c. Find a solution (allocation from the factory to the buffer warehouse and allocation from
the buffer warehouse to the distributor) of the problems above using the solver including
the total cost. (10 points)

Sebuah perusahaan semen memiliki 3 (tiga) pabrik di lokasi yang berbeda yaitu di A, B, dan
C. Biaya produksi di A sebesar Rp. 600.000,- per ton, di B sebesar Rp. 400.000,- per ton
dan di C sebesar Rp. 500.000,- per ton. Setiap pabrik saat ini hanya memproduksi 100.000
ton per hari sesuai dengan kebutuhan pasar, meskipun sebenarnya kapasitas terpasang dari
ketiga pabrik mampu memproduksi 120.000 ton per hari. Perusahaan mengirim produksi
dari tiga pabrik itu ke 3 (tiga) lokasi distributor, yaitu X, Y, dan Z. Permintaan Distributor
X sebesar 100.000 ton per hari, Distributor Y sebesar 120.000 ton per hari, dan Distributor
Z sebesar 80.000 ton per hari. Perusahaan ingin menggunakan warehouse (gudang
penyangga) yang berlokasi di J dan K dengan kapasitas penyimpanan berturut-turut sebesar
Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 4 of 7
FM-BINUS-AA-FPU-78/V2R1
125.000 ton dan 175.000 ton per hari dan biaya pengiriman (dalam ribuan rupiah) seperti
tabel di bawah ini. Nilai “M“ berarti tidak memungkinkan untuk melakukan pengiriman.

Warehouse
Factory
J K
A 81 M
B M 91
C 66 96

Distributor
Warehouse
X Y Z
J M 86 131
K 86 96 M
Note: “x” in the table denoted by the last number of your NIM
Example, if your NIM is 2201700826, then the number used are “6”
Tujuan dari perusahaan adalah untuk meminimumkan total biaya. Oleh karena itu, bantulah
perusahaan tersebut dengan
a. Memformulasikan masalah ini dengan menggambar model konseptual dengan model
network (5 poin)
Jawab :
A B C
66
91

81 96

J K
131 86

86
96

X Y Z 80.000
100.000 120.000
Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 5 of 7
FM-BINUS-AA-FPU-78/V2R1
b. Mendefinisikan variabel keputusan, memodelkan matematika fungsi tujuannya dan
memodelkan pembatas (10 poin)
Nim 2602252316 (6)
X : Jumlah ton yang dikirim dari pabrik (A,B,C) ke gudang (J,K)

Y : Jumlah ton yang dikirim dari Gudang (J,K) ke distributor (X,Y,Z)


Fungsi tujuan (Z)

Minimum total biaya : 600x(AJ) + 500x (CJ) + 400x(BK) + 500x (CK) +86y (JY)
+131y (JZ) + 86y(KX) + 96y (KY)
Pembatas atas
:xAJ ≤ 100
xBK ≤ 100
xCJ +xCK ≤ 100
yJY + yJZ ≤ 131
yKX + yKY ≤ 182
yKX = 100
yJK + yKY = 120.000
yJZ = 80.000
X≥0
Y≥0

c. Cari solusi (alokasi dari pabrik ke Gudang penyangga dan alokasi dari gudang penyangga
ke distributor) dari permasalahan di atas dengan menggunakan solver termasuk total
costnya. (10 poin)

3. (LO3 25%) Rock-Paper-Scissors is a simple game in which two players compete by


simultaneously choosing rock, paper, or scissors. According to the classic rules of the game,
paper beats rock, scissors beat paper, and rock beats scissors. After watching one player
compete in this game for many rounds, you have observed that she chooses rock, paper, or
scissors based on her previous choice according to the following transition probabilities:

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 6 of 7
FM-BINUS-AA-FPU-78/V2R1

Future Choice
Rock Paper Scissor
Rock 0.2 0.3 0.5
Current
Paper 0.4 0.1 0.5
Choice
Scissor 0.7 0.3 0

Assume you are competing against this player and that you must decide on all future choices
now (before seeing any additional opponent choices).
a. Draw the transition diagram! [5 Points]
b. Given the opposing player last chose Rock, what is your best choice in the next round
as her opponent? [10 Points]
c. What is the best strategy that works most of the time to beat your opponent? [10 Points]

Rock-Paper-Scissors adalah permainan sederhana di mana dua pemain bersaing dengan


memilih batu, kertas, atau gunting secara bersamaan. Menurut aturan permainan klasik,
kertas mengalahkan batu, gunting mengalahkan kertas, dan batu mengalahkan gunting.
Setelah menonton satu pemain tertentu bersaing dalam permainan ini untuk banyak putaran,
Anda telah mengamati bahwa dia memilih batu, kertas, atau gunting berdasarkan pilihan
sebelumnya sesuai dengan probabilitas transisi berikut:
Future Choice
Batu Kertas Gunting
Batu 0.2 0.3 0.5
Current
Kertas 0.4 0.1 0.5
Choice
Gunting 0.7 0.3 0
Asumsikan Anda bersaing melawan pemain ini dan Anda harus memutuskan semua pilihan
masa depan sekarang (sebelum melihat pilihan lawan tambahan).

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 7 of 7
FM-BINUS-AA-FPU-78/V2R1
a. Gambarlah diagram transisi! [5 Poin]

b. Mengingat pemain lawan terakhir memilih Rock, apa pilihan terbaik Anda di babak
selanjutnya sebagai lawannya? [10 Poin]

Jawab : dari probabilitas memilih batu 0,5 lebih besar dibandingkan dengan memilih
kertas 0,3 dan memilih batu 0,2
c. Apa strategi terbaik yang paling berhasil untuk mengalahkan lawan Anda? [10 Poin]
Jawab :
Untuk mengalahkan lawan harus mempertimbangkan probabilitas tertinggi dari setiap pilihan
lawan dan memilih opsi yang dapat mengalahkannya
1. Jika lawan memilih, batu maka cara melawan terbaiknya dengan memilih keryas karena
memiliki nilai probabilitas tertinggi
2. Jika lawan memilih kertas maka cara melawan terbaiknya dengan memilih gunting
3. Jika lawan memilih gunting maka cara melawan terbaiknya dengan memilih batu

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 8 of 7
FM-BINUS-AA-FPU-78/V2R1
4. (LO3 10%) Answer the following questions!
a. Here is the Markov Chain, then… [4 Points]

▪ Which state are communicates?


▪ Which are the transient states?
▪ The systems are ergodic or non-ergodic?
b. Explain about reneging, balking, dan jockeying in queueing theory! [3 Points]
c. Please pay attention to the following statements! [3 Points]
▪ Statement 1: In making rational decisions, a player needs anticipation of the
competitor’s response.
▪ Statement 2: Competitor’s behaviour can be expected.
Are the two above statements true or false?

5. (LO4 25%) Currently, Commercial Banks have 1 unit of ATM machines to meet customer
needs. It is known that there is an average of 12+x customers in the system. Then it is
also known that the average time spent by someone in the system is 10 minutes. Assume
that the system follows M/M/1. The Commercial Bank operational manager is
considering whether it is necessary to add 1 unit of ATM machine. What are your
considerations? To strengthen the consideration, compare the queue length, queue
length, and utilities before and after adding an ATM machine?
Saat ini Bank Umum memiliki 1-unit mesin ATM untuk memenuhi kebutuhan nasabah.
Diketahui bahwa rata-rata terdapat 12+x pelanggan dalam sistem tersebut. Kemudian
diketahui juga bahwa rata-rata waktu yang dihabiskan seseorang dalam sistem tersebut
adalah 10 menit. Asumsikan bahwa sistem mengikuti M/M/1. Manajer operasional Bank
Umum sedang mempertimbangkan apakah perlu menambah 1 unit mesin ATM. Apa
pertimbangan Anda? Untuk memperkuat pertimbangan, bandingkan panjang antrian,
panjang antrian, dan utilitas sebelum dan sesudah penambahan mesin ATM?
Note: x denoted by the last number of your NIM
Example, if your NIM is 2201700826, then the number used are “6”

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 9 of 7
FM-BINUS-AA-FPU-78/V2R1

Jawab :

Untuk menghitung panjang rata-rata antrian (Lq) sebelum dan sesudah penambahan mesin ATM, kita dapat
menggunakan rumus:

Lq = (λ^2) / (μ * (μ - λ))

Sebelum Penambahan Mesin ATM:


λ = 18 pelanggan/menit
μ = 0.1 pelanggan/menit

Lq_sebelum = (18^2) / (0.1 * (0.1 - 18))


Lq_sebelum ≈ 324 pelanggan

Setelah Penambahan Mesin ATM:


Dengan penambahan mesin ATM, kita memiliki 2 server (mesin ATM).

μ_total = 2 * μ = 2 * 0.1 = 0.2 pelanggan/menit

Lq_sesudah = (18^2) / (0.2 * (0.2 - 18))


Lq_sesudah ≈ 8.1 pelanggan

Utilitas Server (ρ):


Utilitas server adalah rasio antara laju kedatangan pelanggan (λ) dan laju pelayanan (μ).

ρ=λ/μ

Sebelum Penambahan Mesin ATM:


ρ_sebelum = 18 / 0.1 = 180%

Setelah Penambahan Mesin ATM:


ρ_sesudah = 18 / 0.2 = 90%

Dari perhitungan di atas, kita bisa melihat bahwa dengan menambah 1 unit mesin ATM, panjang antrian rata-
rata (Lq) secara signifikan berkurang dari sekitar 324 pelanggan menjadi sekitar 8.1 pelanggan. Selain itu,
utilitas server juga menurun dari 180% menjadi 90%, menunjukkan bahwa server tidak akan terlalu sibuk.

Pertimbangan untuk menambah mesin ATM sebaiknya dilakukan karena penambahan mesin ATM akan
mengurangi Panjang antrian dan mengurangi beban pada server. Ini dapat meningkatkan efisiensi pelaynan
kepada asabah dan mengurangi waktu tunggu nasabah dalam antrian.

===== GOOD LUCK =====

Verified by,

[Maria Loura Christhia, S.T.,M.Sc.] (D6789) and sent to Department/Program Jul 14th, 2023
Page 10 of
7

You might also like