1. Asmallengineeringconsultingfirmisestabilishingitsplanforthenextyear.

Thedirectorand
thethreepartnersaretomeettodecidewhichprojecttopursue.Preliminaryresearchhas
beendoneoneightproject.Theexpectedprofitforeachprojectisgiveninthefollowingtable,
togetherwiththenumberofpersondaysofbackgroundpreparationeachwillrequireandthe
computerprocessingunit(CPU)time(inhours)eachwilluse.

Project
Keutungan
PersonDays
CPU
1
2.1
550
200
2
0.5
400
150
3
3.0
300
400
4
2.0
350
450
5
1.0
450
300
6
1.5
500
150
7
0.6
350
200
8
1.8
200
600

Exludingdowntime,itisestimatedthat1000CPUhourswillbeavailablethroughtheyear.
Presentlythereare10engineers(includingthedirectorandthepartner);eachworks240days
peryear.Atmostthreeengineerscouldbeletgo,andmanagementdoesnotwanttohire
anynewengineerfornextyear,duetomarketuncertainties.Aminimumofthreeprojects
needtobeselected,soeachpartnerwillbeinchargeofatleastoneprojectfortheyear.The
directorhasfourfavoriteprojects(3,4,5,and8),andthecompanyneedstoselectatleast
one of these. Formulate and solve an optimization model to determine which project to
undertake,assumingthatprojectmustbeselectedonanallornothingbasis.Jawaban.Nilai
obyektif=7.2

Jawab:
Xi=bilanganbinerbernilai1apabilaproyek(i)diambildanberniali0apabilaproyek(i)
tidakdiambil
i=1,2,3,4,5,6,7,8.

Model:
max=2.1*x1+0.5*x2+3*x3+2*x4+1*x5+1.5*x6+0.6*x7+1.8*x8;
Batasan Pengujian:
550*x1+400*x2*+300*x3+350*x4+450*x5+500*x6+350*x7+200*x8<=7*240;
200*x1+150*x2+400*x3+450*x4+300*x5+150*x6+200*x7+600*x8<=1000;
x1+x2+x3+x4+x5+x6+x7+x8>=3;
x3+x4+x5+x8>=1;
@bin(x1);
@bin(x2);
@bin(x3);
@bin(x4);
@bin(x5);
@bin(x6);
@bin(x7);
@bin(x8);

Hasil Pengujian dengan LINGO:

Linearization components added:
Constraints:
4
Variables:
1
Integers:
1
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

Variable
X1
X2
X3
X4
X5
X6
X7
X8
Row
1
2
3
4
5

7.200000
7.200000
0.000000
0
0

Value
1.000000
0.000000
1.000000
0.000000
0.000000
1.000000
1.000000
0.000000
Slack or Surplus
7.200000
50.00000
280.0000
1.000000
0.000000

Reduced Cost
-2.100000
-0.5000000
-3.000000
-2.000000
-1.000000
-1.500000
-0.6000000
-1.800000
Dual Price
1.000000
0.000000
0.000000
0.000000
0.000000

2. Theforestservicecanbuildafirewatchtoweronanyof8mountains.Usingdecisionvariable
Xj=1iftowerisbuiltonmountainjand=0otherwise,writeconstraint(s)enforcingeachof
thefollowingrequirements.
a. Inall3siteswillbeselected.
b. Atleast2ofthefirst5mountaintsmustbeselected.
c. Atowershouldnotbebuiltonbothmountains3and8.
d. Atowercanbebuiltonmountain4onlyifoneisbuiltonmountain1.

Jawab:
a.
b.
c.
d.

x1+x2+x3+x4+x5+x6+x7+x8=3;
x1+x2+x3+x4+x5>=2;
x3+x8=0;
X1-X4=0;

3. Professorproofistryingtodecidewhichof6neededteachingassistanttaskshewillassignto
eachofhis2graduateassistants.Naturally,oneassistantwouldbeprobablybebetteratsome
tasksandtheotherassistantbetteratothers.Thefollowingtableshownhisscoringoftheir
potentials (high is good). Professor proof wants to assign three tasks to each assistant.
However,task5and6arerelatedandshouldbeassignedtothesameassistant.

Assistant
Task
1
2
3
4
5
6
0
100
85
40
45
70
82
1
80
70
90
85
80
65

Formulate and solve an optimization model to maximize the potential of the assignment
chosen.
Jawaban.NilaiObyektif=497.

Jawab:

