Data,Model and Decision智慧樹知到課后章節(jié)答案2023年下華南理工大學(xué)

Data,ModelandDecision智慧樹知到課后章節(jié)答案2023年下華南理工大學(xué)華南理工大學(xué)

第一章測(cè)試

Thepurposeofbreak-evenanalysisistodeterminethenumberofunitsofaproducttosellorproducethatwillequatetotalrevenuewithtotalcost.Atthebreak-evenpoint,theprofitis()zero.

A:equalto

B:lessthan

C:morethan

答案:equalto

Ingeneral,anincreaseinvariablecostswill（）thebreak-evenpoint,allotherthingsheldconstant.

A:increase

B:decrease

C:notchange

答案:increase

It’simportanttomakefulluseoftechniquesinmanagementscienceprocess,whichtechniquesarecommonlyusedforthepurposeofdecision-making（）?

A:Decisionanalysis

B:Transportationandassignment

C:Projectmanagement(likeCPM/PERT)

D:Linearprogrammingmodels

答案:Decisionanalysis

;Transportationandassignment

;Projectmanagement(likeCPM/PERT)

;Linearprogrammingmodels

Manufacturingcompaniesdeveloplinearprogrammingmodelstohelpdecidehowmanyunitsofdifferentproductstheyshouldproducetomaximizetheirprofit(orminimizetheircost),givenscarceresourcessuchascapital,labor,andfacilities.(）

A:錯(cuò)B:對(duì)

答案:對(duì)

第二章測(cè)試

Ifthegraphicalmethodisusedtosolvethelinearprogrammingproblem,thenumberofdecisionvariablesshouldbe().

A:2

B:≤5

C:≥3

D:Nolimitation

答案:2

Inthelinearprogrammingmodel,()restrictthedecisionvariablestozeroorpositivevalues.

A:Nonnegativityconstraints

B:Resourcerequirements

C:Objectivefunction

D:Thefeaturesofvariables

答案:Nonnegativityconstraints

Iftheoptimalsolutionofthelinearprogrammingproblemisreachedattwoverticesoffeasibledomainatthesametime,thentheoptimalsolutionhas().

A:Astraightlineconnectingtwovertices

B:Alinesegmentconnectingtwovertices

C:It’simpossible

D:Twosolutions

答案:Alinesegmentconnectingtwovertices

ThefollowingfeaturesofstandardformofLinearprogrammingarecorrect（）.

A:Thedecisionvariablesarenotequaltozero

B:Thedecisionvariablesarenonnegative

C:Thereisnolimittothesymbolofdecisionvariables

D:Noneofaboveistrue

答案:Thedecisionvariablesarenonnegative

Theoptimalsolutionofthelinearprogrammingproblemmustbethefeasiblesolution.（）

A:對(duì)B:錯(cuò)

答案:對(duì)

第三章測(cè)試

Giventhatalinearprogrammingproblemisasfollowing,theoptimalsolutionofdualproblemis().

A:Y=(1,0,3/5,4/5)

B:Y=(4/5,3/5,1,0)

C:Y=(0,3/5,1,4/5)

D:Y=(0,3/5,4/5,1)

答案:Y=(4/5,3/5,1,0)

Thefollowingstatementsof100%ruleofobjectivefunctioncoefficientiscorrect（）.

A:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreaseequals100%,theoptimalsolutionwon’tchange.

B:Onlycanincreasingcoefficientsfollowthis100%rule.

C:Noneofaboveiscorrect.

D:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.

答案:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.

Thedualityofadualproblemisnotnecessarilytheprimalproblem.(）

A:對(duì)B:錯(cuò)

答案:錯(cuò)

Shadowpriceisactuallyamarginalprice.(）

A:錯(cuò)B:對(duì)

答案:對(duì)

Iftheprimalproblemoflinearprogrammingaddsaconstraint,itisequivalenttoaddingavariabletothedualproblem.（）

A:對(duì)B:錯(cuò)

答案:對(duì)

第四章測(cè)試

PleasesolvethefollowingintegerproblemandgetthemaximumZ=().

A:Z=3

B:Z=4

C:Z=5

答案:Z=4

Adrillingteamneedstodetermine5explorationwellsfrom10alternativewellstominimizethetotaldrillingcost.If10wellsarerepresentedbys1,s2,…s10,thecostsbeingc1,c2,…c10,oneofconstraintsis:iftheplanchoosess3ors4,thens5cannotbeselectedandviceversa.Weseta0-1variable,xj(j=1,2,…10),thenthisconstraintcanbeexpressed()

A:x3+x4+x5≤1

B:x3+x5≥1,x4+x5≥1

C:x3+x5=1,x4+x5=1

D:x3+x5≤1,x4+x5≤1

答案:x3+x5≤1,x4+x5≤1

Branch-and-cuttechniqueisonlysuitableforsolvingpureintegerprogrammingproblems.(）

A:錯(cuò)B:對(duì)

答案:錯(cuò)

Simplyroundingoffnon-integersimplexsolutionvaluesformodelsrequiringintegersolutionsisnotalwaysappropriate.Roundingcanoftenleadtosuboptimalresults.(）

A:錯(cuò)B:對(duì)

答案:對(duì)

Assignmentproblemdoesn’tbelongto0-1integerprogrammingproblem.(）

A:錯(cuò)B:對(duì)

答案:錯(cuò)

第五章測(cè)試

Inthetransportationmodel,thenumberofdemandplacesandsupplyplacesisnandmrespectively.Thenumberofconstraintsis().

A:m*n

B:m+n-1

C:m+n

D:m*n-1

答案:m+n

Theincorrectstatementoftransportationprobleminthefollowingstatementsis().

A:Thenumberofconstraintsequalsthenumberofbasevariables.

B:Itmusthavetheoptimalsolution.

C:Itcanutilizethesimplexalgorithmoflinearprogrammingtosolve.

D:Itcanutilizethetabularmethodtosolve.

答案:Thenumberofconstraintsequalsthenumberofbasevariables.

Whenweadjustthetransportationschemebyclosed-loopmethod,theruleisthatthemaximumvalueoftransportationincreasinginthecellequalstheminimumvalueofthenumeralcelltobereduced,whichisto().

A:makesurethatthetrafficvolumedoesnotappearnegative.

B:makesurethatthebalanceofproductionandsellingcanberealized.

C:makesurethattheoptimalschemecanberealized.

D:makesurethatthefreightcostcanbereducedtoacertainextent.

答案:makesurethatthetrafficvolumedoesnotappearnegative.

AcompanytransportsamaterialfromthreesupplyplacesA1,A2,andA3toB1,B2,andB3.Allinformationoftransportationvolumeislistedasthefollowingtable.Themiddlecellsarethepriceofunittransportationvolume.Fortheoptimalschemeofminimumcost,weutilizethetabularmethodforsolvingitandwecalculatethetestnumberofA2B3thatistheminimumpriceofunitvolumeinnon-basicvariables().

A:1

B:2

C:-1

D:7

答案:-1

Forthetransportationproblemofminimumvalue,theoptimaltransportationschemecanbegainedwhenthetestnumbersarelessthanorequaltozero.(）

A:對(duì)B:錯(cuò)

答案:錯(cuò)

第六章測(cè)試

Intermsofgraphtheory,thefollowingstatementisincorrect().

A:Nodesinatreemaynotbeconnectedtoeachother.

B:Ifthereisonemoreedgeinthetree,theremustbeacircle.

C:Ifatreehasnnodes,thenumberofitsedgesisn-1.

D:Ifanedgeisremovedfromatree,thetreewon’tbeconnected.

答案:Nodesinatreemaynotbeconnectedtoeachother.

Thereare()oddverticesinthegraph.

A:2B:1C:4

D:3

答案:2

InordertogettheminimalspanningtreeofthisgraphbyKruskalAlgorithm,thenumberofremainingedgesis(D),andinascendingorderofweight,weshouldremaintheedge()withtheweightof5inordertoavoidcircle.

A:6;(v2,v3)

B:6;(v1,v4)

C:5;(v3,v4)

D:5;(v2,v3)

答案:5;(v2,v3)

Dijkstraalgorithmisonlyusedtocalculatetheshortestroutefromthefirstvertexv1toothervertices.(）

A:對(duì)B:錯(cuò)

答案:錯(cuò)

TheBellmanalgorithmcanbeusedtofindouttheshortestroutefromv1toanyvertex,eventheweightbeingnegative.（）

A:對(duì)B:錯(cuò)

答案:對(duì)

第七章測(cè)試

IntheGanttcharts,thehorizontalaxisrepresentstimeandtheverticalaxisrepresentseachactivity.（）

A:對(duì)B:錯(cuò)

答案:對(duì)

Thecriticalactivityincriticalpathis().

A:theendactivity

B:themostimportantactivity

C:thelongestdurationactivity

D:theearliestbeginningactivity

答案:thelongestdurationactivity

Pleaseindicatethecriticalpathinthefollowingnetwork(everynumberbelowtheactivityrepresentsitsduration).()

A:A→B→E→G

B:A→B→D→F→G

C:A→C→F→G

答案:A→C→F→G

AvirtualactivityisusedinanAOAnetworktoshowanactualpassageoftime,notjusttheprecedencerelationship.(）

A:錯(cuò)B:對(duì)

答案:錯(cuò)

Whenwecarryonthecalculationstepsforthelowestcostscheduleinnetworks,nomatterhow