Linear Programming

Problem Solving Exercise

XII Science 4 Ramadhani Etika Wulandari (29) Rana Hanifah Harsari (30) Rony Iskandar (31) Rossita Putri Andanni (32) Susanti Su i Rahayu (33) Wildan Ra!hmandika (3")

1# A small business enterprise makes dresses and trousers. To make a dress requires hour of cutting and 20 minutes of stitching. To make a trousers requires 15 minutes of cutting and hour of stitching. The profit on a dress is R40 and on a pair of trousers R50. The business operates for a ma imum of ! hours per da". #etermine ho$ man" dresses and trousers should be made to ma imi%e profit and $hat the ma imum profit is. http&''$$$.durban.go(.%a'#ocuments')it"*+o(ernment',aths*-cience*Technolog"*.rogram me'mathematics/ne$sletter.pdf Solution : Step 1 : To sol(e the abo(e problem $e $ould ha(e to translate the conditions or constraints from a (erbal to a s"mbolic form. 0e first introduce our (ariables. 1et be the number of dresses and " the number of trousers. Step 2 : 2e t $e e press the constraints as a s"stem of inequalities .

0and "

03

and " being $hole numbers ie.

3 " 4 20

)utting Time&

1 1 x+ y ! ie. 2 + y 52 2 4 1 1 x+ y ! ie. 2 + 5" 4! 5 2

-titching Time&

Step 3 : +raph the s"stem of inequalities and shade in the region that satisf" the constraints. The shaded region is called the feasible region.