Model:
MAX=100*x01+85*x02+40*x03+45*x04+70*x05+82*x06+80*x11+70*x12+90*x13+8
5*x14+80*x15+65*x16;
Batasan Pengujian:
x01+x02+x03+x04+x05+x06=3;
x11+x12+x13+x14+x15+x16=3;
x01+x11=1;
x02+x12=1;
x03+x13=1;
x04+x14=1;
x05+x15=1;
x05=x06;
@bin(x01);
@bin(x02);
@bin(x03);
@bin(x04);
@bin(x05);
@bin(x06);
@bin(x11);
@bin(x12);
@bin(x13);
@bin(x14);
@bin(x15);
@bin(x16);

Hasil Pengujian dengan LINGO:

Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:
Model Class:

497.0000
497.0000
0.000000
0
0
PILP

Total variables:
Nonlinear variables:
Integer variables:
Total constraints:
Nonlinear constraints:
Total nonzeros:
Nonlinear nonzeros:

12
0
12
9
0
36
0

Variable

Value

Reduced

Cost
X01
X02
X03
X04
X05
X06
X11
X12
X13
X14
X15
X16
Row

1.000000
0.000000
0.000000
0.000000
1.000000
1.000000
0.000000
1.000000
1.000000
1.000000
0.000000
0.000000
Slack or Surplus

-100.000
-85.0000
-40.0000
-45.0000
-70.0000
-82.00000
-80.0000
-70.0000
-90.0000
-85.0000
-80.0000
-65.00000
Dual

Price
1
2
3
4
5
6
7
8
9

497.0000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000

1.00000
0.000000
0.00000
0.00000
0.00000
0.00000
0.00000
0.00000
0.000000

4. Toimprovetaxcompliancethetexascomptrollers staffregularlyauditatcorporatehome
officestherecordsofoutofstatecorporationsdoingbusinessinTexas.Texasinconsidering
theopeningofaseriesofsmallofficesnearthesecorporatelocationstoreducethetravel
costsnowassociatedwithsuchoutofstateaudits.Thefollowingtableshowsthefixedcost
(inthousandofdollars)ofoperatingsuchofficesatsitesi,thenumberofauditsrequiredin
eachstatefromabaseatanyoftheproposedofficesites.

Tax
Fixed
CosttoAuditofCorporateLocation:
Site
Cost
1
2
3
4
5
1
160
0
0.4
0.8
0.4
0.8
2
49
0.7
0
0.8
0.4
0.4
3
246
0.6
0.4
0
0.5
0.4
4
86
0.6
0.4
0.9
0
0.4
5
100
0.9
0.4
0.7
0.4
0
Audits

200
100
300
100
200

Formulateandsolveanoptimizationmodeltominimizecostofauditingplan.
Jawaban.NilaiObyektif=535.

Jawab:
Model:
min=(0*x11+0.4*x12+0.8*x13+0.4*x14+0.8*x15)+(0.7*x21+0*x22+0.8*x23+0.
4*x24+0.4*x25)+(0.6*x31+0.4*x32+0*x33+0.5*x34+0.4*x35)+(0.6*x41+0.4*x
42+0.9*x43+0*x44+0.4*x45)+(0.9*x51+0.4*x52+0.7*x53+0.4*x54+0*x55)+(16
0*s1+49*s2+246*s3+86*s4+100*s5);
Batasan Pengujian:
x11+x21+x31+x41+x51>200;
x12+x22+x32+x42+x52>100;
x13+x23+x33+x43+x53>300;
x14+x24+x34+x44+x54>100;
x15+x25+x35+x45+x55>200;
x11+x12+x13+x14+x15-1000*s1<0;
x21+x22+x23+x24+x25-1000*s2<0;
x31+x32+x33+x34+x35-1000*s3<0;
x41+x42+x43+x44+x45-1000*s4<0;
x51+x52+x53+x54+x55-1000*s5<0;

@gin(x11);
@gin(x12);
@gin(x13);
@gin(x14);
@gin(x15);
@gin(x21);
@gin(x22);
@gin(x23);
@gin(x24);
@gin(x25);
@gin(x31);
@gin(x32);
@gin(x33);
@gin(x34);
@gin(x35);
@gin(x41);
@gin(x42);
@gin(x43);
@gin(x44);
@gin(x45);
@gin(x51);
@gin(x52);
@gin(x53);
@gin(x54);
@gin(x55);
@bin(s1);
@bin(s2);
@bin(s3);
@bin(s4);
@bin(s5);

Hasil Pengujian dengan LINGO:

Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

