雨课堂学堂在线学堂云Operations Research(江西财经大学)单元测试考核答案

第1题Asascience,operationsresearchwasbornin(

)A1940sB1930sC1920sD1810s第1题ThemathematicalmodelofLPconsistsofthreeparts(

)Adecisionvariables,objectivefunctions,constraintsBdecisionvariable,non-negativeconstraints,deviationvariablesCobjectivevariables,decisionvariables,deviationvariablesDbasicequations,resourceconstraintsandgoalconstraints第2题Inthegeneralmodeloflinearprogramming,theunconstrainedvariablescanbereplacedbythe()oftwononnegativevariablesAdifferenceBsumCproductDquotient第3题Aconstraintconditionisaddedtothelinearprogrammingmodel,andthescopeoffeasibleregionwillbe()generally.A

increaseBindefiniteCinvariableDdecreaseAssignment第1题Ifaconstraintisaddedtothelinearprogrammingmodel,thefeasibleregionwillgenerallybereduced;whereasaconstraintisreduced,thefeasibleregionwillgenerallybeexpanded()第2题Inlinearprogrammingmodel,theobjectivefunctionandallconstraintsarealllinear()第3题Theintegerproblemisactuallyalinearprogrammingproblem

()Assignment第1题(

)A-2B-6C-45/4D-7第2题Foralinearmodel,maxZ=4x1+x2，4x1+3x2≤24，x2≤10，x1,x2≥0,then（

）AThereareunboundedsolutionsBTherearenofeasiblesolutionsCThereareuniqueoptimalsolutionsDTherearemultiplesolutions第3题Aftertheminimizationlinearprogramming(minZ)isstandardizedtothemaximizationprogramming(maxZ),thentheoptimalsolutionsoftheoriginalprogrammingandthestandardformprogrammingare(

B)

AThereisanegativesigninthedifferenceBsameCnodefiniterelationshipDdifferentAssignment第1题(

)第2题Ifthereisanoptimalsolutiontothelinearprogrammingproblem,theoptimalsolutionmustcorrespondtoapointontheboundaryofthefeasibleregion()

第3题()第4题Eachbasicsolutionoflinearprogrammingproblemcorrespondstoacorner-pointoffeasibleregion(

)Assignment第1题Thegraphicmethodandthesimplexmethodhavedifferentformsofsolution,buttheyareconsistentexplainedbygeometrically.