Step 4: 0rite the profit in terms of the (ariables. . 6 40 7 50"

-ince the ob8ecti(e 9in this case: is to make a ma imum profit3 the profit equation is called the objective function. Step 5: To determine the ma imum profit and the number of items that $ill gi(e the ma imum profit $e can use one of t$o methods & 5.1 -ubstitute each of the ordered pairs of the (ertices of the feasible region3 e cluding 90;0: 3 ie. 90;1<: 3 91<;0: and 912;!: into profit equation .

9i: . 6 4090: 7 5091<: 6 0 7 !00 6 !00

9ii: . 6 4091<: 7 5090: 6 <40 7 0 6 <40 6 12 and " 6 ! .

9iii: . 6 40912: 7 509!: 6 4!0 7 400 6 !!0

The ma imum profit is R880,00 for

2# A farmer has !0 hectares of his farm a(ailable for planting mai%e and cabbages. =e must gro$ at least 10 hectares of mai%e and 20 hectares of cabbages to meet demands. =e prefers to plant more cabbages than mai%e but his $ork force and equipment $ill onl" allo$ him to culti(ate a ma imum of three times the quantit" of cabbages to that of mai%e. >f the profit on mai%e is R!00 per ha and on cabbages R500 per ha3 ho$ should the farmer plant the t$o crops to make a ma imum profit and $hat is this profit http&''$$$.durban.go(.%a'#ocuments')it"*+o(ernment',aths*-cience*Technolog"*.rogram me'mathematics/ne$sletter.pdf Solution: 1et be the number of hectares of mai%e and " the number of hectares of cabbages. 7 " ? !0 @10 3 " @ 20 "?5

P =!00 + 500"

y=

!00 P x+ 500 500

#ra$ a search line $ith a gradient of

!0 50 . The highest point in the feasible region

through $hich the search line passes is the point 9<0;20: .

The ma imum profit is . 6 !009<0: 7 500920: 6 4!000 7 10000 6 5!000 Rands 3# A factor" makes t$o t"pes of beds3 t"pe A and t"pe A. Bach month are produced.The follo$ing constraints control monthl" production&
(i) (ii) (iii)

of t"pe A and " of t"pe A

2ot more than 50 beds of t"pe A and 40 beds of t"pe A can be made To sho$ a profit at least <0 beds in all must be made. The ma imum number of beds that can be produced is !0. The diagram sho$s the four constraints. 0rite do$n in terms of inequalities that represent these constraints and " the

The question& 3#1# 3#2# 3#3#

)op" the gi(en diagram into "our ans$er book and shade the feasible region. >f the ob8ecti(e function is gi(en b" the equation y =2 + P 150 $here . is the

monthl" profit in rands3 $hat is the profit per bed of the t$o t"pes of bed.. 3#"# 3#$# =o$ man" of each t"pe of bed must be produced per month to ma imise profitC 0hat is the ma imum profitC B plain ho$ the production $ould be affected if the ob8ecti(e function $as y = x + P 150

http&''$$$.durban.go(.%a'#ocuments')it"*+o(ernment',aths*-cience*Technolog"*.rogr amme'mathematics/ne$sletter.pdf Solution: 5.1. 0 ? x ? 50 3 0 ? y ? 40

7 " @ <0 3

7 " ? !0

5.2.

5.5. . 6 500 7 150" .rofit on t"pe A is R500 and on t"pe A is R150 5.4. #ra$ a search line $ith gradient /2 . The highest point in the feasible region through $hich the search line passes is 950&50:. 50 of t"pe A and 50 of t"pe A must be produced to ma imise profit. The ma imum profit is . 6 500950: 7 150950: 6 1D500 Rands 5.5. -ince the gradient of this ob8ecti(e function is /13 the upper limit of the search line $ill coincide $ith the line ma imum profit. "# The =olida" ,eal Turke" Ranch is considering bu"ing t$o different brands of turke" feed and blending them to pro(ide a good3 lo$/cost diet for its turke"s. Bach brand of feed contains3 in (ar"ing proportions3 some or all of the three nutritional ingredients essential for fattening turke"s. Bach kilogram of brand 1 contains 5 grams of ingredient A3 4 grams of ingredient A and 035 grams of ingredient ). Bach kilogram of brand 2 contains 10 grams of ingredient A3 5 grams of ingredient A3 but nothing of ingredient ). The brand 1 feed costs the Ranch 20c a kilogram3 $hile the brand 2 feed costs 50c a kilogram. The minimum monthl" requirement per turke" is& D0 grams of ingredient A; 4! grams of ingredient A and 135 grams of ingredient ). Eormulate an 1. model to help the rancher decide ho$ to mi the t$o brands of turke" feed so that the minimum monthl" intake requirement for each nutritional ingredient is met at minimum cost. Fse the graphical approach to sol(e this model. http&''pages.intnet.mu'cuebo"'education'notes'precalculus'linproge ample.pdf 7 " 6 !0 . >n this case all the ordered pairs 9 and " being $hole numbers: satisf"ing the line $ithin the feasible region $ill gi(e the same

Solution: =olida" ,eal Turke" Ranch data&

1et ONE 6 number of kg of brand 1 feed purchased monthl"3 and TWO 6 number of kg of brand 2 feed purchased monthl". ,inimise COST 6 20ONE 7 50TWO sub8ect to 5ONE 7 10TWO @ D0 9>ngredient A: 4ONE 7 5TWO @ 4! 9>ngredient A: 035ONE ONE3 TWO @ 135 9>ngredient ): @ 0

+raphical solution&

The isocost lines enter the feasible area at G3 i.e. the point 9!34; 43!:. To find the e act coordinates of this point3 sol(e the equations representing the constraints intercepting in this point simultaneousl". The optimal solution& The rancher must bu" !34 kg of the brand 1 feed and 43! kg of the brand 2 feed monthl" for a minimum cost of R5312 per turke". $# +iapettoHs 0oodcar(ing3 >nc.3 manufactures t$o t"pes of $ooden to"s; soldiers and trains. A soldier sells for R2I and uses R10 $orth of ra$ materials. Bach soldier that is manufactured increases +iapettoHs labour and o(erhead costs b" R14. A train sells for R21 and uses RD $orth of ra$ materials. Bach train built increases +iapettoHs labour and o(erhead costs b" R10. A train requires one hour of carpentr" and one hour of finishing. A soldier requires t$o hours of finishing and one hour of carpentr". Jnl" 100 finishing hours and !0 carpentr" hours are a(ailable each $eek. #emand for trains is unlimited3 but at most 40 soldiers are bought each $eek. +iapetto $ishes to ma imise $eekl" profits. Fse the graphical approach to find the optimal solution. http&''pages.intnet.mu'cuebo"'education'notes'precalculus'linproge ample.pdf Solution: 1et SOLDIER 6 number of soldiers produced each $eek3 and TRAIN 6 number of trains produced each $eek Total $eekl" re(enue 6 re(enue from soldiers 7 re(enue from trains 6 2ISOLDIER 7 21TRAIN. 0eekl" ra$ material costs 6 10SOLDIER 7 DTRAIN. Jther $eekl" (ariable costs 6 14SOLDIER 7 10TRAIN. Total $eekl" costs 6 24SOLDIER 7 1DTRAIN. +iapetto $ishes to ma imise profit3 $ith PROFIT 6 92ISOLDIER 7 21TRAIN: 924SOLDIER 7 1DTRAIN: 6 5SOLDIER 7 2TRAIN. The 1. model is& ,a imise PROFIT 6 5SOLDIER 7 2TRAIN sub8ect to 2SOLDIER 7 TRAIN ? 100 9Einishing: SOLDIER 7 TRAIN ? !0 -J1#>BR ? 40 9)arpentr": 9#emand:

-J1#>BR3 TRA>2 @ 0

The optimal solution is at point G3 that is the point 920; <0:. The optimal solution is to produce 20 soldiers and <0 trains per $eek to make the ma imum profit of R1!0. %# The A)B ,anufacturing )ompan" produces t$o lines of its product3 the K-uperL and theKRegularL. Resource requirements for production are as follo$s&

There are 1<0 hours of assembl" time and !0 hours of paint time a(ailable per $eek. The inspection on each product is done b" a team of qualit" controllers $ho $ork 40 hours per $eek. Erom past data A)BHs management kno$s that the demand for their products al$a"s e ceeds the production3 but the" also kno$ that the" usuall" sell at least double as man" KRegularL as K-uperL products. Eormulate as an 1. model and use the graphical approach to sol(e it. http&''pages.intnet.mu'cuebo"'education'notes'precalculus'linproge ample.pdf Solution: 1et SUP 6 number of units of the K-uperL product to be manufactured3 and REG 6 number of units of the KRegularL product to be manufactured.

,a imise PROFIT 6 50REG 7 I5SUP sub8ect to RB+ 7 03!-F. 0,4REG +0,5SUP 032RB+ 7 034-F. RB+ 3 -F. ? 1<0 91. Assembl": ? !0 ? 40 @ 0 92. .aint: 95. >nspection: 94.#emand:

RB+ M 230-F. @ 0

)onsider the demand constraint& >f A)B kno$s that the" usuall" sell at least double as man"Regulars as -upers3 it means that the selling ratio of Regular to -uper is 2 to 13 that is REG 2 = REG =2-F. 1 And3 because of the at l a!t3 it becomes RB+ @ 2-F. The line representing this constraint passes through the point 903 0:. To determine another point3 let REG take on an" (alue3 sa" 503 and find the (alue of SUP. 0e no$ ha(e t$o points 903 0: and 9503 25: and $e can dra$ the line. To find the area satisf"ing the inequalit"3 substitute an" point3 sa" 9150; 50:3 into REG @ 2SUP $hich is 150 N 2 50. The inequalit" holds and $e kno$ that all the points on the same side as this point $ill satisf" the constraint.

The optimal profit is found $here the isoprofit lines lea(e the feasible area. This is the point $here the inspection and assembl" constraints intersect. To find the e act (alue of this point3 sol(e the simultaneous equations $hich represent constraints 91: and 95: to get SUP 6 5535 and REG 6 15535. The optimal solution is to produce 5535 units of the K-uperL model and 15535 units of the KRegularL model. The ma imum profit is RD 1<2350.

)onstraint 92:3 the paint constraint3 doesnHt contribute to the feasible area in fact3 it doesnHt touch it at all. This constraint is therefore redundant. &# A transport compan" has t$o t"pes of trucks3 T"pe A and T"pe A. T"pe A has a refrigerated capacit" of 20 m 5 and a non/refrigerated capacit" of 40 m 5 $hile T"pe A has the same o(erall (olume $ith equal sections for refrigerated and non/ refrigerated stock. A grocer needs to hire trucks for the transport of 53000 m 5 of refrigerated stock and 43000 m 5 of non/refrigerated stock. The cost per kilometer of a T"pe A is O503 and O40 for T"pe A. =o$ man" trucks of each t"pe should the grocer rent to achie(e the minimum total costC http&''$$$.(itutor.com'alg'linear*programming'problems*solutions.html Solution: 1 )hoose the unkno$ns. 6 T"pe A trucks " 6 T"pe A trucks 2 0rite the ob8ecti(e function . f9 3": 6 50 7 40" 5 0rite the constraints as a s"stem of inequalities . A Refrigerated 2on/refrigerated 20 40 A 50 50 Total 5 000 4 000

20 7 50" @ 5 000 40 7 50" @ 4 000 @0 "@0 4 Eind the set of feasible solutions that graphicall" represent the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. f903 400'5: 6 50 P 0 7 40 P 400'5 6 53555.552 f91503 0: 6 50 P 150 7 40 P 0 6 43500 As and " must be natural numbers round the (alue of ". ,inimum f9503 <I: 6 50 P 50 7 40 P<I 6 431!0

The minimum cost is O431!0. To achie(e this 50 trucks of T"pe A and <I trucks of T"pe A are needed. '# A school is preparing a trip for 400 students. The compan" $ho is pro(iding the transportation has 10 buses of 50 seats each and ! buses of 40 seats3 but onl" has D dri(ers a(ailable. The rental cost for a large bus is O!00 and O<00 for the

small bus. )alculate ho$ man" buses of each t"pe should be used for the trip for the least possible cost. http&''$$$.(itutor.com'alg'linear*programming'problems*solutions.html Solution:

1 )hoose the unkno$ns. 6 small buses " 6 big buses 2 0rite the ob8ecti(e function . f9 3 ": 6 <00 7 !00" 5 0rite the constraints as a s"stem of inequalities . 40 7 50" @ 400 7"?D @0 "@0 4 Eind the set of feasible solutions that graphicall" represent

the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. f903 !: 6 <00 P 0 7 !00 P ! 6 O<3400 f903 D: 6 <00 P 0 7 !00 P D 6 OI3200 f953 4: 6 < 00 P 5 7 !00 P 4 6 O<3200 4 buses. 9# A store $ants to liquidate 200 of its shirts and 100 pairs of pants from last season. The" ha(e decided to put together t$o offers3 A and A. Jffer A is a package of one shirt and a pair of pants $hich $ill sell for O50. Jffer A is a package of three shirts and a pair of pants3 $hich $ill sell for O50. The store does not $ant to sell less than 20 packages of Jffer A and less than 10 of Jffer A. =o$ man" packages of each do the" ha(e to sell to ma imi%e the mone" generated from the promotionC http&''$$$.(itutor.com'alg'linear*programming'problems*solutions.html Solution: 1 )hoose the unkno$ns. 6 number of packages of Jffer A " 6 number of packages of Jffer A ,inimum The minimum cost is O<3200. This is achei(ed $ith 4 large and 5 small

2 0rite the ob8ecti(e function . f9 3 ": 6 50 7 50" 5 0rite the constraints as a s"stem of inequalities . , i n A A i m a l h i r t s . a n t s 7 5" ? 200 7 " ? 100 @ 20 " @ 10 4 Eind the set of feasible solutions that graphicall" represent 1 1 1 0 0 1 5 2 0 0

the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. f9 3 ": 6 50 P 20 7 50 P 10 6 O13100 f9 3 ": 6 50 P D0 7 50 P 10 6 O53200 f9 3 ": 6 50 P 20 7 50 P <0 6 O53<00 f9 3 ": 6 50 P 50 7 50 P 50 6 O43000
$0

,a imum

ackages of each offer generates a ma imum amount of O43000 in sales.

10# A compan" manufactures and sells t$o models of lamps3 11 and 12. To manufacture each lamp3 the manual $ork in(ol(ed in model 11 is 20 minutes and for 123 50 minutes. The mechanical 9machine: $ork in(ol(ed for 11 is 20

minutes and for 123 10 minutes. The manual $ork a(ailable per month is 100 hours and the machine is limited to onl" !0 hours per month. Qno$ing that the profit per unit is O15 and O10 for 11 and 123 respecti(el"3 determine the quantities of each lamp that should be manufactured to obtain the ma imum benefit. http&''$$$.(itutor.com'alg'linear*programming'programming*problems.html Solution & 1 )hoose the unkno$ns. 6 number of lamps 1 1 " 6 number of lamps 1 2 2 0rite the ob8ecti(e function . f9 3 ": 6 15 7 10" 5 0rite the constraints as a s"stem of inequalities . )on(ert the time from minutes to hours. 20 min 6 1'5 h 50 min 6 1'2 h 10 min 6 1'< h 1 1 1 , an 1' 1' 10 ua 5 l , ac 1' 1' hi 5 ne < !0 2 0 2 Ti m e

1'5 7 1'2" ? 100 1'5 7 1'<" ? !0

As the number of lamps are natural numbers3 there are t$o more constraints& @0 "@0 4 Eind the set of feasible solutions that graphicall" represent

the constraints. Represent the constraints graphicall". As @ 0 and " @ 03 $ork in the first quadrant. 7 1'2 " ? 100; and take a point on -ol(e the inequation graphicall"& 1'5 the plane3 for e ample 9030:. 1'5 P 0 7 1'2 P 0 ? 100 1'5 P 0 7 1'< P 0 ? !0 The area of intersection of the solutions of the inequalities $ould be the solution to the s"stem of inequalities3 $hich is the set of feasible solutions.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions. The optimal solution3 if unique3 is a (erte . These are the solutions to s"stems& 1'5 7 1'2" 6 100; 6 0 903 200: 1'5 7 1'<" 6 !0; " 6 092403 0:

1'5 7 1'2" 6 100; 1'5 7 1'<" 6 !092103 <0:

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. >n the ob8ecti(e function3 place each of the (ertices that $ere determined in the pre(ious step. f9 3 ": 6 15 7 10" f903 200: 6 15P0 7 10P200 6 O23000 f92403 0 : 6 15P240 7 10P0 6 O53<00 f92103 <0: 6 15P210 7 10P<0 6 O53I50 of model 1 1 to obtain abenefit of O53I50. 11# 0ith the start of school approaching3 a store is planning on ha(ing a sale on school materials. The" ha(e <00 notebooks3 500 folders and 400 pens in stock3 and the" plan on packing it in t$o different forms. >n the first package3 there $ill be 2 notebooks3 1 folder and 2 pens3 and in the second one3 5 notebooks3 1 folder and 1 pen. The price of each package $ill be O<.50 and OI.00 respecti(el". =o$ man" packages should the" put together of each t"pe to obtain the ma imum benefitC http&''$$$.(itutor.com'alg'linear*programming'programming*problems.html Solution: ,a imum The optimum solution is to manufacture 210 units of model 1 1 and <0 units

1 )hoose the unkno$ns. 6 .1 " 6 .2 2 0rite the ob8ecti(e function . f9 3 ": 6 <.5 7 I" 5 0rite the constraints as a s"stem of inequalities . A . 1 . 2 (a il ab le 2 ot eb o o ks E ol de rs . en 2 s 2 7 5" ? <00 7 " ? 500 2 7 " ? 400 @0 "@0 4 Eind the set of feasible solutions that graphicall" represent 1 40 0 1 1 50 0 2 5 <0 0

the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. f9 3":6 <.5 P 200 7 I P 0 6 O13500 f9 3":6 <.5 P 0 7 I P 200 6 O13400 f9 3":6 <.5 P 150 7 I P 100 6 O13<I5 package 2 to obtain O13<I5. 12# Jn a chicken farm3 the poultr" is gi(en a health" diet to gain $eight. The chickens ha(e to consume a minimum of 15 units of -ubstance A and another 15 units of -ubstance A. >n the market there are onl" t$o classes of compounds& T"pe G3 $ith a composition of one unit of A to fi(e units of A3 and another t"pe3 ,a imum The optimum solution is to package 150 units of package 1 and 100 units of

R3 $ith a composition of fi(e units of A to one of A. The price of T"pe G is O10 and T"pe R3 O50. 0hat are the quantities of each t"pe of compound that ha(e to be purchased to co(er the needs of the diet $ith a minimal costC http&''$$$.(itutor.com'alg'linear*programming'programming*problems.html Solution & 1 )hoose the unkno$ns. 6G "6R 2 0rite the ob8ecti(e function . f9 3": 6 10 7 50" 5 0rite the constraints as a s"stem of inequalities . , i n G R i m a l A 1 5 1 5 1 5

A 5 7 5" @ 15 5 7 " @ 15 @0 "@0 4 Eind the

set

of feasible

solutions that

graphicall"

represent

the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. >t must be taken into account the possible non/e istence of a solution if the compound is not bounded. f903 15: 6 10 P 0 7 50 P 15 6 450 f9153 0: 6 10 P 15 7 50 P 0 6 150 f95'23 5'2: 6 10 P 5'2 7 50 P 5'2 6 100 ,inimum The minimum cost is O100 for G 6 5'2 and R 6 5'2. 15. There is onl" <00 milograms of a certain drug that is needed to make both large and small pills for small scale pharmaceutical distribution. The large tablets $eigh 40 milograms and the small ones3 50 milograms. )onsumer research determines that at least t$ice the amount of the smaller tablets are

needed than the large ones and there needs to be at least three large tablets made. Bach large tablet is sold for a profit of O2 and the small tablet3 O1. =o$ man" tablets of each t"pe ha(e to be prepared to obtain the ma imum profitC http&''$$$.(itutor.com'alg'linear*programming'programming*problems.html

Solution &

1 )hoose the unkno$ns. 6 1arge tablets " 6 -mall tablets

2 0rite the ob8ecti(e function . f9 3 ": 6 2 7 "

5 0rite the constraints as a s"stem of inequalities . 40 7 50" ? <00 @5 "@2 @0 "@0

4 Eind

the

set

of feasible

solutions that

graphicall"

represent

the constraints.

5 )alculate the coordinates of the (ertices from the compound of feasible solutions.

< )alculate the (alue of the ob8ecti(e function at each of the (ertices to determine $hich of them has the ma imum or minimum (alues. f9 3 ":6 2 P 5 7 1< 6 O22 f9 3 ":6 2 P 5 7 < 6 O12 f9 3 ":6 2 P < 7 12 6 O24 ,a imum

The ma imum profit is O24 3 and is obtained b" making < units of the large tablets and 12 units of the small tablets.

1"# A farmer can plant up to ! acres of land $ith $heat and barle". =e can earn O53000 for e(er" acre he plants $ith $heat and O53000 for e(er" acre he plants $ith barle". =is use of anecessar" pesticide is limited b" federal regulations to 10 gallons for his entire ! acres. 0heat requires 2 gallons of pesticide for e(er" acre planted and barle" requires 8ust 1 gallon per acre. 0hat is the ma imum profit he can makeC http&''$$$.algebra.com'algebra'home$ork'coordinate'$ord'T=BJ/2011/0!/2!/05.lesson Solution : let 6 the number of acres of $heat

let " 6 the number of acres of barle". since the farmer earns O53000 for each acre of $heat and O53000 for each acre of barle"3 then the total profit the farmer can earn is 5000 7 5000". let p 6 total profit that can be earned. "our equation for profit becomes& p 6 5000 7 5000" the constraints are& number of acres has to be greater than or equal to 0. number of acres has to be less than or equal to !. amount of pesticide has to be less than or equal to 10. constraint equations are& N6 0 " N6 0 7 " S6 ! 2 7 " S6 10 the area of the graph that satisfies all the constraints is the region of feasibilit". the ma imum or minimum solutions to the problem $ill be at the intersection points of the lines that bound the region of feasibilit".

the region of feasibilit" is the shaded area of the graph. the point 923<: $as sol(ed for in the follo$ing manner& equations of the intersecting lines are "6!M " 6 10 / 2 subtract the first equation from the second equation and "ou get& 062M add 62 substitute 2 for in either equation to get " 6 <. that makes the intersection point 9 3": 6 923<:. the ob8ecti(e equation is& p 6 5000 7 5000" profit $ill be ma imum at the intersection points of the region of feasibilit" on the graph. the profit equation is e(aluated at each of these points as sho$n in the follo$ing table. intersection point of 9 3": p to both sides of this equation and "ou get&

9030: 903!: 923<: 9530:

O0 O243000 O2!3000 TTTTT O253000

the ma imum profit occurs $hen the farmer plants 2 acres of $heat and < acres of barle". number of acres of $heat is 2 and number of acres of barle" is < for a total of ! acres $hich is the ma imum number of acres a(ailable for planting. number of gallons of pesticide used for $heat is 4 and number of gallons of pesticide used for barle" is < for a total of 10 gallons of pesticide $hich is the ma imum amount of pesticide that can be used. 1$# A painter has e actl" 52 units of "ello$ d"e and 54 units of green d"e. =e plans to mi as man" gallons as possible of color A and color A. Bach gallon of color A requires 4 units of "ello$ d"e and 1 unit of green d"e. Bach gallon of color A requires 1 unit of "ello$ d"e and < units of green d"e. Eind the ma imum number of gallons he can mi . http&''$$$.algebra.com'algebra'home$ork'coordinate'$ord'T=BJ/2011/0!/2!/05.lesson Solution& the ob8ecti(e function is to determine the ma imum number of gallons he can mi . the colors in(ol(ed are color A and color A. let 6 the number of gallons of color A. let " 6 the number of gallons of color A. if $e let g 6 the ma imum gallons the painter can make3 then the ob8ecti(e function becomes& g6 7"

make a table for color A and color A to determine the amount of each d"e required. "our table $ill look like this& each gallon of color A or A $ill require& units of "ello$ d"e units of green d"e

color A color A

4 1

1 <

total units of "ello$ d"e a(ailable are 52 total units of green d"e a(ailable are 54 constraint equations are& N6 0 " N6 0 4 7 " S6 52 7 <" S6 54 and " ha(e to each be greater than or equal to 0 because the number of gallons canUt be negati(e. in order to graph these equations3 "ou sol(e for " in those equations that ha(e " in them. the equtions for graphing are& N6 0 " N6 0 " S6 52 / 4 " S6 954 / :'< the graph $ill look like this&

the region of feasibilit" is the shaded area of the graph. all points $ithin the feasibilit" region 9030: 903D: 9<3!: 9!30: the ma imum or minimum (alue of the ob8ecti(e function $ill be at these points of intersection. sol(e the ob8ecti(e function at each of these intersection points to determine $hich point contains the ma imum number of gallons. the ob8ecti(e function is& g6 7" the table $ith the (alue of g at each of these intersection points is sho$n belo$& meet the constraint of the problem. the intersection points of the region of feasibilit" are

intersection point 9 3": 9030: 903D: 9<3!:

gallons of paint 0 D 14 TTTTT

9!30:

the ma imum gallons of paint for color A and A3 gi(en the constraints3 is equal to 14. this is comprised of < gallons of color A and ! gallons of color A. < gallons of color A uses 24 gallons of "ello$ d"e and ! gallons of color A uses ! gallons of "ello$ d"e for a total of 52 gallons of "ello$ d"e $hich is the ma imum amount of "ello$ d"e that can be used. < gallons of color A user < gallons of green d"e and ! gallons of color A uses 4! gallons of green d"e for a total of 54 gallons of green d"e $hich is the ma imum amount of green d"e that can be used.

1%# The Aead -tore sells material for customers to make their o$n 8e$elr". )ustomer can select beads from (arious bins. +race $ants to design her o$n =allo$een necklace from orange and black beads. -he $ants to make a necklace that is at least 12 inches long3 but no more than 24 inches long. +race also $ants her necklace to contain black beads that are at least t$ice the length of orange beads. Einall"3 she $ants her necklace to ha(e at least 5 inches of black beads. Eind the constraints3 sketch the problem and find the (ertices 9intersection points: http&''$$$.algebra.com'algebra'home$ork'coordinate'$ord'T=BJ/2011/0!/2!/05.lesson

Solution&

let 6 the number of inches of black beads. let " 6 the number of inches of orange beads.

the ob8ecti(e function is the length of the necklace there is a ma imum length and a minimum length. the constraint equations for this problem are& N6 0

" N6 0 7 " N6 12 7 " S6 24 N6 2" N6 5

N6 0 is there because the number of inches of black beads canUt be negati(e. " N6 0 is there because the number of inches of orange beads canUt be negati(e. 7 " N6 12 is there because the total length of the necklace has to be greater than or equal to 12 inches. 7 " S6 24 is there because the total length of the necklace has to be less than or equal to 24 inches. N6 2" is there because the length of the black beads has to be greater than or equal to t$ice the length of the orange beads. N6 5 is there because the number of inches of black beads has to be greater than or equal to 5. to graph these equations3 $e ha(e to sol(e for " in each equation that has " in it and then graph the equalit" portion of each of them. a graph of "ou equations is sho$n belo$&

the

region

of

feasibilit"

is

the

shaded

area

of

the

graph.

all points $ithin the region of feasibilit" meet the constraint requirements of the problem. the intersection points bounding the region of feasibilit" are& 9!34: 91230: 91<3!: 92430: 9!34: is the intersection of the lines " 6 '2 and " 6 12 M to find the point of intersection3 set '2 and 12/ equal to each other and sol(e for "ou get& '2 6 12/ .

multipl" both sides of the equation b" 2 to get& 6 24/2 add 2 to both sides of the equation to get& 5 6 24 di(ide both sides of the equation b" 5 to get& 6 !. substitute ! for in either equation to get " 6 4. $ith the /a is. $ith the /a is.

91230: is the intersection of the line " 6 12 / 92430: is the intersection of the line " 6 24 /

to find the point of intersection3 set " equal to 0 in each equation and sol(e for . 91<3!: is the intersection of the lines " 6 '2 and " 6 24 / . to find the intersection point3 set '2 equal to 24/ and sol(e for . "ou get& '2 6 24/ multipl" both sides of this equation b" 2 to get& 6 4! / 2 add 2 to both sides of this equation to get& 5 6 4! di(ide both sides of this equation b" 5 to get& 6 1< substitute 1< for " 6 !. in either equation to get&

the ma imum ' minimum necklace length $ill be at the intersection points of the boundaries of the region of feasibilit".

e(aluation of the ob8ecti(e function at these intersections "ields the follo$ing& ob8ecti(e function is& 7 " 6 n $here n is the length of the necklace in inches. intersection points 9!34: 91230: 91<3!: 92430: 12 12 24 24 number of inches

the number of inches of black beads is at least t$ice the number of inches of orange beads. the number of inches of black beads is at least 5. the total length of the necklace is greater than or equal to 12 inches or less than or equal to 24 inches.

all the constraints ha(e been met. the ma imum length the necklace can be and still meet the constraints is 24 inches. the minimum length the necklace can be and still meet the constraints is 12 inches.

1&# A garden shop $ishes to prepare a suppl" of special fertili%er at a minimal cost b" mi ing t$o fertili%ers3 A and A. The mi ture is to contain& at least 45 units of phosphate at least 5< units of nitrate at least 40 units of ammonium Eertili%er A costs the shop O.DI per pound. Eertili%er A costs the shop O1.!D per pound. fertili%er A contains 5 units of phosphate and 2 units of nitrate and 2 units of ammonium. fertili%er A contains 5 units of phosphate and 5 units of nitrate and 5 units of ammonium. ho$ man" pounds of each fertili%er should the shop use in order to minimi%e their cost.

http&''$$$.algebra.com'algebra'home$ork'coordinate'$ord'T=BJ/2011/0!/2!/05.lesson Solution : let 6 the number of pounds of fertili%er A. let " 6 the number of pounds of fertili%er A. the ob8ecti(e function is to minimi%e the cost. the ob8ecti(e function becomes& c 6 .DI 7 1.!D" The constraint equations are& since the number of pounds of each fertili%er canUt be negati(e3 2 of the constraint equations become& N6 0 " N6 0 since the number of units of phosphate has to be at least 453 the constraint equation for phosphate becomes& 5 7 5" N6 45 since the number of units of nitrate must be at least 5<3 the constraint equation for nitrates becomes& 2 7 5" N6 5< since the number of units of ammonium must be at least 403 the constraint equation for ammonium becomes& 2 7 5" N6 40 the constraint equations for this problem become& N6 0 " N6 0 5 7 5" N6 45 2 7 5" N6 5< 2 7 5" N6 40

in order to graph these equations3 "ou ha(e to sol(e for " in each equation that has " in it and then graph the equalit" portion of those equations. the equations to be graphed are& N6 0 " N6 0 " N6 945/5 :'5 " N6 95< / 2 :'5 " N6 940/2 :'5 6 0 is a (ertical line that is the same line as the "/a is. " 6 0 is a hori%ontal line that i the same line as the /a is. a graph &

the

feasibilit"

region

is

the

area

of

the

graph

that

is

shaded.

all points $ithin the region of feasibilit" meet the constraint requirements of the problem.

the intersection points at the boundaries of the feasibilit" region are&

90315: 95310: 91532: 92030:

the intersection points of the boundaries of the region of feasibilit" contain the minimum cost solution for the ob8ecti(e function in this problem. no$ that "ou ha(e the intersection points3 "ou can sol(e for the minimum cost equation $hich is the ob8ecti(e function of& c 6 .DI 7 1.!D" the follo$ing table sho$s the (alue of the cost equation at each of the intersection points.
intersection points 9 3": 90315: 95310: 91532: 92030: c 6 .DI 7 1.!D" 2!.55 21.!1 1!.55 1D.40

the table suggests that $e ha(e a minimum cost solution $hen the (alue of and the (alue of " is equal 2. $hen nitrates3 and ammonium are& phosphate 6 5 7 5" 6 5 15 7 5 2 6 I5 7 < 6 !1 nitrate 6 2 7 5" 6 2 15 7 5 2 6 50 7 < 6 5< ammonium 6 2 7 5" 6 2 15 7 5 2 6 50 7 10 6 40

is equal to 15

6 15 and " 6 23 the number of pounds of potassium3

1'# Rou need to bu" some filing cabinets. Rou kno$ that )abinet G costs O10 per unit3 requires si square feet of floor space3 and holds eight cubic feet of files. )abinet R costs O20 per unit3 requires eight square feet of floor space3 and holds t$el(e cubic feet of files. Rou ha(e been gi(en O140 for this purchase3 though "ou donUt ha(e to spend that much. The office has room for no more than I2 square feet of cabinets. =o$ man" of $hich model should "ou bu"3 in order to ma imi%e storage (olumeC http&''$$$.purplemath.com'modules'linprog5.htm

Solution: The question ask for the number of cabinets > need to bu"3 so m" (ariables $ill stand for that&

& number of model G cabinets purchased "& number of model R cabinets purchased @ 0 and " @ 0. > ha(e to consider costs and floor space 9the VfootprintV of each

2aturall"3

unit:3 $hile ma imi%ing the storage (olume3 so costs and floor space $ill be m" constraints3 $hile (olume $ill be m" optimi%ation equation.

10 7 20" ? 1403 or

7 2" ? 143 or " ? M9 1'2 : 7 I

< 7 !" ? I23 or 5 7 4" ? 5<3 or " ? M9 5'4 : 7 D f9 3": 6 ! 7 12" >ntersect point& 5 7 <" 6 42 5 7 4" 6 5< 2" 6 < " 6 53 6 ! 9!35: f903I: 6 !T0 7 12TI 6 !4 f91230: 6 !T12 7 12T0 6 D< f9!35: 6 !T! 7 12T5 6 <4 7 5< 6 100 -o3 ma imal (olume of 100 cubic feet b" bu"ing eight of model G and three of model R.

19# -hannonUs )hocolates produces semis$eet chocolate chips and milk chocolate chips at its plants in 0ichita3 Q- and ,oore3 JQ. The 0ichita plant produces 5000 pounds of semis$eet chips and 2000 pounds of milk chocolate chips each da" at a cost of O10003 $hile the ,oore

plant produces 1000 pounds of semis$eet chips and <000 pounds of milk chocolate chips each da" at a cost of O1500. -hannon has an order from Eood Ao -upermarkets for at least 503000 pounds of semis$eet chips and <03000 pounds of milk chocolate chips. =o$ should -hannon schedule its production so that it can fill the order at minimum costC 0hat is the minimum costC http&''$$$.algebra.com'algebra'home$ork'coordinate'$ord'T=BJ/2012/01/2<.lesson Solution: let 6 number of da"s of production at $ichita plant. let " 6 number of da"s of production at moore plant. Jb8ecti(e equation& f9 3":6 1000 7 1500" )onstraint equations are& @0 "@0 5000 7 1000" @ 503000 2000 7 <000" @ <03000 to graph these equations3 sol(e for " in those equations $here " is present and then graph the equalit" portion of those equations. " 6 9503000 / 5000 : ' 1000 " 6 9<03000 / 2000 : ' <000 6 0 is a (ertical line that is the same line as the "/a is. " 6 0 is a (ertical line that is the same line as the /a is. a graph of "our equation looks like this&

f90350:6 1000T0 7 1500T50 6 453000 f95030:6 1000T50 7 1500T0 6 503000 f9I.53I.5:6 1000TI.5 7 1500TI.5 6 1!3I50 ,inimum cost is 1!3I50. This occurs $hen $ichita plant takes I.5 da"s and moore plant takes I.5 da"s. 20# A compan" makes t$o products 9G and R: using t$o machines 9A and A:. Bach unit

of G that is produced requires 50 minutes processing time on machine A and 50 minutes processing time on machine A. Bach unit of R that is produced requires 24 minutes processing time on machine A and 55 minutes processing time on machine A. At the start of the current $eek there are 50 units of G and D0 units of R in stock. A(ailable processing time on machine A is forecast to be 40 hours and on machine A is forecast to be 55 hours. The demand for G in the current $eek is forecast to be I5 units and for R is forecast to be D5 units. )ompan" polic" is to ma imise the combined sum of the units of G and the units of R in stock at the end of the $eek. Eormulate the problem of deciding ho$ much of each product to make in the current $eek as a linear program. -ol(e this linear program graphicall".
http&''people.brunel.ac.uk'Wmast88b'8eb'or'morelp.html

Solution& 1et

be the number of units of G produced in the current $eek " be the number of units of R produced in the current $eek

then the constraints are&

X 50 7 24" S6 409<0: machine A time X 50 7 55" S6 559<0: machine A time X N6 I5 / 50 N6 45 so production of G N6 demand 9I5: / initial stock 950:3 $hich ensures $e meet X i.e. demand X " N6 D5 / D0 X i.e. " N6 5 so production of R N6 demand 9D5: / initial stock 9D0:3 $hich ensures $e meet demand

The

ob8ecti(e

is&

ma imise

9 750/I5:

9"7D0/D5:

9 7"/50:

i.e. to ma imise the number of units left in stock at the end of the $eek >t is plain from the diagram belo$ that the ma imum occurs at the intersection of 645 and 50 7 24" 6 2400

-ol(ing simultaneousl"3 rather than b" reading (alues off the graph3 $e ha(e that 645 and "6<.25 $ith the (alue of the ob8ecti(e function being 1.25 21# These products are produced using t$o machines3 G and R. Bach unit of product 1

that is produced requires 15 minutes processing on machine G and 25 minutes processing on machine R. Bach unit of product 2 that is produced requires I minutes processing on machine G and 45 minutes processing on machine R. The a(ailable

time on machine G in $eek 5 is forecast to be 20 hours and on machine R in $eek 5 is forecast to be 15 hours. Bach unit of product 1 sold in $eek 5 gi(es a contribution to profit of Y10 and each unit of product 2 sold in $eek 5 gi(es a contribution to profit of Y4. >t ma" not be possible to produce enough to meet "our forecast demand for these products in $eek 5 and each unit of unsatisfied demand for product 1 costs Y53 each unit of unsatisfied demand for product 2 costs Y1. Eormulate the problem of deciding ho$ much of each product to make in $eek 5 as a linear program. -ol(e this linear program graphicall".
http&''people.brunel.ac.uk'Wmast88b'8eb'or'morelp.html Solution&

2ote that the first part of the question is a forecasting question so it is sol(ed belo$. Eor product 1 appl"ing e ponential smoothing $ith a smoothing constant of 0.I $e get& ,1 6 ,2 6 ,5 6 0.IR2 7 0.IR5 7 0.5,1 6 0.5,2 6 R1 6 0.I92I: 0.I954: 7 7 0.5925: 0.5925.!0: 6 6 25 25.!0 51.54

,4 6 0.IR4 7 0.5,5 6 0.I940: 7 0.5951.54: 6 5I.4< The forecast for $eek fi(e is 8ust the a(erage for $eek 4 6 , 4 6 5I.4< 6 51 9as $e cannot ha(e fractional demand:. Eor product 2 appl"ing e ponential smoothing $ith a smoothing constant of 0.I $e get& ,1 6 ,2 6 ,5 6 0.IR2 7 0.IR5 7 0.5,1 6 0.5,2 6 R1 6 0.I915: 0.I915: 7 7 0.5911: 0.5912.40: 6 6 11 12.40 14.22

,4 6 0.IR4 7 0.5,5 6 0.I914: 7 0.5914.22: 6 14.0I The forecast for $eek fi(e is 8ust the a(erage for $eek 4 6 , 4 6 14.0I 6 14 9as $e cannot ha(e fractional demand:.

0e can no$ formulate the 1. for $eek 5 using the t$o demand figures 95I for product 1 and 14 for product 2: deri(ed abo(e. 1et
1 2

be the number of units of product 1 produced be the number of units of product 2 produced
1

$here

N60

The constraints are& 15 25

1 2 1 1

7I 7 45

S6 209<0: machine G
2

S6 159<0: machine R

S6 5I demand for product 1 S6 14 demand for product 2

The ob8ecti(e is to ma imise profit3 i.e. ma imise 10

1

74
1

/ 595I/
2

: / 1914/ 2:

i.e. ma imise 15

75

/ 125 65< at $hich point the ma imum profit is 1595<: 7 590: /

The graph is sho$n belo$3 from the graph $e ha(e that the solution occurs on the hori%ontal a is 9 260: at 125 6 Y545
1

22# The compan" has 40 hours of machine time a(ailable in the ne t $orking $eek but

onl" 55 hours of craftsman time. ,achine time is costed at Y10 per hour $orked and craftsman time is costed at Y2 per hour $orked. Aoth machine and craftsman idle

times incur no costs. The re(enue recei(ed for each item produced 9all production is sold: is Y20 for G and Y50 for R. The compan" has a specific contract to produce 10 items of G per $eek for a particular customer. Eormulate the problem of deciding ho$ much to produce per $eek as a linear program. -ol(e this linear program graphicall".
http&''people.brunel.ac.uk'Wmast88b'8eb'or'morelp.html Solution&

1et

be the number of items of G " be the number of items of R

then the 1. is& ma imise

20 7 50" / 109machine time $orked: / 29craftsman time $orked:

sub8ect to&

15 7 1D" S6 409<0: machine time 20 7 2D" S6 559<0: craftsman time N6 10 contract 3" N6 0

so that the ob8ecti(e function becomes ma imise

20 7 50" / 10915 7 1D":'<0 / 2920 7 2D":'<0

i.e. ma imise

1I.1<<I 7 25.!<<I"

sub8ect to&

15 7 1D" S6 2400 20 7 2D" S6 2100 N6 10 3" N6 0

>t is plain from the diagram belo$ that the ma imum occurs at the intersection of 610 and 20 7 2D" S6 2100 -ol(ing simultaneousl"3 rather than b" reading (alues off the graph3 $e ha(e that 610 and "6<5.52 $ith the (alue of the ob8ecti(e function being Y1!<<.5

23# A compan" manufactures t$o products 9A and A: and the profit per unit sold is Y5

and Y5 respecti(el". Bach product has to be assembled on a particular machine3 each unit of product A taking 12 minutes of assembl" time and each unit of product A 25 minutes of assembl" time. The compan" estimates that the machine used for assembl" has an effecti(e $orking $eek of onl" 50 hours 9due to maintenance'breakdo$n:. Technological constraints mean that for e(er" fi(e units of product A produced at least t$o units of product A must be produced. Eormulate the problem of ho$ much of each product to produce as a linear program. -ol(e this linear program graphicall". The compan" has been offered the chance to hire an e tra machine3 thereb" doubling the effecti(e assembl" time a(ailable. 0hat is the ma imum amount "ou $ould be prepared to pa" 9per $eek: for the hire of this machine and $h"C
http&''people.brunel.ac.uk'Wmast88b'8eb'or'morelp.html

Solution& 1et
A A

6 number of units of A produced 6 number of units of A produced

then the constraints are& 12

A A

7 25

S6 509<0: 9assembl" time:

N6 29 A'5:
A

i.e. i.e. 5

/ 0.4
A

N6 0
A

N6 2
A

9technological:

$here

N6 0

and the ob8ecti(e is ma imise 5 12 7 25

A

75

>t is plain from the diagram belo$ that the ma imum occurs at the intersection of
A A

6 1!00 and

/ 0.4

60

-ol(ing simultaneousl"3 rather than b" reading (alues off the graph3 $e ha(e that&
A A

6 91!00'22: 6 !1.!
A

6 0.4

6 52.I

$ith the (alue of the ob8ecti(e function being Y40!.D

#oubling the assembl" time a(ailable means that the assembl" time constraint 9currentl" 12
A

7 25

S6 1!00: becomes 12

7 25

S6 291!00: This ne$ / 0.4 60

constraint $ill be parallel to the e isting assembl" time constraint so that the ne$ optimal solution $ill lie at the intersection of 12 i.e. at
A A A

7 25

6 5<00 and

6 95<00'22: 6 1<5.<
A

6 0.4

6 <5.4

$ith the (alue of the ob8ecti(e function being Y!1I.! =ence $e ha(e made an additional profit of Y9!1I.!/40!.D: 6 Y40!.D and this is the "ax#"$" amount $e $ould be prepared to pa" for the hire of the machine for doubling the assembl" time. This is because if "achine&
2"# A carpenter makes tables and chairs. Bach table can be sold for a profit of Y50 and

e pa! "ore than this a"ount then the %408&' e oul# have "a#e

ill re#uce our ithout the ne

"a$i"u" profit belo

each chair for a profit of Y10. The carpenter can afford to spend up to 40 hours per $eek $orking and takes si hours to make a table and three hours to make a chair. )ustomer demand requires that he makes at least three times as man" chairs as tables. Tables take up four times as much storage space as chairs and there is room for at most four tables each $eek. Eormulate this problem as a linear programming problem and sol(e it graphicall".
http&''people.brunel.ac.uk'Wmast88b'8eb'or'morelp.html Solution&

(ariables 1et
T )

6 number of tables made per $eek 6 number of chairs made per $eek

)onstraints

total (ork tim)

T

<

75

S6 40

!ustom)r d)mand N6 5
T

stora ) s*a!)
T

9 )'4: 7

S6 4

all +aria,l)s -. 0

*bjective ma imise 50
T

7 10

The graphical representation of the problem is gi(en belo$ and from that $e ha(e that the solution lies at the intersection of 9 )'4: 7
T

6 4 and <

75

6 40
)

-ol(ing these t$o equations simultaneousl" $e get corresponding profit 6 Y14<.<<I

6 10.<<I3

6 1.555 and the