You are on page 1of 24

# TUGAS INDIVIDU

ANALISIS REKAYASA
SI-5101

Dosen :
Ir. Biemo W. Soemardi, Ph.D.

Oleh :
Davin Yuan Kermite (25014003)

MANAJEMEN REKAYASA KONSTRUKSI

SEKOLAH PASCA SARJANA
INSTITUT TEKNOLOGI BANDUNG
2014

7-14.

The Electrocomp Corp manufactures 2 electrical products: Air Conditioner and Large Fans. The
assembly process for each is similar in the both require a certain amount of wiring and drilling. Each
air conditioner takes 3 hours of wiring and 2 hours of drilling. Each fan must go through 2 hours of
wiring and 1 hour of drilling. During the next production period, 240 hours of wiring time are
available and up to 140 hours of drilling time may be used. Each air conditioner sold yields a profit of
\$25. Each fan assembled may be sold for a \$15 profit. Formulate and solve this LP production mix
situation to find the best combination of air conditioners and fans that yields the highest profit. Use
the corner point graphical approach. 𝑿
= Air Conditioner 𝒀
= Large Fan

Objective Function:

max profit = 25𝑋 + 15𝑌

s.t.

3𝑋 + 2𝑌 ≤ 240 (hours of wiring time available)
2𝑋 + 𝑌 ≤ 140 (hours of drilling time available) 𝑋
,𝑌 ≤ 0