()第2题(

)第3题Theiterativecalculationprocessofsimplexmethodistotransformfromonefeasiblesolutiontoanotherfeasiblesolutionwithlargerobjectivefunctionvalue.()第4题Forminimizationproblems,iftheobjectivefunctionevaluatedataCPFsolutionisnolargethanitsvalueateveryadjacentCPFsolution,thenthesolutionisoptimal.(

).第5题Anyfeasiblesolutionoflinearprogrammingproblemcanbeexpressedbythelinearcombinationofallthebasicfeasiblesolutions.(

)Assignment第1题()第2题(

)第3题Inthesimplexmethod,iftheexchangevariablesarenotselectedaccordingtotheminimumratioprinciple,atleastoneofthebasicvariablesinthenextsolutionisnegative.(

)第4题ForthestandardformofLPproblemmaxz=CX,AX=B,X≥0,whenusingsimplexmethodtosolveit,everyiterationofchangingbasicvariableshouldensurethatthecorrespondingobjectivefunctionvalueZmustbe()AincreasesBdoesnotdecreaseCdecreasesDdoesnotincrease第5题IfLPoptimalsolutionisnotunique,then(

)Athereisatleastonenon-basicvariableitstestnumbermustbezeroBthetestnumberofnon-basicvariableneednotbezeroCthetestnumbersofnon-basicvariablesaregreaterthanzeroDthetestnumbersofnon-basicvariablesarelessthanzeroAssignment第1题Onceanartificialvariablebecomesanon-basicvariableintheiteration,thevariableandthenumberofthecorrespondingcolumncanbedeletedfromthesimplextablewithoutaffectingthecalculationresults.()第2题Ifthereisnoleavingbasicvariableatsomeiteration,thentheproblemhasnofeasiblesolution.().第3题Inaparticulariterationofthesimplexmethod,ifthereisatieforwhichvariableshouldbetheleavingbasicvariable,thenthenextBFsolutionmusthaveatleastonebasicvariableequaltozero.()Assignment第1题Iftheconstraintequationcontainsavariablewhosecoefficientsequencevectoristheunitvector,thenitisunnecessarytointroduce(

)intothisconstraintequation.ArelaxationvariableBresidualvariableCartificialvariableDfreevariable第2题Thepurposeofintroducingartificialvariablesintotheconstraintequationis(

).AreflectingthediversityofvariablesBchanginginequalityintoequalityCmaketheobjectivefunctionoptimalDformaunitmatrix第3题Whentheartificialvariablemethodisusedtosolvethemaximizedlinearprogrammingproblem,whenallthetestnumbersσj≥0,buttherearestillartificialvariablesinthebasevariables,itindicatesthatthelinearprogrammingproblem().AThereareuniqueoptimalsolutionsBThereareinfiniteoptimalsolutionsCThereareunboundedsolutionsDTherearenofeasiblesolutionsAssignment第1题Iftheprimalproblemhasanunboundedobjectivefunction,thentheoptimalvalueoftheobjectivefunctionforthedualproblemmustbezero.(

)第2题Iftheoriginalproblemhasnvariables,thenthedualprogramminghasnconstrains.(

)第3题Therelationshipbetweenoriginalprogramminganddualprogrammingcanbedescribedas()ATheprimalproblemhasafeasiblesolution,andthedualproblemalsohasafeasiblesolutionBThedualproblemhasnofeasiblesolution,andtheoriginalproblemalsohasnofeasiblesolutionCTheprimalproblemhasanoptimalsolution,whilethedualproblemcertainlyhasnooptimalsolutionDTheoriginalproblemhasnoboundedsolutionandthedualproblemhasnofeasiblesolution第4题Thedualityofdualproblemis(

)ABasicproblemBproblemofsolutionCotherproblemsDoriginalproblemAssignment第1题ThesufficientandnecessaryconditionforBtobetheoptimalbasisis()ABisnotafeasiblebasisBItsdualityisnotafeasiblebasisCBisnotafeasiblebasisandisnotadualfeasiblebasisDBisafeasiblebasisfororiginalproblemandadualfeasiblebasisfordualproblem第2题Letthedualproblemofalinearprogrammingproblem(P)be(D),thenthestatementabouttherelationshipbetweenthemisincorrect()AIf(P)hasnofeasiblesolution,then(D)hasnofeasiblesolutionBIf(P)and(D)havefeasiblesolutions,thentheyallhaveoptimalsolutionsCIftheconstraintsof(P)areequal,thenallvariablesof(D)havenononnegativeconstraintsD(D)isalsoadualproblemof(P)第3题FortwolinearprogramsMaxZ=CX,AX≤B,X≥0andMinW=YB,YA≥C,Y≥0whicharedualtoeachother,thereisarelation(

)AZ＞WBZ=WCZ≥WDZ≤WAssignment第1题Theoptimalityconditionofdualsimplexmethodforlinearprogrammingis()AAlltestnumbersarenotpositiveBallartificialvariablesarezeroCthenumberofcolumnbisnotnegativeDalltheaboveconditionsshouldbemet第2题Theiterationofdualsimplexmethodstartswith(

).AthefeasiblesolutionofdualproblemBtheoptimalsolutionCthefeasiblesolutionoftheoriginalproblemDthebasicsolutionoftheoriginalproblem第3题Thearray