Variable
X11
X12
X13
X14
X15
X21
X22
X23
X24
X25
X31
X32
X33
X34
X35
X41
X42
X43
X44
X45
X51
X52
X53
X54
X55
S1
S2
S3
S4
S5
Row
1
2
3
4
5
6
7
8
9
10
11

535.0000
535.0000
0.000000
0
128

Value
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
100.0000
0.000000
100.0000
0.000000
200.0000
0.000000
300.0000
0.000000
200.0000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
1.000000
1.000000
0.000000
0.000000
Slack or Surplus
535.0000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
800.0000
300.0000
0.000000
0.000000

Reduced Cost
0.000000
0.4000000
0.8000000
0.4000000
0.8000000
0.7000000
0.000000
0.8000000
0.4000000
0.4000000
0.6000000
0.4000000
0.000000
0.5000000
0.4000000
0.6000000
0.4000000
0.9000000
0.000000
0.4000000
0.9000000
0.4000000
0.7000000
0.4000000
0.000000
160.0000
49.00000
246.0000
86.00000
100.0000
Dual Price
-1.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000

5. The state department of labor is considering the establishment of the area job training
centersatupto4sites.Thefollowingtableshowsthelandcost(inthousandofdollars)ofthe
4sitesandindicateswithanxthesitesthatcouldprovideadequateservicetoeachofthe
fiveregionsofthestate.

Region
Site
1
2
3
4
Nortwest
x
x

Soutwest
x
x
x

Capital
x

x
X
Northeast
x
x

Southeast
x

x
Cost
200
40
55
75

Formulateandsolveanoptimizationmodeltodetermineaminimumtotalcostcollectionsof
sitesthattogethercouldserviceallfiveregions.Jawaban.Nilaiobyektif=115.

Jawab:

Model:
min=200*x1+40*x2+55*x3+75*x4;
Batasan Pengujian:
x1+x2>=1;
x1+x2+x3>=1;
x1+x3+x4>=1;
x1+x2>=1;
x1+x4>=1;
@bin(x1);
@bin(x2);
@bin(x3);
@bin(x4);
Hasil Pengujian dengan LINGO:
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

Variable
X1
X2
X3
X4
Row
1
2
3

115.0000
115.0000
0.000000
0
0

Value
0.000000
1.000000
0.000000
1.000000
Slack or Surplus
115.0000
0.000000
0.000000

Reduced Cost
200.0000
40.00000
55.00000
75.00000
Dual Price
-1.000000
0.000000
0.000000

4
5
6

0.000000
0.000000
0.000000

0.000000
0.000000
0.000000

6. Paper can be made from new wood pulp, from recycled office paper, or from recycled
newsprint. New pulp cost $100 per ton, recycled office paper, $50 per ton, and recycled
newsprint,$20perton.Oneavailableprocessuses3tonsofpulptomake1tonofpaper;a
seconduses1tonofpulpand4tonsofrecycledofficepaper;athirduses1tonofpulpand
12tonsofrecyclednewsprint,afourthuses8tonsofrecycledofficepaper.Atthemoment
only80tonsofpulpisavailable.Wewishtoproduce100tonsofnewpaperatminimumtotal
cost.Formulateandsolveanoptimizationmodelforthisproblem.Jawaban.Nilaiobyektif=
32.000.

Jawab:

7.

PM Computer Services produces personal computers from component parts it buys on the
open market. The company can produce a maximum of 300 personal computers per month.
PM wants to determine its production schedule for the first 6 months of the new year. The
cost to produce a personal computer in January will be $1,200. However, PM knows the
cost of component parts will decline each month so that the overall cost to produce a PC
will be 5% less each month. The cost of holding a computer in inventory is $15 per unit
per month. Following is the demand for
the companys computers each month:

Determine a production schedule for PM that will minimize total cost.

8. Orient Express is a global distribution company that transports its clients products to
customers in Hong Kong, Singapore, and Taipei. All of the products Orient Express ships
are stored at three distribution centers, one in Los Angeles, one in Savannah, and one in
Galveston. For the coming month the company has 450 containers of computer components
available at the Los Angeles center, 600 containers available at Savannah, and 350
containers available in Galveston. The company has orders for 600 containers from Hong
Kong, 500 containers from Singapore, and 500 containers from Taipei. The shipping costs
per container from each U.S. port to each of the overseas ports are shown in the following
table.

The Orient Express as the overseas broker for its U.S. customers is responsible for unfulfilled
orders, and it incurs stiff penalty costs from overseas customers if it does not meet an order.
The Hong Kong customers charge a penalty cost of $800 per container for unfulfilled demand,
Singapore customers charge a penalty cost of $920 per container, and Taipei customers charge