number350meansthat oneunitofproduct1contributes$350totheobjectivefunction. oneunitofproduct1uses350hoursoflabor. theproblemisunbounded. theproblemhasnoobjectivefunction. b ANSWER: number10,000represents aprofitcontributionofoneunitofproduct1. oneunitofproduct1uses10,000hoursoflabor. thereare10,000hoursoflaboravailableforuse. theproblemhasnoobjectivefunction. c ANSWER: Foraninfeasibleproblem,thefeasibleregion: isanemptyset hasinfinitenumberoffeasiblesolutions hasonlyoneoptimalsolution isunbounded a ANSWER: Ifaproblemhasinfinitenumbersolutions,theobjectivefunction isparalleltooneofthebindingconstraints. goesthroughexactlyonecornerpointofthefeasibleregion. cannotidentifyafeasibleregion. isinfeasible. a ANSWER: Supposethataconstraint2x1+3x2≥600isbinding.Then,aconstraint4x1+6x2≥1,800is redundant. binding. limiting. infeasible. a ANSWER: a.f(X1,X2,X3,X4)≤ b1 b.f(X1,X2,X3,X4)≥b1
number350meansthat oneunitofproduct1contributes$350totheobjectivefunction. oneunitofproduct1uses350hoursoflabor. theproblemisunbounded. theproblemhasnoobjectivefunction. ANSWER: b number10,000represents aprofitcontributionofoneunitofproduct1. oneunitofproduct1uses10,000hoursoflabor. thereare10,000hoursoflaboravailableforuse. theproblemhasnoobjectivefunction. ANSWER: c Foraninfeasibleproblem,thefeasibleregion: isanemptyset hasinfinitenumberoffeasiblesolutions hasonlyoneoptimalsolution isunbounded ANSWER: a Ifaproblemhasinfinitenumbersolutions,theobjectivefunction isparalleltooneofthebindingconstraints. goesthroughexactlyonecornerpointofthefeasibleregion. cannotidentifyafeasibleregion. isinfeasible. ANSWER: a Supposethataconstraint2x1+3x2≥600isbinding.Then,aconstraint4x1+6x2≥1,800is redundant. binding. limiting. infeasible. ANSWER: a a.f(X1,X2,X3,X4)≤ b1 b.f(X1,X2,X3,X4)≥b1