(λ1，,λ2……，λn）arethejudgementcoefficientsintheoptimaltableofthecanonicalformoriginalproblem(maxproblem),andthejudgementcoefficientsofrelaxationvariablesare（λn+1,λn+2,……,λn+m）,thentheoptimalsolutionofthedualproblemis(

)A（λ1,λ2，……λn）B(-λ1,-λ2,……,-λn)C(-λn+1,-λn+2,……,-λn+m)D(λn+1,λn+2,……,λn+m)Assignment第1题Iftheobjectivecoefficientofabasicvariableintheoptimalbasisoflinearprogrammingproblemchanges,then(

)AThetestnumberofthisbasicvariablechangesBThetestnumberofotherbasicvariableschangesCThetestnumbersofallnon-basicvariableschangeDThetestnumbersofallvariableschange第2题Themainfunctionofsensitivityanalysisoflinearprogrammingistoanalyzetheinfluenceofthechangeoflinearprogrammingparameterson(

).AregularityBfeasibilityCfeasiblesolutionDoptimalsolution第3题Inthesensitivityanalysisoflinearprogramming,itis()thatwillchangethevalueoftheoptimalobjectivefunction.AThechangeofobjectivecoefficientCjBThechangeofconstraintconstantbiCAddanewvariableDAddanewconstraintAssignment第1题Forthestandardlinearprogrammingproblem,thefollowingstatementiswrong(

)AInthesensitivityanalysisofnewvariables,ifthenewvariablescanenterthebasicvariables,theobjectivevaluewillbefurtherimprovedBInsensitivityanalysiswithnewconstraints,thevalueofthenewoptimalobjectivevaluecannotbeincreasedCWhenaconstraintconstantbkincreases,thevalueofobjectivevaluewillincreaseDWhentheobjectivecoefficientofabasicvariableincreases,theobjectivevaluewillbeimproved第2题Iftheobjectivecoefficientofanon-basicvariableintheoptimalbasisoflinearprogrammingproblemchanges,then()AThetestnumberofthisbasicvariablechangesBThetestnumberofotherbasicvariableschangesCThetestnumbersofallnon-basicvariableschangeDThetestnumbersofallvariableschange第3题Inthesensitivityanalysisoflinearprogrammingproblem,iftheoriginalseriesAjofanon-basicvariableXjofthecurrentoptimalbasicsolutionchanges,then(

)AThetestnumberandcoefficientseriesofthenon-basicvariablechangeBThetestnumberandcoefficientseriesofallnon-basicvariableschangeCThetestnumberandcoefficientseriesofallvariableschangeDThenumberoftestsforallbasicvariableschangedAssignment第1题Parametricprogrammingisnotgenerallylinearprogramming()第2题Parametricprogrammingisgenerallydiscussionaboutthevariationofthecoefficientsoflinearprogrammingmodelinaninterval()第3题Ingeneral,thedualsimplexmethodisusedtofindtheoptimalsolutionfortheparametricprogrammingoftherightconstantb,andthesimplexmethodisusedtofindtheoptimalsolutionfortheparametricprogrammingoftheobjectivecoefficientC.

()Assignment第1题Transportationproblemisalsoaspeciallinearprogrammingproblem,buttherearemorevariablesandconstraints.（）第2题Sincetherearemanyvariablesandconstraintsinthetransportationproblem,thesimplexmethodcannotbeusedtosolve(

)第3题Transportationproblemisalsoakindofminimumcostflowproblem()Assignment第1题Thefollowingstatementaboutthecharacteristicsofthemodelofproductionandmarketingbalancedtransportationiscorrect()AThecoefficientmatrixofconstraintequationisunitmatrixBThenumberofbasicvariablesism+nCThebasicvariablecannotbezeroDTherankofcoefficientmatrixisequaltom+n-1第2题Whichisnotthemethodoffindingtheinitialbasicfeasiblesolutionoftransportationproblem.(

)ANorthwestanglemethodBMinimumelementmethodCVogelmethodDClosedloopmethod第3题Whensolvingthetransportationproblemthatthesalesisgreaterthantheproduction,theunnecessaryworkis()ASetanullproductionpointBMaketheoutputofnullproductionpointequaltothepropervalueCMaketheunitcostfromnullproductionpointtoalldemandpointMDDeleteonedemandplaceAssignment第1题Forthetransportationproblemwithminimumtotaltransportationcost,iftheoptimalsolutionhasbeenobtained,thenthetestnumberofallspacesis(

)AMorethan0BLessthan0CNonnegativeDNonpositive第2题Forthetransportationproblem,thepotentialmethodandtheclosedloopmethodareusedtocalculatethetestnumber,thentheresult()AmustbethesameBmustbedifferentCmaynotbeexactlythesameDnoconnection第3题Whensearchingforaclosedcircuitofaspace,ifyouencounterakigg,youcanchoose,butthefollowingstatementisincorrect()Aturn90degreesleftBturnright90degreesCcrossDbackAssignment第1题Whensolvingthetransportationproblem,thenumberof"vertices"ontheclosedloopofeachspacemustbe(

)AFourB

EvenCOddDUncertain第2题Thefollowingitemsarenotpartofthesolutionprocedureoftransportationproblems(

)ADrawtransportationdiagrambasedonactualproblemBDetermineinitialtransportationplanCCalculatethetestnumberofperspaceDJudgewhethertheschemeisoptimalaccordingtothetestnumber第3题Inordertoestablishanimprovementplanforthetransportproblem,theadjustmentamountshouldbeadjusted(

).AtheminimumvalueoftrafficvolumeatevenvertexBtheminimumvalueoftrafficvolumeatoddvertexCthemaximumvalueoftrafficatevenvertexDthemaximumvalueoftrafficatoddvertexAssignment第1题Inintegerprogramming,thevalueofvariablemaybe(

).AIntegerB0or1CIntegerwhichequalandgreaterthanzeroDAllthreearepossible第2题Integerprogrammingincludes(

)APureintegerprogrammingBMixedintegerprogrammingC0-1integerprogrammingDAlloftheabove第3题Aboutintegerprogramming,thefollowingstatementiscorrect(

)AItislinearprogrammingBItisnotlinearprogrammingCIthasdualprogrammingDIthasnodualprogrammingAssignment第1题Thefollowingmethods,whichcanbeusedtosolveintegerprogramming

()ASimplexmethodBBigMmethodCBranchandboundmethodDEnumerationmethod第2题Forthemaximized0-1integerprogrammingproblem,whichofthefollowingcasesneedstocontinuebranchingwhenusingthebranchandboundmethod(

)AWehaveobtainedanintegersolutionBWehaveobtaineda0-1solutionCTheobjectivefunctionvalueofrelaxationproblemislargerthanthatofcurrentintegersolutionDWehaveobtainedanon-integersolution第3题Whichofthefollowingintegerprogrammingproblems,thebranchandboundmethodandthecutplanemethodcanbothbeused.()APureintegerprogrammingBMixedintegerprogrammingC0-1programming

DLinearprogrammingAssignment第1题Theorderofthethreestepsofbranchandboundmethodforintegerprogrammingis(

)ABranching,bounding,FathomingBBranching,Fathoming,boundingCFathoming,branching,boundingDFathoming,bounding,branching第2题Theoptimalvalueofintegerprogrammingisbetterthanthatoflinearprogramming

（）第3题Thecutplanemethodisusedtosolveintegerprogrammingproblems.Thecutplaneconstructedmaycutoffsomeintegersolutionsthatarenotoptimalsolutions

()Assignment第1题Whichofthefollowingtransformationstothevaluecoefficientmatrixoftheassignmentproblemdoesnotaffectthesolutionoftheassignmentproblem(

)AAddanonzeroconstanttoalineBAlineismultipliedbyaconstantthatisnotequalto1CDividearowbyaconstantDAddonerowtoanother第2题TheintegerprogrammingmaxZ=3x1+x2;

4x1+3x2<=7,x1+2x2<=4;x1,x2=0or1;thentheoptimalsolutionis

(

)A(0,0)B(0,1)C(1,0)D(1,1)第3题Whenthebranchandboundmethodisusedtosolveamaximizedintegerprogramming,whenmorethanonefeasiblesolutionisobtained,usuallyanyoneofthemcanbetakenasthelowerbound,andthenthecomparisonpruningiscarriedout.(

)Assignment第1题SomeonewantstotakeabusfromNanchangtoChongqing.Hehopestochoosearouteandtransfertominimizethefare.Thisproblemcanbetranslatedinto()ASolvingtheshortestpathproblemBSolvingthemaximumflowproblemCMinimumtreeproblemsolvingDMinimumcostmaximumflowproblemsolving第2题Th