Dengan menggunakan metode corner point, perlu dicari titik-titik setiap persamaan sehingga dapat dibuat
garis dari persamaan tersebut, yaitu:
a. wiring time constraint
(0, 𝑌 →
3(0) + 2𝑌 = 240 𝑌
= 120
(0, 120)
(𝑋 0) →

3𝑋 + 2(0) = 240 𝑋
= 80
(80, 0)

b. drilling time constraint
(0, 𝑌) → 2(0) + 𝑌 = 140 𝑌
= 140
(0, 140)
(𝑋, 0) →

2𝑋 + (0) = 140 𝑋
= 70
(70, 0)

1

60) Langkah selanjutnya adalah dengan menghitung nilai dari fungsi tujuan di setiap titik: AC (𝑿) Fan (𝒀) Profit = 25𝑿 + 15𝒀 0 0 0 0 120 1800 70 0 1750 40 60 1900 Jadi kombinasi yang memberikan profit paling besar adalah 40 AC dan 60 Fan. 2 .160 140 120 Fan 100 Series1 80 series 2 60 Linear (Series1) 40 Linear (series 2) 20 0 0 20 40 60 80 100 Air Conditioner Titik perpotongan antara garis 1 & garis 2 adalah: 3𝑋 + 2𝑌 – 240 = 2 (2𝑋 + 𝑌 – 140) 3𝑋1 + 2𝑌 – 240 = 4𝑋 + 2𝑌 – 280 40 = 𝑋 𝑌 = 140 – 2(40) = 60 (40.

due to an oversupply of fans in the preceding period. In particular. what would be the optimal solution? How much slack is there for each of the four constraints at the optimal solution? Air Conditioner Large Fan X Y jumlah 45 50 max 25 15 wiring drilling 3 2 Fan max AC min 1 profit 1875 Hours Used Constraint 2 235 <= 240 1 140 <= 140 1 50 <= 50 45 >= 30 Karena jumlah maksimal kipas dikurangi menjadi lebih kecil daripada jumlah kipas pada solusi optimal sebelumnya. Also. (a) If Electrocomp decides that at least 20 AC should be produced but no more than 80 fans should be produced. management decides that there should be a minimum number of air conditioners produced in order to fulfill a contract. what would be the optimal solutions? How much slack is there for each of the four constraints? tambahan constraint: 𝑋 ≥ 20 𝑌 ≤ 80 Air Conditioner Large Fan X Y jumlah 40 60 max 25 15 wiring drilling profit 1900 Hours Used Constraint 2 240 <= 240 1 140 <= 140 1 60 <= 80 40 >= 20 3 2 Fan max AC min 1 solusi optimal (40. maka solusi optimal juga berubah. 60) tidak berubah karena masih memenuhi tambahan constraint.7-15. a limit should be placed on the total number of fans produced. Constraint Slack Surplus (Amount of resource available) – (Amount of resource used) (Actual amount) – (Minimum amount) Wiring Hours Drilling Hours Fan Production AC 0 0 20 20 (b) If Electrocomp decides that at least 30 AC should be produced but no more than 50 fans should be produced. yaitu: Air Conditioner (X) = 45 Large Fan (Y) = 50 profit = 25(45) +15(50) = \$1875 3 . Electrocomp’s management realizes that it forgot to include 2 critical constraints (see Problem 7-14).

working 160 hours each per month. intermediate growth. on its assembly line. 20A + 25B = 800 (semua labor hours digunakan) A ≥ 10.67 1.24 1.200 profit per unit. 0 0 0 15 MSA Computer Corporation manufactures 2 models of minicomputers. The stock brokerage firm of Blank.50 4% 8% Per dollar invested Dividend rate potential 4 . It requires 20 labor hours to assemble each Alpha 4 computer and 25 labor hours to assemble each Beta 5 model.36 . Management insists that full employment (i.200 7-24. and Weinberger has analyzed and recommended two stocks to an investors’ club of college professors. all 160 hours of time) be maintained for each worker during next month’s operations. Alpha 4s generate \$1. MSA wants to see at least 10 Alpha 4s and at least 15 Beta 5s produced during the production period. Determine the most profitable number of each model of minicomputer during the coming month. the Alpha 4 and the Beta 5. Alpha 4 A jumlah 10 max 1200 labor hours Alpha qty Beta qty Beta 5 B 24 1800 20 1 profit 55200 Resource used Constraint 25 800 = 800 10 >= 10 1 24 >= 15 Dengan memproduksi jumlah Alpha 4 minimal (10 unit) dan memaksimalkan jumlah Beta 5 (24 unit) akan didapatkan profit sebesar \$55. and dividend rate.. 𝑨 = Alpha 4 𝑩 = Beta 5 Objective Function: max profit = 1200A + 1800B s. and Beta 5s yield \$1. B ≥ 15 Dengan menggunakan Excel Solver. dicari solusi optimal dari model yang dibuat.800 each. Leibowitz.e.t. The firm employs 5 technicians. These data on each stock are as follows: Stock (\$) Factor Short-term growth potential Per dollar invested Intermediate growth potential (over next 3 years) Louisiana Gas and Power Trimex Insulation Company . The professors were interested in factors such as short-term growth.Constraint Slack Surplus (Amount of resource available) – (Amount of resource used) (Actual amount) – (Minimum amount) Wiring Hours Drilling Hours Fan Production AC 7-19.

t.8 2730 145.67X + 1.04X + 0.50Y ≥ 5000 (intermediate growth) 0. maka untuk mempermudah satuan terkecil dijadikan 1\$ (integer) Objective Function: min investment = X + Y s. Y ≥ 0 (integer) jumlah min short intermediate Dividend 7-27. (2) an appreciation of at least \$5. dijadikan sebagai constraint yang harus dipenuhi dengan fungsi objektif minimasi biaya investasi: 𝑿 = Besarnya investasi di Louisiana Gas and Power 𝒀 = Besarnya investasi di Trimex Insulation Company Karena investasi menggunakan uang yang mempunyai satuan terkecil tertentu (dalam sen).36X + 0. Lousiana Gas and Power (X) Trimex Insulation Company (Y) 1360 1 1360 1820 1 1820 489.4 >= 720 5001.Each member of the club has an investment goal of: (1) an appreciation of no less than \$720 in the short term.0) dan (0. determine (a) which formulation has more than 1 optimal solution (b) which formulation is unbounded (c) which formulation has no feasible solution (d) which formulation is correct as is Persamaan 1 Maximize 10𝑋1 + 10𝑋2 s. 0. What is the smallest investment that a professor can make to meet these three goals? Ketiga goal diatas.6 2271.180 Consider the following 4 LP formulations.08Y ≥ 200 (dividend per year) X.6 investment 3180 Resource used Constraint 926.4) 5 . 𝑋1 ≤ 5 𝑋1 + 2𝑋2 ≤ 8 𝑋2 ≤ 2 𝑋1 = 6 ……………… (8. Using a graphical approach.2 54.4 436. and (3) a dividend income of at least \$200 per year.24Y ≥ 720 (short-term growth) 1.000 in the next 3 years.2 >= 5000 200 >= 200 Dengan menggunakan perhitungan melalui Excel Solver didapatkan bahwa nilai investasi minimum yang dapat diberikan dengan memenuhi ketiga syarat adalah sebesar \$3.t.

t.5 2) 6 .0) dan (0. maka model ini memiliki lebih dari 1 solusi optimal.0) dan (0.1) Redundant constraint Feasible Region 𝑋2 ≤ 1 𝑋1 + 2𝑋2 Karena fungsi objektif parallel dengan constraint 𝑋1 + 2𝑋2 ≤ 2 .t. 𝑋1 ≤ 1 𝑋2 ≤ 1 𝑋1 + 2𝑋2 ≤ 2 ……………… (2. 𝑋1 + 2𝑋2 ≥ 5 𝑋1 ≥ 2 𝑋2 ≥ 4 ……………… (5. (a) Persamaan 3 Maximize 3𝑋1 + 2𝑋2 s.X =6 Tidak ada daerah solusi (c) Persamaan 2 Maximize 𝑋1 + 2𝑋2 s.

0) dan (0.0) dan (0.t.6) 𝑋2 ≥ 1 𝑋1 ≥ 1 Feasible Region Dari grafik di atas. Graph the following LP problem and indicate the optimal solution point: Maximize profit = \$3X + \$2Y s. 2X + Y ≤ 150 2X + 3Y ≤ 300 (a) Does the optimal solution change if the profit per unit of X changes to \$ 4. 150) (150. 2𝑋1 + 3𝑋2 ≤ 24 …………… (12. 100) 7 .Dari grafik dapat dilihat bahwa tidak ada yang membatasi jumlah maksimal 𝑋1 dan 𝑋2 sehingga nilai solusi dari fungsi objektif dapat mencapai tak terhingga (b) Persamaan 4 Maximize 3𝑋1 + 3𝑋2 s. (3. 0) dan (0.8) 2𝑋1 + 𝑋2 ≤ 6 …………….50? (b) What happens if the profit function should have been \$3X + \$3Y? Persamaan 2X + Y ≤ 150 2X + 3Y ≤ 300 Titik yg dilewati (75. meskipun ada constraint yang redundan. namun hasil solusinya memenuhi syarat-syarat/constrain (d) 7-28.t.0) dan (0.

solusi optimalnya adalah X = 30 dan Y = 60 (b) Dengan menggunakan QM. 60) 5X + 6Y 0 300 480 510 Dari hasil perhitungan nilai fungsi objektif masing-masing titik. 0) (0. 2X + Y ≤ 120 2X + 3Y ≤ 240 X.t.Y ≥ 0 (a) What is the optimal solution to this problem? Solve it graphically.7-31. would this affect the optimal solution? (c) Instead of an increase in the profit coefficient X to \$8. 80) (30. didapatkan analisis sensitivitas sebagai berikut: 9 . suppose that profit was overestimated and should only have been \$3. Consider the following LP problem: Maximize profit = 5X +6Y s. 0) (60. (b) If a technical breakthrough occurred that raised the profit per unit of X to \$8. Does this change the optimal solution? (a) Grafik dari model di atas adalah sebagai berikut: Titik (0.

000 must be in money market fund) S. hanya akan mengubah nilai dari profit yang didapat. Y = 80 Profit = 0 + 6(80) = 480 7-37.000 (total investment is \$200.000) 0.1S + 0. and the annual return should be at least \$14. a group of financial advisors and retirement planners.Perubahan koefisien X pada fungsi tujuan menjadi 8 tidak akan mempengaruhi solusi optimal karena nilai 8 masih di antara lower bound (4) dan upper bound (12). S + M = 200.t. Bhavika Investments. and the following linear program was developed to help with this investment decision: Minimize risk = 12S + 5M s. Other conditions related to risk have also been specified. has been requested to provide advice on how to invest \$200.000 (return must be at least \$14. The client has stipulated that the money must be put into either a stock fund or a money market fund.000) M ≥ 40. maka solusi optimalnya akan berubah karena sudah keluar dari batas lower bound (4). yaitu: Profit = 8(30) + 6(60) =600 (c) Apabila ternyata koefisien X berubah menjadi 3. maka solusi optimal yang baru berubah menjadi: X = 0. M ≥ 0 where S = dollars invested in stock fund M = dollars invested in money market fund 10 .05M ≥ 14.000 for one of its clients.000.000 (at least \$40.

000) + 5(120.560.720.000) = \$ 1.000 Rate of return = 14. solusi optimalnya adalah: S = \$ 80.000 to \$50.000 200 .720.000 tidak mengubah solusi karena belum melebihi upper bound (120.000 M = \$ 120. maka kenaikan koefisien ke 14 tidak mengubah solusi.(a) How much money should be invested in money market fund (M) and the stock fund(S)? What is the total risk? Dari hasil yang ditampilkan QM di atas.000 (perhitungan ada di (c)) (e) Would the solution change if the amount that must be invested in the money market fund were changed from \$40.000 (b) What is the total return? What rate of return is this? Total return yang didapat adalah sebesar \$ 14.000) = \$ 1.000? Perubahan nilai pada konstrain ketiga menjadi M ≥ \$50.07 (c) Would the solution change if risk measure for each dollar in the stock fund(S) were 14 instead of 12? Karena upper bound dari variabel S adalah tak terhingga. yaitu: risk = 14(80.000 (d) (d) For each additional dollar that is available.000 Risk = 12(80.000) + 5(120.000 = 0. how much does the risk change? Perubahan besarnya risk adalah \$ 1. hanya besarnya risk yang berubah.000) 11 .

and there is a projected limit on sales of each crop. One acre of land yields an average of 1.5B ≤ 8. W ≤ 110. Crop data follow: Crop Wheat Alfalfa Barley Maximum Sales Water Needed per Acre 110.500 (jumlah air tersedia) W. A. B adalah bilangan bulat.800 tons 2.100 500 3.t. Alfalfa (A). and barley at \$50 per ton. Barley (B) asumsi: W.9 3. with the Black farm receiving 7. northwest sector.5 Margaret’s best estimate is that she can sell wheat at a net profit of \$2 per bushel. Margaret is involved primarily in growing wheat. Each parcel can only tolerate a specified amount of irrigation per growing season. The wheat yield is approximately 50 bushels per acre.9A + 3. (a) Formulate Margaret’s production plan misal: wheat (W).800 B ≤ 2.200 tons 1. as specified in the following table: Parcel Southeast North Northwest West Southwest Area (Acres) Water Irrigation Limit (Acre-feet) 2. (Agricultural production planning problem) Margaret Black’s family owns 5 parcels of farmland broken into a southeast sector.8-15.300 600 1. north sector.000 bushels 1.000 2.6 2. and southwest sector.030 (gambar dari Excel Solver terdapat di halaman berikut) 12 .500 (luas lahan tersedia) 1.200 3. alfalfa at \$40 per ton. and barley crops and is currently preparing her production plan for next year.400 800 500 600 Each of Margaret’s crops needs a minimum amount of water per acre.6W + 2.2 tons of barley.5 tons of alfalfa and 2. The Pennsylvania Water Authority has just announced its yearly water allotment. karena satuan terkecil yang digunakan adalah 1 acre objective function: max profit = 2W + 40A + 50B s. west sector.000 A ≤ 1. A.200 W + A + B ≤ 6.4000 acre-feet. and what profit will it yield? dengan menggunakan Excel Solver didapatkan:  Wheat = 0  Alfalfa = 277  Barley = 2199  Solusi = \$ 121. B ≥ 0 (b) What should the crop plan be. alfalfa.

000 = \$ 2.variabel solution maximize constraints wheat max sale limit alfalfa max sale limit barley max sale limit area max limit water max limit (c) wheat 0 2 alfalfa 277 40 barley 2199 50 1 1 1 1.200 6.000 1.300 .9 Result 121.9 1 1 3.500 The Water Authority informs Margaret that for a special fee of \$6.6 1 2.000. keuntungan bersih yang didapatkan adalah: \$ 8.800 2.300 constraints wheat max sale limit alfalfa max sale limit barley max sale limit area max limit water max limit 1 1 1 1.030 LHS 0 277 1 2199 1 2476 3.200 6.000 this year.000 1.\$ 121.500 8.100 Dengan penambahan biaya \$ 6.6 1 2. How should she respond? variabel wheat alfalfa barley solution 0 490 2194 Result maximize 2 40 50 129.5 LHS 0 490 2194 2684 9100 <= <= <= <= <= RHS 110.5 8499.030 =\$ 8.800 2. ∆profit = (\$ 129.8 <= <= <= <= <= RHS 110.270 . 13 . her farm will qualify for an additional allotment of 600 acre-feet of water.270 Berarti dengan penambahan \$ 6.\$ 6.500 9.000 dolar akan memberikan tambahan air sebesar 600 acrefeet.270 Karena profit yang didapatkan lebih besar dari biaya tambahan yang dikeluarkan maka sebaiknya Margaret mengambil kesempatan tersebut. Maka dari itu perlu dihitung apakah keuntungan yang didapat lebih besar daripada biaya tambahan yang dikeluarkan atau tidak.

7𝐴1 + 0.𝐴2 . (Material blending problem) Amalgamated Products has just received a contract to construct steel body frames for automobiles that are to be produced at the new Japanese factory in Tennessee.07𝐼2 +0.09𝐶3 s. Jawaban : Objective Function: minimize f(\$) = 0.05𝐼2 2000 ≤ 0.23𝐶3 𝐴2 ≤ 300 .09𝐼1 + 0.046 ≤ 0.26𝐴3 +0.03𝐼2 +0.25𝐶2 +0. 0.15𝐴1 + 0. Formulate and solve the LP model that will indicate how much each of the eight materials should be blended into a 1-ton load of steel so that Amalgamated meets its requirements while minimizing costs.3𝐴2 + 0.8-16. 2000 𝐶1 ≤ 50.0505 ≤ 2000 .13𝐴2 + 0. 𝐶2 ≤ 200.1𝐼1 + 0.25𝐶2 +0. The table on this page details these materials.023 .043 ≤ 0.054 𝐶3 ≤ 300 𝐴1 .26𝐴3 +0. ≤ 0.𝐶3 ≥ 0 14 .03𝐼2 +0.1𝐼1 + 0.23𝐶3 0.15𝐴1 + 0.3𝐴2 + 0.15𝐴3 +0.01𝐼1 + 0.𝐴3 .t.24𝐶1 +0.1𝐶1 +0.55𝐴2 + 0.𝐶2 .𝐼1 . The Japanese auto manufacturer has strict quality control standards for all of its component subcontractors and has informed Amalgamated that each frame must have the following steel content: Amalgamated mixes batches of eight different available materials to produce one ton of steel used in the body frames.𝐼2 .12𝐶2 +0.12𝐴1 + 0.𝐶1 .24𝐶1 +0.021 ≤ 0.12𝐴3 +0.

000001 max 100.600% min max 3.25 cost 44.000001 max 50 200 100 Hasil yang didapatkan adalah: • A1 : 60 pounds • C1 : 41. manganese 0. dimana: kandungan minimal carbon adalah 5.15 I2 0 0.03 0.1% 2.13 I1 0 0.6% 5.05%.18 0.01 0. maka akan berakibat pada kandungan silicon melebihi batas maksimal.09 C1 0 0.66666048 max 200. model tidak dapat memberikan solusi yang memenuhi konstrain spesifikasi (kandungan karbon di bawah spesifikasi).30 0.03 0.Hasil perhitungan linear programming dengan menggunakan excel solve adalah sebagai berikut: variable (pounds) produced objective min cost A1 A2 60 0.3% 4.10 0. Oleh karena itu batasan spesifikasi tidak dapat dipenuhi.01 - 0.715% Apabila dilakukan penambahan campuran C1 sampai mencapai kandungan carbon minimum.24 0.66666048 0.25 0.3% 4.715% min max RHS 2.000001 0.20 0.1 C3 200.70 0.12 100.12 0.15 0.67 pounds • C2 : 200 pounds (resource max) • C3 : 100 pounds (resource max) Berdasarkan hasil dari perhitungan excel.09 s.36666636 resource used A1 (pounds) A2 (pounds) A3 (pounds) I1 (pounds) I2 (pounds) C1 (pounds) C2 (pounds) C3 (pounds) 1 1 1 1 2.05 - - - silicon 0.26 0.4% 0 max 300 41.55 0.07 C2 41.23 carbon 0.t.03 - 0.000001 0.05% 5. 15 .100% min max 4. sedangkan hasil dari solusi yang didapat hanya 3.12 A3 0 0.

……. An airline owns an aging fleet of Boeing 737 jet airplanes. Dengan menggunakan excel Solver didapatkan: variable solution max capacity constraint financial maintenance plane qty Boeing 757 Boeing 767 X Y 5 8 result 125.6 billion in purchases (2) each Boeing 757 will cost \$80 million.000 LHS 80 0. max capacity = 125.000Y 80X + 110Y ≤ 1600 (in million)………………………….280 ≤ 8 ≤ 2 ≥ 1600 8 0 dengan X=5 dan Y=8..000X + 81.t.000 passengers annually. financial X ≥ 1 3(X+ Y) menjadi 2X .000 passengers per year.000 81.5 -1 RHS 1. What category of integer programming problem is this? Solve this problem misal: - Boeing 757 = 𝑋 Boeing 767 = 𝑌 jumlah pesawat adalah bilangan bulat (integer) karena satuan terkecil adalah 1 pesawat objective function s. The decision must take into account numerous cost and capability factors.. maka kapasitas totalnya adalah 1. It is considering a major purchase of up to 17 new Boeing model 757 and 767 jets... whereas each 767 can fly 81....10-13.273.8 2 110 0.000 1.5Y ≤ 8 (in million)………………………………… maintenance cost karena yang jumlah pesawat harus dalam bentuk integer (semua variabel harus dalam bentuk integer). and each Boeing 767 will cost \$110 million (3) at least one-third of the planes purchased should be the longer-range 757 (4) the annual maintenance budget is to be no more than \$8 million (5) the annual maintenance cost per 757 is estimated to be \$800. Formulate this as an integer programming problem to maximize the annual passenger-carrying capability.000 penumpang 16 ..Y ≥ 0 .. jumlah pesawat 0.. maka kasus ini termasuk dalam pure integer programming.8X + 0.273...000 and it is \$500...000 for each 767 purchased (6) each 757 can carry 125. including the following: (1) the airline can finance up to \$1.

Mt.000 9.000 Mt. 𝑋7 . 𝑋6 .Norwood .000 Mt. Note also that a fraction of a home cannot be built. Cost of building (\$) Expected Profit (\$) Location Clofton 𝑋1 60.Covington . site preparation. 𝑋3 .000 (a) Formulate Innis’ problem using 0-1 integer programming 𝑋1 .10-16.000 Eden Park 𝑋8 69.000 Norwood 𝑋5 50.000 3.Mt.000 Covington 𝑋6 41. 𝑋2 .000 to invest in all projects.000 5. Auburn 𝑋2 50. 𝑋5 . and differences in the models to be built.Eden Park Maka Innis akan mendapatkan profit sebesar \$37.000 17 300 . Adams 𝑋3 82.000 Roselawn 𝑋7 80. 𝑋8 ≥ 0 (b) Solve with QM for Windows or Excel variable solution maximize profit constraint financial X1 0 X2 1 X3 1 5 6 60 50 X4 0 10 X5 1 X6 1 X7 0 X8 1 12 8 3 9 103 50 41 80 result 10 37 LHS 82 69 RHS 292 ≤ dari hasil perhitungan di atas.t. Note that the home-building costs differ considerably due to lot costs. maka solusi optimalnya adalah dengan mengerjakan proyek di: .000 12. 𝑋4 .000 Amberly 𝑋4 103. Ohio. but he cannot put up homes on all of the sites because he has only \$300. Innis Construction Company specializes in building moderately priced homes in Cincinnati.000 8. 𝑋8 dalam bilangan biner objective function s. Aubum . The accompanying table shows the cost of constructiong homes in each area and the expected profit to be made from the sale of each home.000 10. max profit = 5𝑋1 + 6𝑋2 + 10𝑋3 + 12𝑋4 + 8𝑋5 + 3𝑋6 + 9𝑋7 + 10𝑋8 60𝑋1 + 50𝑋2 + 82𝑋3 + 103𝑋4 + 50𝑋5 + 41𝑋6 + 80𝑋7 + 69𝑋8 ≤ 300 𝑋1 .000 6. 𝑋5 . Tom Innis has identified eight potential locations to construct new single-family dwellings.000 10. Adams . 𝑋2 . 𝑋6 . 𝑋4 . 𝑋7 . 𝑋3 .

𝑋2 . and a mini-warehouse. 𝑋3 ≥ 0 (b) solve using computer software. maka proyek yang akan dikerjakan adalah Apartment dan Shopping Center dengan biaya investasi sebesar: year 1 = \$70. dalam bilangan biner objective function s.10-17.000s): INVESTMENT NPV Apartment Shopping center Mini-warehouse 𝑋1 𝑋2 𝑋3 Year 1 Year 2 40 30 20 30 20 20 18 15 14 The company has \$80.000 year 2 = \$50. (a) develop an integer programming model to maximize the NPV 𝑋1 .000 to invest in year 2. The following table provides the required investment amounts (in \$1. and the NPV of the investments also varies. Each of these requires different funding over the next 2 years. 𝑋2 .000 18 . maximize profit = 18𝑋1 + 15𝑋2 + 14𝑋3 40𝑋1 + 30𝑋2 + 20𝑋3 ≤ 80 30𝑋1 + 20𝑋2 + 20𝑋3 ≤ 50 𝑋1 . a small shopping center. Which of the 3 projects would be undertaken if NPV is maximized? How much money would be used each year? variable solution maximize profit constraint year 1 year 2 X1 1 X2 1 18 X3 0 15 result 14 33 LHS 40 30 30 20 20 20 RHS 70 ≤ 50 ≤ 80 50 Untuk memaksimasi NPV.000 to invest in year 1 and \$50. A real estate developer is considering 3 possible projects: a small apartment complex.000s) and the NPV of each (also expressed in \$1.t. 𝑋3 .

100 3.100 𝑋1 = 1 jika generator 1 dinyalakan pada periode-1.000 for 3. The company has 4 electric generators that are used to provide electricity.700 (8 jam kedua) 19 . 0 jika tidak 𝑋2 = 1 jika generator 2 dinyalakan pada periode-1.10-19.300𝑋4 ≥ 5.200 (8 jam pertama) 2. These generators are used in the following ways: A generator may be started at 6:00 AM and run for either 8 hours or 16 hours.7𝑇3 (menggunakan C dan T untuk menyederhanakan fungsi tujuan) dimana: 𝑇1 = (𝑋1 +𝑋4 ) 𝑇2 = (𝑋2 +𝑋5 ) 𝐶1 = (𝑋1 + 𝑋4 2 -𝑋1 𝑋4 ) 𝐶2 = (𝑋2 + 𝑋5 2 -𝑋2 𝑋5 ) 𝑇3 = (𝑋3 +𝑋6 ) 𝐶3 = (𝑋3 + 𝑋6 2 -𝑋3 𝑋6 ) s.300 6.400𝑋2 + 2. 0 jika tidak 𝑋3 = 1 jika generator 3 dinyalakan pada periode-1.200 megawatts more than provided by the main generator before 2:00 PM.000 for 1. The main generator operates 24 hours per day. with an occasional shutdown for routine maintenance.100 megawatts.100𝑋2 + 3.700 megawatts between 2:00 and 10:00 PM. 0 jika tidak 𝑋4 = 1 jika generator 1 dinyalakan pada periode-2. The cost per megawatt used per 8 hour period is \$8 for 1. and \$7 for 3. The startup costs are \$6.000 5. Forecasts indicate the need for 3.3) are available to provide additional power when needed.000 8 9 7 19.300 megawatts.200 18. Triangle Utilities provides electricity for 3 cities.2.300𝑋3 ≥ 3. (a) Formulate this problem as an integer programming problem to determine the least-cost way to meet the needs of the area Generator 1 Generator 2 Generator 3 𝑋1 𝑋2 𝑋3 Power (megawatts) Startup Cost (\$) Cost per megawatt per 8 hour(\$) Total Cost per 8 hour (\$) 2.2𝑇1 + 18. or it may be started at 2:00 PM and run for 8 hours (until 10:00 PM).t. All generators except the main generator are shut down at 10:00 PM.000 for 2.400 2.900 23. and \$4. A startup cost is incurred each time one of these generators is started. generator 2 may provide up to 2. 0 jika tidak 𝑋5 = 1 jika generator 2 dinyalakan pada periode-2. \$9 for 2. Three other generators (1.400𝑋1 + 2. 2. 0 jika tidak minimize cost = 6𝐶1 + 5𝐶2 + 4𝐶3 + 19. and generator 3 may provide up to 3. 0 jika tidak 𝑋6 = 1 jika generator 3 dinyalakan pada periode-2. \$5. Generator 1 may provide up to 2.9𝑇2 + 21. and this goes up to 5.400 megawatts.100𝑋3 + 3.000 4.

7 2400 2100 3300 constraints watt period 1 watt period 2 result 72.2 T2 0 18. didapatkan solusi optimal berupa: Generator-1 dinyalakan mulai 2:00 PM (selama 8 jam) dan Generator-3 dinyalakan sejak 6:00 AM (selama 16 jam) sehingga total biaya operasionalnya adalah \$72.600 20 .60 LHS 2400 2100 3300 RHS 3300 ≥ 5700 ≥ 3200 5700 Dari hasil perhitungan melalui excel solver pada NLP objective function di atas.(b) Solve using computer software variable values x1 0 x2 0 x3 1 x4 1 x5 0 x6 1 terms calculated values minimize cost C1 1 6 C2 0 5 C3 1 4 T1 1 19.9 T3 2 21.

𝑑𝑖 ≥ 0 Find the optimal solution using a computer asumsi: setiap deviasi memiliki bobot yang sama yang bernilai 1.𝑑3 + = 240 all 𝑋𝑖 . Dari solusi tersebut dapat dilihat bahwa constrain 1 & 2 terpenuhi. 𝑋2 = 0. An Oklahoma manufacturer makes 2 products speaker telephones (𝑋1 ) and pushbutton telephones (𝑋2 ). The following goal programming model has been formulated to find the number of each to produce each day to meet the firm’s goals: Minimize 𝑃1 𝑑1 − + 𝑃2 𝑑2 − + 𝑃3 𝑑3 + + 𝑃4 𝑑1 + subject to 2𝑋1 + 4𝑋2 + 𝑑1 − .𝑑2 + = 320 8𝑋1 + 6𝑋2 + 𝑑3 − . 21 . sedangkan constrain 3 menunjukkan kelebihan nilai sebesar 80. sehingga total deviasi untuk model ini adalah 80. Dari hasil perhitungan pada QM didapat 𝑋1 = 40.𝑑1 + = 80 8𝑋1 + 10𝑋2 + 𝑑2 − .10-24.

Cocoa Beach. Airport. South Orlando. respectively. (a) Where should the 4 new sites be located. Osceola.Cocoa (𝑋10 ) expected return = 655 (b) If at least 1 new branch must be opened in Maitland (𝑿𝟐 ) or Osceola (𝑿𝟑 ). and what will be the expected return? variable solution maximize profit X1 0 X2 0 120 X3 0 100 X4 0 110 X5 1 140 X6 0 155 X7 0 128 X8 1 145 X9 1 190 170 X10 1 result 150 constraint 665 LHS 1 2 3 6 4 5 20 15 1 30 5 1 1 1 1 20 20 25 20 30 5 1 1 1 1 1 1 30 5 1 1 25 10 1 1 20 20 1 1 25 5 1 1 1 30 20 1 1 1 RHS 105 50 2 4 3 1 ≤ ≤ ≤ ≤ ≥ ≥ dari hasil perhitungan di atas. to locate 4 new branch offices: where 𝑋𝑖 represents Winter Park. 4 lokasi yang baru adalah: .South Orlando (𝑋5 ) . out of 10 possible sites. Maitland. Downtown. Lake Mary. The integer programming problem in the box below has been developed to help First National Bank decide where. Winter Garden. Apopka.10-32.Apopka (𝑋8 ) . tambahan constraint adalah X2 + X3 ≥ 1 22 110 50 3 4 2 1 . for i equals 1 to 10. will this change the answers? Add the new constraint and re-run dengan kondisi seperti soal (b).Lake Mary (𝑋9 ) .

maka perubahan lokasi adalah sebagai berikut: . Using the original assumptions (namely.Apopka (𝑋8 ) . mengubah tidak solusi optimal sebelumnya. does your answer to part (a) change? variable solution maximize profit constraint a b c d e f X1 0 X2 0 120 X3 0 100 X4 0 110 X5 1 140 X6 0 155 X7 0 128 X8 1 145 X9 1 160 170 X10 1 result 150 635 LHS 20 15 1 1 30 5 1 1 1 20 20 25 20 30 5 1 1 1 1 1 1 30 5 1 1 25 10 1 1 20 20 1 1 25 5 1 1 1 30 20 1 1 1 RHS 105 50 2 4 3 1 ? ? ? ? ? ? dari perubahan koefisien pada 𝑋8 dari 190 menjadi 160.variable solution maximize profit constraint a b c d e f g X1 0 X2 0 120 X3 1 100 X4 0 110 X5 1 140 X6 0 155 X7 0 128 X8 1 145 X9 1 190 170 X10 0 result 150 625 LHS 20 15 30 5 1 1 1 1 1 1 20 20 25 20 30 5 1 1 1 1 1 1 1 30 5 1 1 25 10 1 1 20 20 1 1 25 5 1 1 1 30 20 1 1 RHS 95 50 1 4 4 1 1 1 ≤ ≤ ≤ ≤ ≥ ≥ ≥ 110 50 3 4 2 1 1 dengan tambahan batasan di atas.Osceola (𝑋3 ) . hanya besarnya expected return yang berubah menjadi 635 23 110 50 3 4 2 1 . ignoring (b)).South Orlando (𝑋5 ) . The correct value is \$160. 160).000 per year (that is.Lake Mary (𝑋9 ) expected return = 625 (c) The expected return at Apopka was overestimated.