This document contains multiple choice questions and answers about key concepts in linear programming. It covers topics like formulation of linear programming models, including defining variables and constraints in standard form. Specific applications discussed include product mix problems, diet problems, transportation problems, blending problems, and media selection problems. For each question, the document provides the question, answer, page number reference, main heading, and keywords.
Download as DOC, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
815 views
Chapter 4 Linear Programming Modeling Examples
This document contains multiple choice questions and answers about key concepts in linear programming. It covers topics like formulation of linear programming models, including defining variables and constraints in standard form. Specific applications discussed include product mix problems, diet problems, transportation problems, blending problems, and media selection problems. For each question, the document provides the question, answer, page number reference, main heading, and keywords.
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 23
Introduction to Management Science, 10e (Taylor)
Chapter 4 Linear Programming: Modeling Examples
1) When formulating a linear programming problem constraint, strict inequality signs (i.e., less than < or, greater than >) are not allowed. Answer !"#$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation &) When formulating a linear programming model on a spreadsheet, the measure of performance is located in the target cell. Answer !"#$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words spreadsheet solution /) !he standard form for the computer solution of a linear programming problem requires all )ariables to be to the right and all numerical )alues to be to the left of the inequality or equality sign Answer ,A0-$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation, standard form 1) !he standard form for the computer solution of a linear programming problem requires all )ariables to be on the left side, and all numerical )alues to be on the right side of the inequality or equality sign. Answer !"#$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation, standard form 2) ,ractional relationships between )ariables are not permitted in the standard form of a linear program. Answer !"#$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation, standard form 1 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 6) A constraint for a linear programming problem can ne)er ha)e a 7ero as its right8hand8side )alue. Answer ,A0-$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation, standard form 9) !he right hand side of constraints cannot be negati)e. Answer ,A0-$ %iff & 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation :) A systematic approach to model formulation is to first define decision )ariables. Answer !"#$ %iff 1 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation ;) A systematic approach to model formulation is to first construct the ob<ecti)e function before determining the decision )ariables. Answer ,A0-$ %iff 1 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation 14) 5n a linear programming model, a resource constraint is a problem constraint with a greater8 than8or8equal8to (=) sign. Answer ,A0-$ %iff 1 'age "ef (h & re)iew *ain +eading ,ormulation and (omputer -olution .ey words formulation 11) %etermining the production quantities of different products manufactured by a company based on resource constraints is a product mi> linear programming problem. Answer !"#$ %iff & 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words formulation, product mi> problem 1&) 'roduct mi> problems cannot ha)e ?greater than or equal to? (=) constraints. Answer ,A0-$ %iff & 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words product mi> & (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 1/) When using a linear programming model to sol)e the ?diet? problem, the ob<ecti)e is generally to ma>imi7e profit. Answer ,A0-$ %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words ob<ecti)e function 11) When using a linear programming model to sol)e the ?diet? problem, the ob<ecti)e is generally to ma>imi7e nutritional content. Answer ,A0-$ %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words ob<ecti)e function 12) 5n formulating a typical diet problem using a linear programming model, we would e>pect most of the constraints to be related to calories. Answer ,A0-$ %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words formulation, diet e>ample 16) -olutions to diet problems in linear programming are always realistic. Answer ,A0-$ %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words diet e>ample 19) %iet problems usually ma>imi7e nutritional )alue. Answer ,A0-$ %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words diet e>ample 1:) 5n most media selection decisions, the ob<ecti)e of the decision ma@er is to minimi7e cost. Answer ,A0-$ %iff & 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection 1;) 5n a media selection problem, instead of ha)ing an ob<ecti)e of ma>imi7ing profit or minimi7ing cost, generally the ob<ecti)e is to ma>imi7e the audience e>posure. Answer !"#$ %iff & 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection / (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all &4) 0inear programming model of a media selection problem is used to determine the relati)e )alue of each ad)ertising media. Answer ,A0-$ %iff / 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection &1) 5n a media selection problem, ma>imi7ation of audience e>posure may not result in ma>imi7ation of total profit. Answer !"#$ %iff & 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection &&) 5n a balanced transportation model, supply equals demand such that all constraints can be treated as equalities. Answer !"#$ %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation &/) 5n an unbalanced transportation model, supply does not equal demand and supply constraints ha)e A signs. Answer !"#$ %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation &1) !ransportation problems can ha)e solution )alues that are non8integer and must be rounded. Answer ,A0-$ %iff / 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, solution &2) 5n a transportation problem, the supply constraint represents the ma>imum amount of product a)ailable for shipment or distribution at a gi)en source (plant, warehouse, mill). Answer !"#$ %iff 1 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation 1 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all &6) 5n a transportation problem, a supply constraint (the ma>imum amount of product a)ailable for shipment or distribution at a gi)en source) is a greater8than8or equal8to constraint (=). Answer ,A0-$ %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation &9) 5n a transportation problem, a demand constraint for a specific destination represents the amount of product demanded by a gi)en destination (customer, retail outlet, store). Answer !"#$ %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation &:) 5n a transportation problem, a demand constraint (the amount of product demanded at a gi)en destination) is a less8than8or equal8to constraint (A). Answer ,A0-$ %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation &;) Blending problems usually require algebraic manipulation in order to write the 0' in ?standard form.? Answer !"#$ %iff 1 'age "ef 1/18114 *ain +eading %ata $n)elopment Analysis .ey words blending /4) %ata $n)elopment Analysis indicates which type of ser)ice unit ma@es the highest profit. Answer ,A0-$ %iff 1 'age "ef 1148111 *ain +eading A Blend $>ample .ey words blending /1) %ata $n)elopment Analysis indicates the the relati)e CCCCCCCCC of a ser)ice unit compared with others. Answer efficiency or producti)ity %iff & 'age "ef 1148111 *ain +eading %ata $n)elopment Analysis .ey words data en)elopment analysis 2 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all /&) CCCCCCCCCC types of linear programming problems often result in fractional relations between )ariables which must be eliminated. Answer blending %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words blending //) When formulating a linear programming model on a spreadsheet, the measure of performance is located in the CCCCCCCCCC cell. Answer target %iff & 'age "ef 11/ *ain +eading ,ormulation and (omputer -olution .ey words spreadsheet solution /1) When the CCCCCCCCCC command is used in an $>cel spreadsheet, all the )alues in a column (or row) are multiplied by the )alues in another column (or row) and then summed. Answer -#*'"D%#(! %iff & 'age "ef 119 *ain +eading ,ormulation and (omputer -olution .ey words spreadsheet solution /2) ,or product mi> problems, the constraints are usually associated with CCCCCCCCCC. Answer resources or time %iff & 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words product mi> /6) !he CCCCCCCCCC for the computer solution of a linear programming problem requires all )ariables on the left side, and all numerical )alues on the right side of the inequality or equality sign. Answer standard form %iff & 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words formulation, constraint /9) !he ob<ecti)e function of a diet problem is usually to CCCCCCCCCC sub<ect to nutritional requirements. Answer minimi7e costs %iff 1 'age "ef 116811; *ain +eading A %iet $>ample .ey words diet problem 6 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all /:) 5n)estment problems ma>imi7e CCCCCCCCCC. Answer return on in)estments %iff 1 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words in)estment /;) 5n a media selection problem, instead of ha)ing an ob<ecti)e of ma>imi7ing profit or minimi7ing cost, generally the ob<ecti)e is to ma>imi7e the CCCCCCCCCC. Answer audience e>posure %iff & 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection 14) 5n CCCCCCCCCC problem, ma>imi7ation of audience e>posure may not result in ma>imi7ation of total profit. Answer media selection %iff / 'age "ef 1&181&9 *ain +eading *ar@eting $>ample .ey words mar@eting problem, media selection 11) 5n a balanced transportation model, supply equals CCCCCCCCCC . Answer demand %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation 1&) 5n a CCCCCCCCCC transportation problem, supply e>ceeds demand. Answer unbalanced %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, formulation !he owner of (hips etc. produces & @inds of chips 0ime (0) and Einegar (E). +e has a limited amount of the / ingredients used to produce these chips a)ailable for his ne>t production run 1:44 ounces of salt, ;644 ounces of flour, and &444 ounces of herbs. A bag of 0ime chips requires & ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produceF while a bag of Einegar chips requires / ounces of salt, : ounces of flour, and & ounces of herbs. 'rofits for a bag of 0ime chips are G4.14, and for a bag of Einegar chips G4.24. 9 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 1/) What is the formulation for this problemH Answer *AI J K 4. 10 L 4.2E s.t. &0 L /E A 1:44 60 L :E A ;644 10 L &E A &444 %iff 1 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words computer solution 11) ,or the production combination of :44 bags of 0ime and 644 bags of Einegar, which resource is not completely used up and how much is remainingH Answer salt only, 1144 ounces remaining %iff 1 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words slac@, computer solution 12) ,or the production combination of :44 bags of 0ime and 644 bags of Einegar, which resource is not completely used up and how much is remainingH Answer salt only, 1144 ounces remaining %iff 1 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words slac@, computer solution A croissant shop produces & products bear claws (B) and almond filled croissants ((). $ach bear claw requires 6 ounces of flour, 1 ounce of yeast, and & !- (tablespoons) of almond paste. An almond8 filled croissant requires / ounces of flour, 1 ounce of yeast, and 1 !- of almond paste. !he company has 6644 ounces of flour, 1144 ounces of yeast, and 1:44 !- of almond paste a)ailable for todayMs production run. !he shop must produce at least 144 almond filled croissants due to customer demand. Bear claw profits are &4 cents each, and almond8filled croissant profits are /4 cents each. 16) !his represents what type of linear programming applicationH Answer product mi> %iff 1 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words computer solution : (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 19) What is the formulation for this problemH Answer *AI J K G.&4B L G./4( s.t. 6B L /( A 6644 1B L 1( A 1144 &B L 1( A 1:44 ( = 144 %iff 1 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words formulation, constraint 1:) ,or the production combination of 644 bear claws and :44 almond filled croissants, how much flour and almond paste is remainingH Answer flour K 4 ounces and almond paste K 4 ounces %iff 1 'age "ef 1118116 *ain +eading A 'roduct *i> $>ample .ey words slac@, computer solution 1;) 5f I i< K the production of product i in period <, write an e>pression to indicate that the limit on production of the companyMs / products in period & is equal to 144. Answer I 1& L I && L I /& A 144 %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation problem, supply constraint ; (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 24) -mall motors for garden equipment is produced at 1 manufacturing facilities and needs to be shipped to / plants that produce different garden items (lawn mowers, rototillers, leaf blowers). !he company wants to minimi7e the cost of transporting items between the facilities, ta@ing into account the demand at the / different plants, and the supply at each manufacturing site. !he table below shows the cost to ship one unit between each manufacturing facility and each plant, as well as the demand at each plant and the supply at each manufacturing facility. Write the formulation for this problem. Answer *5N J K 1> 1A L 1.2> 1B L /.&> 1( L /.2> &A L /> &B L1> &( L 1> /A L /.2> /B L 1.&2> /( s.t. > 1A L
> 1B L> 1( K &44 > &A L
> &B L> &( K &44 > /A L
> /B L> /( K /44 > 1A L
> &A L> /A K &24 > 1B L
> &B L> /B K 124 > 1( L
> &( L> /( K &44 %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words computer solution, transportationOdistribution 21) Puic@brush 'aint (ompany ma@es a profit of G& per gallon on its oil8base paint and G/ per gallon on its water8base paint. Both paints contain two ingredients, A and B. !he oil8base paint contains ;4 percent A and 14 percent B, whereas the water8base paint contains /4 percent A and 94 percent B. Puic@brush currently has 14,444 gallons of ingredient A and 2,444 gallons of ingredient B in in)entory and cannot obtain more at this time. !he company wishes to use linear programming to determine the appropriate mi> of oil8base and water8base paint to produce to ma>imi7e its total profit. +ow much oil based and water based paint should the Puic@brush ma@eH Answer ;169 gallons of water based paint and 2:// gallons of oil based paint %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words blending 14 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all Andy !yre manages !yreMs Wheels, 5nc. Andy has recei)ed an order for 1444 standard wheels and 1&44 delu>e wheels ne>t month, and for 924 standard wheels and 1444 delu>e wheels the following months. +e must fill all the orders. !he cost of regular time production for standard wheels is G&2 and for delu>e wheels, G14. D)ertime production costs 24Q more. ,or each of the ne>t two months there are 1444 hours of regular time production and 244 hours of o)ertime production a)ailable. A standard wheel requires .2 hours of production time and a delu>e wheel, .6 hours. !he cost of carrying a wheel from one month to the ne>t is G&. 2&) %efine the decision )ariables and ob<ecti)e function for this problem. Answer %efine the decision )ariables - 1" K number of standard wheels produced in month 1 on regular time production - 1D K number of standard wheels produced in month 1 on o)ertime production - &" K number of standard wheels produced in month & on regular time production - &D K number of standard wheels produced in month & on o)ertime production % 1" K number of delu>e wheels produced in month 1 on regular time production % 1D K number of delu>e wheels produced in month 1 on o)ertime production % &" K number of delu>e wheels produced in month & on regular time production % &D K number of delu>e wheels produced in month & on o)ertime production R 1 K number of standard wheels stored from month 1 to month &. R & K number of delu>e wheel s stored from month 1 to month &. *5N &2 - 1" L /9.2 - 1D L14 % 1" L 64 % 1D L &2 - &" L /9.2 - &D L14 % &" L 64 % &D L& R 1
L& R & %iff & 'age "ef 1/68112 *ain +eading *ultiperiod -cheduling .ey words linear program multiperiod scheduling 2/) Write the constraints for this problem. Answer - 1" L - 1D 8 R 1 K 1444 % 1" L % 1D 8 R & K 1&44 - &" L - &D L R 1 K 924 % &" L % &D L R & K 1444 .2 - 1" L .6 % 1" A 1444 .2 - 1D L .6 % 1D A 244 .2 - &" L .6 % &" A 1444 .2 - &D L .6 % 1&D A 24 %iff & 'age "ef 1/68112 *ain +eading *ultiperiod -cheduling .ey words linear program multiperiod scheduling 11 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all Bullseye -hirt (ompany ma@es three types of shirts Athletic, Earsity, and -urfer. !he shirts are made from different combinations of cotton and rayon. !he cost per yard of cotton is G2 and the cost for rayon is G9. Bullseye can recei)e up to 1,444 yards of cotton and /,444 yards of rayon per wee@. !he table below shows rele)ant manufacturing information -hirt !otal Rards of fabric per shirt ,abric requirement *inimum wee@ly contracts *a>imum %emand -elling 'rice Athletic 1.44 at least 64Q cotton 244 644 G/4 Earsity 1.&4 no more than /4Q rayon 624 :24 G14 -urfer 4.;4 As much as :4Q cotton /44 944 G/6 21) Assume that the decision )ariables are defined as follows A K total number of athletic shirts produced E K total number of )arsity shirts produced - K total number of surfer shirts produced ( K yards of cotton purchased " K yards of rayon purchased Ii< K yards of fabric i (( or ") blended into shirt S (A, E or -) Write the ob<ecti)e function. Answer ma> /4 A L 14 E L /6 - 8 2( 8 9" %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words ob<ecti)e function, model construction 22) Write the constraints for the fabric requirements. Answer ,orm of constraints !otal yards used is greater than (or less than) total yards required > (Q fabric required) shirts produced I (A = 4.6 A I E" A4./6E I -( A 4.9& - %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words blending 1& (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 26) Write the constraints for the total number of shirts of each style produced. Answer ,orm of constraint number of shirts produced K (total yards used to ma@e the shirt)O (yardsOshirt) A K( I (A L I "A )O1 E K( I (E L I "E )O1.& - K( I (- L I "- )O4.; -tandard form A 8I (A 8 I "A ) K 4 1.& E 8 I (E 8 I "E K4 4.; - 8 I (- 8 I "- K4 %iff / 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words blending 29) .itty .ennels pro)ides o)ernight lodging for a )ariety of pets. An attracti)e feature is the quality of care the pets recei)e, including well balanced nutrition. !he @ennelMs cat food is made by mi>ing two types of cat food to obtain the ?nutritionally balanced cat diet.? !he data for the two cat foods are as follows .itty .ennels wants to be sure that the cats recei)e at least 2 ounces of protein and at least / ounces of fat per day. What is the cost of this plan, and how much fat and protein do the cats recei)eH Answer (ost is G/.24, which uses 16 cans of meow munch and & cans of feline fodder. %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words diet 1/ (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 2:) A credit union wants to ma@e in)estments in the following !he firm will ha)e G&,244,444 a)ailable for in)estment during the coming year. !he following restrictions apply T "is@ free securities may not e>ceed /4Q of the total funds, but must comprise at least 2Q of the total. T -ignature loans may not e>ceed 1&Q of the funds in)ested in all loans ()ehicle, consumer, other secured loans, and signature loans) T (onsumer loans plus other secured loans may not e>ceed the )ehicle loans T Dther secured loans plus signature loans may not e>ceed the funds in)ested in ris@ free securities. +ow should the G&,244,444 be allocated to each alternati)e to ma>imi7e annual returnH What is the annual returnH Answer %iff / 'age "ef 11;81&1 *ain +eading 5n)estment $>ample .ey words in)estment 2;) When systematically formulating a linear program, the first step is A) (onstruct the ob<ecti)e function B) ,ormulate the constraints () 5dentify the decision )ariables %) 5dentify the parameter )alues $) 5dentify a feasible solution Answer ( %iff & 'age "ef 11& *ain +eading ,ormulation .ey words formulation 11 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 64) !he following types of constraints are ones that might be found in linear programming formulations 1. A &. K /. > A) 1 and & B) & and / () 1 and / %) all of the abo)e Answer A %iff & 'age "ef "e)iew *ain +eading A 'roduct *i> $>ample .ey words formulation, constraint 61) Assume that > & , > 9 and > : are the dollars in)ested in three different common stoc@s from New Ror@ stoc@ e>change. 5n order to di)ersify the in)estments, the in)esting company requires that no more than 64Q of the dollars in)ested can be in ?stoc@ two?. !he constraint for this requirement can be written as A) > & = .64 B) > & = .64 (> & L > 9 L > : ) () .1> & 8 .6> 9 8 .6> : A 4 %) .1> & 8 .6> 9 8 .6> : = 4 $) 8.1> & L .6> 9 L .6> : A 4 Answer ( %iff / 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words formulation 12 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 6&) !he owner of Blac@ Angus "anch is trying to determine the correct mi> of two types of beef feed, A and B which cost 24 cents and 92 cents per pound, respecti)ely. ,i)e essential ingredients are contained in the feed, shown in the table below. !he table also shows the minimum daily requirements of each ingredient. 5ngredient 'ercent per pound in ,eed A 'ercent per pound in ,eed B *inimum daily requirement (pounds) 1 &4 &1 /4 & /4 14 24 / 4 /4 &4 1 &1 12 64 2 14 &4 14 !he constraint for ingredient / is A) .2A L .92B K &4 B) ./B K &4 () ./ BA &4 %) ./B = &4 $) A L B K ./(&4) Answer % %iff & 'age "ef 116811; *ain +eading A %iet $>ample .ey words solution !he owner of (hips etc. produces & @inds of chips 0ime (0) and Einegar (E). +e has a limited amount of the / ingredients used to produce these chips a)ailable for his ne>t production run 1:44 ounces of salt, ;644 ounces of flour, and &444 ounces of herbs. A bag of 0ime chips requires & ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produceF while a bag of Einegar chips requires / ounces of salt, : ounces of flour, and & ounces of herbs. 'rofits for a bag of 0ime chips are G4.14, and for a bag of Einegar chips G4.24. 6/) ,or the production combination of :44 bags of 0ime and 644 bags of Einegar, which of the three resources is (are) not completely usedH A) flour only B) salt only () herbs only %) salt and flour $) salt and herbs Answer B %iff & 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words solution, slac@ 16 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 61) What is the constraint for saltH A) 60 L :E A 1:44 B) 10 L &E A 1:44 () /0 L &E A 1:44 %) &0 L /E A 1:44 $) &0 L 1E A 1:44 Answer % %iff & 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words formulation, constraint 62) Which of the following is not a feasible production combinationH A) 40 and 4E B) 40 and 1444E () 14440 and 4E %) 40 and 1&44E Answer % %iff 1 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words formulation, feasibility 66) 5f I ab K the production of product a in period b, then to indicate that the limit on production of the companyMs ?/? products in period & is 144, A) I /& A 144 B) I &1 L I && L I &/ A 144 () I 1& L I && L I /& A 144 %) I 1& L I && L I /& = 144 $) I &/ A 144 Answer ( %iff & 'age "ef 1118116 *ain +eading 'roduct *i> $>ample .ey words formulation, constraint 69) Balanced transportation problems ha)e the following type of constraints A) = B) A () K %) < $) None of the abo)e Answer ( %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words formulation, constraint 19 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 6:) (ompared to blending and product mi> problems, transportation problems are unique because A) !hey ma>imi7e profit. B) !he constraints are all equality constraints with no ?A? or ?=? constraints. () !hey contain fewer )ariables. %) !he solution )alues are always integers. $) All of the abo)e are !rue. Answer % %iff & 'age "ef 1&981/1 *ain +eading A !ransportation $>ample .ey words transportation 6;) !he production manager for the -ofty soft drin@ company is considering the production of & @inds of soft drin@s regular and diet. !wo of her resources are production time (: hours K 1:4 minutes per day) and syrup (1 of the ingredients) limited to 692 gallons per day. !o produce a regular case requires & minutes and 2 gallons of syrup, while a diet case needs 1 minutes and / gallons of syrup. 'rofits for regular soft drin@ are G/.44 per case and profits for diet soft drin@ are G&.44 per case. What is the time constraintH A) &" L 1% A 1:4 B) &% L 1" A 1:4 () &" L /% A 1:4 %) /" L &% A 1:4 $) /" L 1% A 1:4 Answer A %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words formulation, constraint 94) A croissant shop produces & products bear claws (B) and almond filled croissants ((). $ach bear claw requires 6 ounces of flour, 1 ounce of yeast, and & !- of almond paste. An almond filled croissant requires / ounces of flour, 1 ounce of yeast, and 1 !- of almond paste. !he company has 6644 ounces of flour, 1144 ounces of yeast, and 1:44 !- of almond paste a)ailable for todayMs production run. Bear claw profits are &4 cents each, and almond filled croissant profits are /4 cents each. What is the optimal daily profitH A) G/:4 B) G144 () G1&4 %) G114 $) G1:4 Answer A %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words computer solution 1: (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 91) !he production manager for the -ofty soft drin@ company is considering the production of & @inds of soft drin@s regular and diet. !wo of her resources are constraint production time (: hours K 1:4 minutes per day) and syrup (1 of her ingredient) limited to 692 gallons per day. !o produce a regular case requires & minutes and 2 gallons of syrup, while a diet case needs 1 minutes and / gallons of syrup. 'rofits for regular soft drin@ are G/.44 per case and profits for diet soft drin@ are G&.44 per case. What is the optimal daily profitH A) G&&4 B) G&94 () G/&4 %) G1&4 $) G2&4 Answer % %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words computer solution 9&) 0et > i< K gallons of component i used in gasoline <. Assume that we ha)e two components and two types of gasoline. !here are :,444 gallons of component 1 a)ailable, and the demand gasoline types 1 and & are 11,444 and 11,444 gallons respecti)ely. Write the supply constraint for component 1. A) > &1 L > && A :444 B) > 1& L > && = :444 () > 11 L > 1& A :444 %) > &1 L > && = :444 $) > 11 L > 1& = :444 Answer ( %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words formulation 1; (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 9/) 0et > i< K gallons of component i used in gasoline <. Assume that we ha)e two components and two types of gasoline. !here are :,444 gallons of component 1 a)ailable, and the demand gasoline types 1 and & are 11,444 and 11,444 gallons respecti)ely. Write the demand constraint for gasoline type 1. A) > &1 L > && K 11444 B) > 1& L > && K 11444 () > 11 L > &1 A 11444 %) > 11 L > &1 K 11444 $) > 11 L > 1& = 11444 Answer % %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words formulation 91) 0et > i< K gallons of component i used in gasoline <. Assume that we ha)e two components and two types of gasoline. !here are :,444 gallons of component 1 a)ailable, and the demand gasoline types 1 and & are 11,444 and 11,444 gallons respecti)ely. Write the constraint stating that the component 1 cannot account for more than /2Q of the gasoline type 1. A) > 11 L > 1& (./2)(> 11 L > &1 ) B) > 11 ./2 (> 11 L > &1 ) () > 11 ./2 (> 11 L > 1& ) %) 8.62> 11 L ./2> &1 A 4 $) .62> 11 8 ./2> &1 A 4 Answer $ %iff / 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words formulation &4 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 92) Puic@brush 'aint (ompany is de)eloping a linear program to determine the optimal quantities of ingredient A and ingredient B to blend together to ma@e oil based and water based paint. !he oil8base paint contains ;4 percent A and 14 percent B, whereas the water8base paint contains /4 percent A and 94 percent B. Puic@brush currently has 14,444 gallons of ingredient A and 2,444 gallons of ingredient B in in)entory and cannot obtain more at this time. Assuming that > represents the number of gallons of oil based paint, and y represents the gallons of water based paint, which constraint is correctly represents the constraint on ingredient AH A) .;A L .1B A 14,444 B) .;> L .1y A 14,444 () ./> L .9y A 14,444 %) .;> L ./y A 14,444 $) .1> L .;y A 14,444 Answer % %iff & 'age "ef 1/181/6 *ain +eading A Blend $>ample .ey words blend 96) A systematic approach to model formulation is to first A) construct the ob<ecti)e function B) de)elop each constraint separately () define decision )ariables %) determine the right hand side of each constraint $) all of the abo)e Answer ( %iff & 'age "ef 11& *ain +eading A *ultiperiod -cheduling $>ample .ey words model formulation 99) 0et r < K regular production quantity for period <, o < Ko)ertime production quantity in period <, i i K in)entory quantity in period <, and d i K demand quantity in period < (orrect formulation of the demand constraint for a multi8period scheduling problem is A) r < L
o < L i & 8 i 1 = d i B) r < L
o < L i 1 8 i & = d i () r < L
o < L i 1 8 i & A d i %) r < 8
o < 8 i 1 L i & = d i $) r < L
o < L i & 8 i 1 A d i Answer A %iff & 'age "ef 1/68114 *ain +eading A *ultiperiod -cheduling $>ample .ey words formulation, constraint &1 (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all 9:) 5n a multi8period scheduling problem the production constraint usually ta@es the form of A) beginning in)entory L demand 8 production K ending in)entory B) beginning in)entory 8 demand L production K ending in)entory () beginning in)entory 8 ending in)entory L demand K production %) beginning in)entory 8 production 8 ending in)entory K demand $) beginning in)entory L demand L production K ending in)entory Answer B %iff & 'age "ef 1/68114 *ain +eading A *ultiperiod -cheduling $>ample .ey words model formulation, multi8period scheduling problem 9;) !he type of linear program that compares ser)ices to indicate which one is less producti)e or inefficient is called A) product mi> B) data en)elopment analysis () mar@eting %) blending $) multi period scheduling Answer B %iff & 'age "ef 114 *ain +eading %ata $n)elopment Analysis .ey words formulation 5n a portfolio problem, I 1 , I & , and I / represent the number of shares purchased of stoc@s 1, &, an / which ha)e selling prices of G12, G19.&2, and G114, respecti)ely. !he in)estor has up to G24,444 to in)est. :4) !he stoc@bro@er suggests limiting the in)estments so that no more than G14,444 is in)ested in stoc@ & or the total number of shares of stoc@s & and / does not e>ceed /24, whiche)er is more restricti)e. +ow would this be formulate as a linear programming constraintH A) I & A 14444 I & L I / A/24 B) 14,444 I & A /24I & L /24I / () 19.&2I & A14,444 I & L I / A /24 %) 19.&2I & A14,444 19.&2 I & L 114I / A /24 Answer ( %iff & 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words in)estment && (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all :1) An appropriate part of the model would be A) 12I 1 L 19.&2I & L114 I / A 24,444 B) *AI 12I 1 L 19.&2I & L 114I / () I 1 L I & LI / A 24,444 %) *AI 24(12)I 1 L 24 (19.&2)I & L 24 (114)I / Answer A %iff & 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words in)estment :&) !he e>pected returns on in)estment of the three stoc@s are 6Q, :Q, and 11Q. An appropriate ob<ecti)e function is A) *AI .46I 1 L.4:I & L.11I / B) *AI .46(12)I 1 L.4:(19.&2)I & L.11(114)I / () *AI 12I 1 L 19.&2I & L.114I / %) *AI (1O.46)I 1 L.(1O4:)I & L (1O.11)I / Answer B %iff & 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words in)estment :/) !he in)estor stipulates that stoc@ 1 must not account for more than /2Q of the number of shares purchased. Which constraint is correctH A) I 1 A 4./2 B) I 1 K 4./2 (24444) () I 1 A
4./2(I 1 L I & L.I / ) %) I 1 K
4./2(I 1 L I & L.I / ) Answer ( %iff & 'age "ef 11;81&1 *ain +eading An 5n)estment $>ample .ey words in)estment &/ (opyright 3 &414 'earson $ducation, 5nc. 'ublishing as 'rentice +all