Quis RO:

1. Ampco is a manufacturing company that has a contract to supply a customer with parts from
April through September. However, Ampco does not have enough storage space to store the
parts during this period, so it needs to lease extra warehouse space during the 6-month period.
Following are Ampcos space requirements:

The rental agent Ampco is dealing with has provided it with the following cost schedule for
warehouse space. This schedule shows that the longer the space is rented, the cheaper it is. For
example, if Ampco rents space for all 6 months, it costs $1.00 per square foot per month,
whereas if it rents the same space for only 1 month, it costs $1.70 per square foot per month:

Ampco can rent any amount of warehouse space on a monthly basis at any time for any number
of (whole) months. Ampco wants to determine the least costly rental agreement that will exactly
meet its space needs each month and avoid having any unused space.
a. Formulate a linear programming model for this problem.
b. Solve the model by using the computer.
c. Suppose that Ampco relaxed its restriction that it rent exactly the space it needs every month
such that it would rent excess space if it was cheaper. How would this affect the optimal
solution?
Jawab:
(a) Formulasi linier programing:
min. Z = 1.7x11+ 1.4x12+ 1.2x13+ 1.1x14+ 1.05x15+1.0x16+1.7x21+ 1.4x22+ 1.2x23+ 1.1x24+
1.05x25+ 1.7x31+ 1.4x32+1.2x33+1.1x34+ 1.7x41+ 1.4x42+ 1.2x43+ 1.7x51+ 1.4x52+
1.7x61
S.t:

x11+x12+ x13+ x14+ x15+ x16= 47.000 x12+ x13+ x14+ x15+x16+x21+x22+ x23+
x24+ x25= 35.000,
x13+ x14+ x15+ x16+x22+x23+x24+x25+x31+x32+x33+x34= 52.000,
x14+ x15+ x16+ x23+x24+x25+x32+x33+x34+x1+x42+x43= 27,000,
x15+ x16+ x24+x25+x33+x34+x42+x43+x51+x52= 19,000,
x16+ x25+ x34+ x43+x52+x61=15,000;

(b) x11= 12,000, x13= 25,000, x14= 8,000, x15= 2,000,x33= 2,000, x34= 15,000, Z = $80,200;

(c) x16= 52,000,Z = $52,

2. Brooks City has three consolidated high schools, each with a capacity of 1,200 students. The
school board has partitioned the city into five busing districtsnorth, south, east, west, and
centraleach with different high school student populations. The three schools are located in
the central, west, and south districts. Some students must be bused outside their districts, and
the school board wants to minimize the total bus distance traveled by these students. The
average distances from each district to the three schools and the total student population in each
district are as follows:

The school board wants to determine the number of students to bus from each district to each
school to minimize the total busing miles traveled.
a. Formulate a linear programming model for this problem.
b. Solve the model by using the computer.
Jawab:

Distance(Miles)
Central

West

South

District

H.S.

H.S.

H.S.

North

8(x1)

11(x2)

14(x3)

Student
Population
700

South

12(x4)

9(x5)

0(x6)

300

East

9(x7)

16(x8)

10(x9)

900

West

8(x10)

0(x11)

9(x12)

600

Central

0(x13)

8(x14)

12(x15)

500

(a)Formulatealinearprogrammingmodelforthisproblem.
Answer:Letx1=the#ofbusedstudentsonroute1,x2=the#ofbusedstudentsonroute2,x3
=the#ofbusedstudentsonroute3,,x15=the#ofstudentsbusedonroute15.
Minimizethetotal#ofmilestravelledbutalsodeterminethenumberofstudentsbeingbused
oneachrouteandtowhichHighSchool.Weultimatelywantonlyonebusroutefromeach
districttoitsclosesthighschool,maybealsotothenextclosestHighSchoolifnecessary.Wewill
haveunusualunitsofstudentmiles.
Therefore,wecalculate(Routelength)*(#ofstudentsonRoute)

Thestudentmilescanbeusedtocountthenumberofstudentsandtheaveragenumberofmilesthe
studentsarebusedbuttheZvaluewillneedtobedividedbytheappropriateunit(studentsormiles)or
reconciledwiththegiveninformation.

Z=(Route#1miles)*(x1)+(Route#2miles)*(x2)++(Route#14miles)*(Z=x14)+(Route#15
miles)*(x15)
Z=8x1+11x2+14x3+12x4+9x5+0x6+9x7+16x8+10x9+8x10+0x11+9x12+0x13+8x14+12x15
(Constraint1) x1+x4+x7+x10+x131,200

[#ofstudentsonRoutestoCentralH.S.]Capacity

(Constraint2) x2+x5+x8+x11+x141,200

[#ofstudentsonRoutestoWestH.S.]Capacity

(Constraint3) x3+x6+x9+x12+x15 1,200

[#ofstudentsonRoutestoSouthH.S.]Capacity

(Constraint4) x1+x2+x3=700

[#ofstudents&RoutesdepartingNorthDistrict]

(Constraint5) x4+x5+x6=300

[#ofstudents&RoutesdepartingSouthDistrict]

(Constraint6) x7+x8+x9=900

[#ofstudents&RoutesdepartingEastDistrict]

(Constraint7) x10+x11+x12=600

[#ofstudents&RoutesdepartingWestDistrict]

(Constraint8) x13+x14+x15=500

[#ofstudents&RoutesdepartingCentralDistrict]

(Constraint9) (x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15)0 [nonnegativity]

(b)Solvethemodelbyusingthecomputer.
Answer:MinimumStudentMilesZ=14,600;thesumofalldistricts=3,000students.SeeFigure1

North
(700)

700

X1(8mi.)
X2(11mi.)
X3(14mi.)

CentralH.S.

South

(300)

X5(9mi.)
X6(0mi.)

East
(900)

West
(600)

Central
(500)

(700+500)

X4(12mi.)

300

X7(9mi.)
X8(16mi.)

WestH.S.

X9(10mi.)

900

X10(8mi.)

600

(600)

X11(0mi.)
X12(9mi.) 500
X13(0mi.)

SouthH.S.

X14(8mi.)

(300+900)

X15(12mi.)

Figure1Problem24TotalNumberofStudents=3,000Z=14,600
x1=700,x6=300,x9=900,x11=600,x13=500,and(x2,x3,x4,x5,x7,x8,x10,x12,x14,x15)=0(studentsper
route)