第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＞W(wǎng)BZ=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