MODULE B

END-OF-MODULE PROBLEMS
B.1 Let x = number of standard model to produce y = number of deluxe model to produce Maximize 40x + 60y Subject to 30 x + 30 y 450 10 x + 15y 1 0 x6 x! y 0 y "0 1 16 14 1" 10 #ptimal ( x = 0! y = 10)

B.2

6 4 " 0 " 4 6 10 1" 14 16 1 "0 x

$easible corner points %x! y&' %0! 3&! %0! 10&! %"(4! ( &! %6()5! 3&( Maximum profit is 100 at %0! 10&(

Quantitative Module B: Linear Programming

B.3

y "0 1 16 14 1" 10 #ptimal ( x = 4! y = )

6 4 " 0 " 4 6 10 1" 14 16 1 "0 x

$easible corner points %x! y&' %0! "&! %0! 10&! %4! &! %10! "&( Maximum profit is 5" at %4! &( B.4 %a& %b& *orner points %0! 50&! %50! 50&! %0! "00&! %)5! )5&! %50! 150&( #ptimal solutions' %)5! )5& and %50! 150&( +ot, -ield profit of .3!000( x" 400 350 300 "50 "00 150 $easible /e0ion 100 50 0 50 100 150 "00 "50 300 350 400 450 x1

Instructors Solutions Manual t/a !erations Management

B."

%a& %b&

1ddin0 a ne2 constraint 2ill reduce t,e size of t,e feasible re0ion unless it is a redundant constraint( 3t can ne4er ma5e t,e feasible re0ion an- lar0er( 1 ne2 constraint can onl- reduce t,e size of t,e feasible re0ion6 t,erefore t,e 4alue of t,e objecti4e function 2ill eit,er decrease or remain t,e same( 3f t,e ori0inal solution is still feasible! it 2ill remain t,e optimal solution( Let x1 = number of li4er fla4ored biscuits in a pac5a0e x" = number of c,ic5en fla4ored biscuits in a pac5a0e Minimize x1 + " x" Subject to x1 + x" 40 " x1 + 4 x" 60 x1 15 x1! x" 0 *orner points are %0! 40& and %15! "5&( #ptimal solution is %15! "5& 2it, cost of 65( Minimum cost = 65 cents( 160 140 1"0 100 0 60 40 "0 0 "0 d 40 60 0 100 9umber of 1ir *onditioners' x1 1"0 $easible /e0ion c 8irin0 *onstraint b 7rillin0 *onstraint

B.#

%a&

%b& %c& B.$

Let x1 = number of air conditioners to be produced x" = number of fans to be produced Maximize "5x1 + 15x" Subject to 3x1 + " x" "40 (2irin0) " x1 + 1x" 140 (drillin0) x1! x" 0 (nonne0ati4it-) :rofit' #bj = .0 ; a' % x1 = 0 ! x" = 0 & #bj = "5 0 + 15 1"0 = .1! 00 ; b' % x1 = 0 ! x" = 1"0 & #bj = "5 40 + 15 60 = .1!<00 = ; c' % x1 = 40 ! x" = 60 & #bj = "5 )0 + 15 0 = .1!)50 ; d' % x1 = )0 ! x" = 0 & >,e optimal solution is to produce 40 air conditioners and 60 fans eac, period( :rofit 2ill be .1!<00(

Quantitative Module B: Linear Programming

B.%

300 "50 "00 x" 150 100 50 0 $easible /e0ion c "00 a b

50

100

150 x1

"50

300

Let x1 = number of Model 1 tubs produced x" = number of Model + tubs produced Maximize <0 x1 + )0 x" Subject to 1"5x1 + 100 x" "5!000 (steel ) "0 x1 + 30 x" 6!000 ( zinc) x1! x" 0 (nonne0ati4it-) :rofit' ; a' % x1 = 0 ! x" = "00 & ; b' % x1 = 5()1! x" = 14"( 6 & ; c' % x1 = "00 ! x" = 0 &

#bj = <0 0 + )0 "00 = .14!000(00 #bj = <0 5()1 + )0 14"( 6 = .1)!)14(10 #bj = <0 "00 + )0 0 = .1 !000(00 =

>,e optimal solution is to produce "00 Model 1 tubs! and 0 Model + tubs( :rofit 2ill be .1 !000( B.& 300 "50 "00 x" 150 100 50 0 a #ptimal Solution b 150 x1 Let x1 = number of benc,es produced x" = number of tables produced Maximize < x1 + "0 x" Subject to 4 x1 + 6 x" 1!"00 ( ,ours) 10 x1 + 35x" 3!500 (board?feet ) x1! x" 0 (nonne0ati4it-) "00 "50 c 300 350

$easible /e0ion 50 100

Instructors Solutions Manual t/a !erations Management

:rofit' ; a' % x1 = 0 ! x" = 100 & ; b' % x1 = "6"(5 ! x" = "5 & ; c' % x1 = 300 ! x" = 0 &

#bj = < 0 + "0 100 = ."!000(00 #bj = < "6"(5 + "0 "5 = ."! 6"(50 = #bj = < 300 + "0 0 = ."!)00(00

>,e optimal solution is to ma5e "6"(5 benc,es and "5 tables per period( :rofit 2ill be ."! 6"(50( +ecause benc,es and tables ma- be matc,ed %t2o benc,es per table&! it ma- not be reasonable to maximize profit in t,is manner( 1lso! t,is problem brin0s up t,e proper interpretation of t,e statement t,at @#ne s,ould ma5e "6"(5 %a fractional Auantit-& benc,es per period(B B.1' 40 #ptimal Solution 30 x" "0 10 a b $easible /e0ion is Cea4il- S,aded Line

10

"0 x1

30

40

50

Let x1 = number of 1lp,a?4 computers x" = number of +eta?5 computers Maximize' 1"00 x1 + 1 00 x" Subject to "0 x1 + "5x" = 00 ( total ,ours ) x1 10 (1lp,a?4s) x" 15 (+eta?5s) x1! x" 0 (nonne0ati4it-) :rofit' #bj = 1"00 10 + 1 00 "4 = .55!"00 = ; a' % x1 = 10 ! x" = "4 & ( ! x" = 15 & ( + 1 00 15 = .5"!500 #bj = 1"00 "1"5 ; b' % x1 = "1"5 >,e optimal solution is to produce 10 1lp,a?4 and "4 +eta?5 computers per period( :rofit is .55!"00(

Quantitative Module B: Linear Programming

B.11

50 5x1 + 3x" 150 40 30 x" "0 10 $easible /e0ion a 3x1 + 5 x" 150 x1 " x" 10

10

"0 x1

30

40

50

9ote t,at t,is problem ,as one constraint 2it, a ne0ati4e si0n( >,e optimal point! a! lies at t,e intersection of t,e constraints' 3x1 + 5x" 150 5 x1 + 3x" 150 >o sol4e t,ese eAuations simultaneousl-! be0in b- 2ritin0 t,em in t,e form s,o2n belo2' 3x1 + 5x" = 150 5 x1 + 3x" = 150 Multipl- t,e first eAuation b- 5! t,e second b- D3! and add t,e t2o eAuations and sol4e for x"' x" = 300 16 = 1 ()5 ( Ei4en' 3x1 + 5x" = 150 t,en and 3x1 = 150 5 x" = 150 5 1 ()5 x1 =

56("5 = 1 ()5 3 >,us! t,e optimal solution is' x1 = 1 ()5 ! x" = 1 ()5 >,e profit is 0i4en b-' C = 4 x1 + 4 x" = 4 1 ()5 + 4 1 ()5 = .150

Instructors Solutions Manual t/a !erations Management

B.12

100 x1 + " x" 160 0 60 x" 40 "0 3x1 + " x" 1"0 $easible /e0ion x" )0

a x1 + 3 x" 0 60 x1

"0

40

100

>,e optimal point! a! lies at t,e intersection of t,e constraints' 3x1 + " x" 1"0 x1 + 3x" <0 >o sol4e t,ese eAuations simultaneousl-! be0in b- 2ritin0 t,em in t,e form s,o2n belo2' 3x1 + " x" = 1"0 x1 + 3x" = <0 Multipl- t,e second eAuation b- D3! and add it to t,e first and sol4e for x"' x" = 150 ) = "1(43 ( Ei4en' 3x1 + " x" = 1"0 t,en and 3x1 = 1"0 " x" = 1"0 " "1(43 x1 = ))14 ( = "5()1 3

>,us! t,e optimal solution is' x1 = "5()1 ! x" = "1(43 >,e cost is 0i4en b-' C = x1 + " x" = "5()1 + " "1(43 = .6 (5) B.13 >,e fift, constraint is not linear because it contains t,e sAuare root of x and t,e objecti4e function and first constraint are not because of t,e x1 x" term( B.14 %a& Fsin0 soft2are! 2e find t,at t,e optimal solution is' x1 = )(<5 x" = 5(<5 x3 = 1"(60 :rofit = .143()6 %b& B.1" %a& >,ere is no unused time a4ailable on an- of t,e t,ree mac,ines( 1n additional ,our of time on t,e t,ird mac,ine 2ould be 2ort, .0("6(

Quantitative Module B: Linear Programming

%b& B.1# %a&

1dditional time on t,e second mac,ine 2ould be 2ort, .0() 6 per ,our for a total of .)( 6 for t,e additional 10 ,ours( Let Xij = number of students bused from sector i to sc,ool j( #bjecti4e' minimize total tra4el miles = 5 X AB + X AC + 6 X AE + 0 XBB + 4 XBC + 1" XBE + 4 XCB + 0 XCC +) XCE + ) XDB + " XDC + 5 XDE + 1" XEB + ) XEC + 0 XEE subject to X AB + X AC + X AE = )00 ( number students in sector A) XBB + XBC + XBE = 500 ( number students in sector B) XCB + XCC + XCE = 100 ( number students in sector C ) XDB + XDC + XDE = 00 ( number students in sector D) XEB + XEC + XEE = 400 ( number students in sector E ) X AB + XBB + XCB + XDB + XEB <00 (sc,ool B capacit-) X AC + XBC + XCC + XDC + XEC <00 (sc,ool C capacit-) X AE + XBE + XCE + XDE + XEE <00 (sc,ool E capacit-)

%b&

Solution' X AB = 400 X AE = 300 X BB = 500 XCC = 100 XDC = 00 XEE = 400 7istance = 5!400 @student milesB

B.1$ +ecause t,e decision centers about t,e production of t,e t2o different cabinet models! let' x1 = number of $renc, :ro4incial cabinets produced per dax" = number of 7anis, Modern cabinets produced eac, da>,e eAuations become' #bjecti4e " x1 + "5x" %Maximize re4enue& Subject to 3x1 + " x" 360 (,ours! carpentr-) 1(5x1 + 1x" "00 (,ours! paintin0) 0()5x1 + 0()5 x" 1"5 (,ours! finis,in0) x1 60 ( units! contract ) x" 60 ( units! contract ) x1! x" 0 (nonne0ati4it-) >,e solution is' x1 = 60 ! x" = <0 ! /e4enue = .3<30GdaB.1% Period 1 Problem Data Workers Time Period Required 3 1MD) 1M 3 Solution Hire Solution 2 3

Hire Solution 1 0

Hire Solution 3 3

Instructors Solutions Manual t/a !erations Management

" 3 4 5 6

) 1MD11 1M 11 1MD3 :M 3 :MD) :M ) :MD11 :M 11 :MD) 1M

1" 16 < 11 4

16 0 < " 3 = 30

< ) " < 0 = 30

14 " ) 4 0 = 30

Let xi = number of 2or5ers reportin0 for t,e start of 2or5 in period i! 2,ere i = 1! "! 3! 4! 5! or 6( >,e eAuations become' #bjecti4e' x1 + x" + x3 + x4 + x5 + x6 %Minimize staff size& Subject to' x1 + x" 1" x" + x3 16 x3 + x4 < x4 + x5 11 x5 + x6 4 x1 + x6 3 x1! x" ! x3! x4 ! x5 ! x6 0 9ote t,at t,ree alternate optimal solutions are pro4ided to t,is problem( Hit,er solution could be implemented usin0 onl- 30 staff members( B.1& "0 15 $easible /e0ion x" 10 5 " x1 + 1x" "0 a x" 5 0 " 4 6 10 x1 1" 14 16 1 "0 x

Quantitative Module B: Linear Programming

7efine t,e follo2in0 4ariables' x1 = t,ousands of round tables produced per mont, x" = t,ousands of sAuare tables produced per mont, >,e appropriate eAuations t,en become' #bjecti4e' 10 x1 + x" %minimize ,andlin0 and stora0e costs& Subject to x" 5 (sAuare tabletop contract ) " x1 + 1x" "0 (total labor capacit-) x1! x" 0 (nonne0ati4it-) *ost' #bj = 10 )(5 + 5 = .115 = ; a' % x1 = )(5 ! x" = 5 & x = 0 x = "0 #bj = 10 0 + "0 = .160 ; b' % 1 ! " & >,e optimal solution is to produce )500 round tables and 5000 sAuare tables! for a cost of .115!000( B.2' >,e ori0inal eAuations are' #bjecti4e' < x1 + 1" x" %maximize& Subject to' x1 + x" 10 (0allons! 4arnis,) x1 + " x" 1" (len0t,s! red2ood) x = 2,ere' 1 number of coffee tablesG2ee5 x" = number of boo5casesG2ee5 #ptimal' x1 = ! x" = " ! :rofit = .<6 B.21 10 "nd corner point #ptimal corner 6 b x" 4 1st corner point " a 0 d x1 >,e ori0inal eAuations are' #bjecti4e' 3x1 + 5x" %maximize& Subject to' x" 6 3x1 + " x" 1 x1! x" 0 (nonne0ati4it-) >,e optimal solution is found at t,e intersection of t,e t2o constraints( Sol4in0 for t,e 4alues of x1 and x" at t,e intersection! 2e ,a4e' 4 t, corner point 6 10 c

"

1!

Instructors Solutions Manual t/a !erations Management

x" = 6 1 " x" 1 " 6 6 = = =" 3 3 3 :rofit = 3x1 + 5 x" = 3 " + 5 6 = 6 + 30 = .36 x1 = B.23 Let x1 = t,e number of class 1 containers to be used x" = t,e number of class I containers to be used x3 = t,e number of class > containers to be used >,e appropriate eAuations are' Maximize' x1 + 6 x" + 14 x3 Subject to' " x1 + x" + 3x3 1"0 ( Material ) " x1 + 6 x" + 4 x3 = "40 ( >ime ) x1! x" ! x3 0 (nonne0ati4it-) Fsin0 soft2are 2e find t,at t,e optimal solution is' 1 " x1 = 0 ! x" = 1) ! x3 = 34 ) ) x1 = 0 ! x" = 1)143 ( ! x3 = 34(" 6 :rofit = 5 " 6 = .5 "( 6 )

or and

B.24 %a& %b&

>,e unit profit of t,e air conditioner must fall in t,e ran0e .""(50D.30(00 >,e s,ado2 price for t,e 2irin0 constraint is .5(00! and it ,olds 2it,in t,e ran0e "10D" 0 ,ours(

B.2" Let x1 = number of ne2spaper ads placed x" = number of >J spots purc,ased Ei4en t,at 2e are to minimize cost! 2e ma- de4elop t,e follo2in0 set of eAuations' Minimize' <"5x1 + "000 x" Subject to' 0(04 x1 + 0(05x" 0(40 (cit- exposure) 0(03x1 + 0(03x" 0(60 (exposure in 98 suburbs) 9ote t,at t,e problem is not limited to unduplicated exposure %for example! one person seein0 t,e Sunda- ne2spaper t,ree 2ee5s in a ro2 counts for t,ree exposures&( Solution' x1 = "0 ads! x" = 0 >J spots! cost = .1 !500

B.2# %a&

Minimize' 6 x1a + 5 x1b + 3x1c + x" a + 10 x" b + x"c + 11x3a + 14 x3b + 1 x3c

Quantitative Module B: Linear Programming

11

Subject to' x1a + x" a + x3a = ) x1b + x" b + x3b = 1" x1c + x"c + x3c = 5 x1a + x1b + x1c 6 x" a + x" b + x" c x3a + x3b + x3c 10 %b& Solution' 1ll 4ariables 0 x1b = 6 x" b = 3 x" c = 5 x3a = ) x3b = 3 *ost = ."1< B.2$ Labor Cours

400 300 "00

#ptimal Solution $easible /e0ion

100

:roduction Limit

50

100 150 "00 "50 300 350 400 450 +o-Ks +ic-cles

Maximize' 5) x1 + 55 x" Subject to' x1 + x" 3<0 "(5 x1 + "(4 x" <60 ; % x1 = 3 4 ! x" = 0 & ; % x1 = 0 ! x" = 3<0 & ; % x1 = "40 ! x" = 150 &

#bj = 5) 3 4 + 55 0 = ."1! #bj = 5) 0 + 55 3<0 = ."1!450 #bj = 5) "40 + 55 150 = ."1!<30 =

>,e optimal solution occurs at x1 = "40 bo-Ks bi5es! x" = 150 0irlKs bi5es! producin0 a profit of ."1!<30 Co2e4er! t,e possible optimal solutions are so close in profit t,at sensiti4it- anal-sis is important ,ere( B.2% Let x1 = number of medical patients x" = number of sur0ical patients >,e appropriate eAuations are' Maximize "" 0 x1 + 1515 x"

12

Instructors Solutions Manual t/a !erations Management

Subject to' x1 + 5 x" 3"! 50 (patient da-s a4ailable) 31 ( x1 + "(6 x" 15!000 ( lab tests) 1x1 + " x" )!000 (L ra-s) x" "! 00 (operations) x1! x" 0 (nonne0ati4it-) #ptimal' x1 = ")<0 ! x" = "104 ! :rofit = .<!551!65< or' ")<0 medical patients! "104 sur0ical patients! :rofit .<!551!65< +eds reAuired' Fse' Medical' ")<0 = ""!3"0 Sur0ical' 5 "104 = 10!5"0 3"! 40 ""!3"0 = 6 M 61 beds Medical uses' 3"! 40 10!5"0 = 3"M "< beds Sur0ical uses' 3"! 40 Cere is an alternative approach t,at sol4es directly for t,e number of beds' Maximize re4enues = 104!0"5 x1 + 110!5<5x" Subject to' x1 + x" <0 beds x1 + 5 x" 3"! 50 patients -r 141(44 x1 + 1 <( x" 15!000 lab tests 45(63x1 + 146 x" )!000 x?ra-s )3x" "! 00 operations 2,ere x1 = no( of medical beds = 61(1) x" = no( of sur0ical beds = " ( 3 /e4enue is .<!551!65<! as before

Quantitative Module B: Linear Programming

13