Sunteți pe pagina 1din 1

3 A manufacturer can sell product I at a profit of$?

unit
2 Because of excessive pollution on the Momiss River,
the state of Momiss is going to build some pollution conEol *a p-a*i i ", a profi t of $5fu nit' lhree units oJ rawmaterial
un;ts
;;;J; to manufacture I unit of product.l' and 6
stations. Three sites (L,2, and 3) are under consideration. l unitof product2'
Momiss is interested in controlling the pollution levels of ;4.;;;;,;rl are need to manufacture
' two pollutants (1 and 2). The state legislaturc requires that a i"t^r .i izO units of raw material are available' { *y q!
oJu"t I is produced, a setup cost of $10 is incurrri' and if
at least 80,000 tons ofpollutant I and at teast 50,000 tons incuned'
of pollutant 2 be removed from the river. The relevant data il;;f ilil; it piau""a, u setuP cost of $20 is

for this probtem are shown in Table 10. Formulate an IP to Fo'rmuiate an IP to maximirc Profis'
minimirc the cost of meeting the state legislature's goals.
l2 A companf is consiciering opening warehouses in four I4t The manager of State University'sDED-computer
wants to be able to access flve
different files'-These files
cities: New York. Los Angeles, Chicago, and Atlanta- Each
warehouse can ship 100 units per week. The weekly fixed cost ;;;;; ;
ten disks as shown in Table 13' The'amount
disk 1' 3K;
ofkeeping each n'arehouse open is $400forNew York' $500 ;it;;;t" required bv each riisk is as followl
for Los AngeleS. $300 for Chicago, and 5150 for Atlanta. ;i'il;, ;K ;i;k 3, ri<; aist 4, 2K; disk10'5'Jf; 2K'
disk 6' 4K;

Region I of the country re4uires 80 units per week, region 2 ii.r. i, in


Ji.t 8, lK; disk e' 2K disk
a set of disks re-
requires 70 units per week, and region 3 requkes 40 units per cFormulate an IP that determines
of such that each
week. The costs (including production and shipping costs) ;rktd,lt; minimum amount storage
of sending one unit from a plant to a region are shown in least one of the disks' For a given dish we
dt" ir-oo at
Table ll. We.u'ant to meet weekly demands at minimum store none of the disk;
musteither store the entire disk or
cost, subject to the preceding information and the following we cailrot store part of a disk'
restrictions: so that if disk 3 or disk 5
b Vtoaify your formulation
1 If the Neu' York warehouse is opened, then the Los it osed, then disk 2 must also be
used'
Angeles warehouse must be oPened. types of computers: Pear
I5 Fruit Computer produces twoRlievant data ar-e given in
2 At most trvo warehouses can be opened- comDuters and Apricot computers'
l2oo hours orlabor are
3 Either the Atlanta or the Los Angeles warehouse ;;ii: to:;;;t"i'"i:looo chips and
Fruit maximize profits'
must b oPened. i..*tlate an lP to^help
"r"if"Uf. will containbothhornes
Formulate an IP that can be used to minimize the weekly l6 The Lotus Point Condo Project
up- to 10'000
costs of meeting demand. aid rt'" tlt"-"*
Jccommodate
project:
";*mJnir.
dwelling uniu. Ttre prolect must contain a recreation
compiex or a-sailboat marina" but
either a swimming+ennii
l7 A product can be produced on four different machines' lr rnina is-tuilt"the number of homes
in the
Each machine has a fixed setup cost, variable production "*'ta. "be at least triple &e number of apartments rn
costs per-unit-processed, and a production capacity given, ii..i:"J, iirii
in Table 15. A total of 2000 units of the product must be
produced. Fomrulate an IP whose solution will tell us how to
minimize total costs.
i ABL t t3
l8 Use LINDO, LINGO, or What's Best to find the optimal Disk

solution to the following IP:


Bookco Pubiishers is considering publishing five text-
books. The maximum number of copies of each textbook File 1 xx xx xx
that can be sold, the variable cost of producing each text- File2 XX
book, the sales price of each textboolq and the fixed cost File 3 x x
of a production run for each book are given in Table 16' File 4 x x
Thus^for example, producing 2000 copies ofbook I brings x x
File 5
in a revenue of zOOotsO) : $100,000 but costs 80'000 +
25(2000) : $130,000. Bookco can produce at most 10,000
books if it wants to maximize profit.
19 Comquat owns four production plants at which per-
I ABL I 14

sonal computers are produced' Comquat can seli up to 20'000 EquiPmenl Selling

computerJ per year at a price of $3500 per computer' For each labor ftiP: Cosls Prite
plant the production capacity, the production cost per com-
puter, and the fixed cost of operating a plant for a year ure Pear hour I Z $5000 $400
given in Table 17. Determine how Comquat can ma'ximize $?000
Apricot 2 hours 5 $900
its yearty profit from computer production.

12Consider the followilg puzzle. you are to pick out 4 9.2 formuloling lnteger Progromming Problems 507

ihree-letter "words" from the following list

DBA DEG ADI TtrD GHI BCD FDF BAI willcost $l'2 million, and a swimming-
the oroiect. A marina
i"n,iit will cost $2'8 million' The deve lopers believe
For each word you earr a scoie equal to the position that apartment will yield revenues with.an {PV of
it"i "n*pf"*
the word s third letrer appears in the alphabet. For example, "*ft
i48,000, and each home will yield
revenues with^an NPV of
to build'
DBA eams a score of l, DEG eams a score of 7, and so on. ffi:000: Each home (or apartmen$ costs $40'000protrts'
Your goal is to choose the four words that maximize your Formulate an IP to help Lotus Point maxlmze
toal score, subject to the following constraint: The sum of
the pcsitions in the alphabet for the first letter of each word jobs ue
23 At a machine tool plant five Lus1 lSlOteted
job depends on the
chosen musi be at least as large as the $um of the positions
llt f;i. *.-ii*. it i" a" Jach
'"ri"t u *ott"n" it used'at all' there
machine used to ao tr:r" loo tf
in the alphabet for the second letter of each word chosen.
times (in minutes)
Formulate an IP to solve this problem. is a setup dme required''fil" i"rt'*t goat is rominimize
siven in Table 20' Th" ;;*;any"s
^r"
inl i,",'
"i
;;1*':'#l"yL:':f,1:i;1tr"ffi t1
to comPlete""all jobs' Fol solution witt do this'
LINGO, or $/hat's s"'tl #P**i'oie

S-ar putea să vă placă și