下載本文檔
版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
第一章測(cè)試Thepurposeofbreak-evenanalysisistodeterminethenumberofunitsofaproducttosellorproducethatwillequatetotalrevenuewithtotalcost.Atthebreak-evenpoint,theprofitis()zero.
A:equalto
B:morethan
C:lessthan
答案:AIngeneral,anincreaseinvariablecostswill()thebreak-evenpoint,allotherthingsheldconstant.
A:notchange
B:decrease
C:increase
答案:CIt’simportanttomakefulluseoftechniquesinmanagementscienceprocess,whichtechniquesarecommonlyusedforthepurposeofdecision-making()?
A:Transportationandassignment
B:Linearprogrammingmodels
C:Projectmanagement(likeCPM/PERT)
D:Decisionanalysis
答案:ABCDManufacturingcompaniesdeveloplinearprogrammingmodelstohelpdecidehowmanyunitsofdifferentproductstheyshouldproducetomaximizetheirprofit(orminimizetheircost),givenscarceresourcessuchascapital,labor,andfacilities.()
A:對(duì)
B:錯(cuò)
答案:A第二章測(cè)試Ifthegraphicalmethodisusedtosolvethelinearprogrammingproblem,thenumberofdecisionvariablesshouldbe().
A:Nolimitation
B:2
C:≤5
D:≥3
答案:BInthelinearprogrammingmodel,()restrictthedecisionvariablestozeroorpositivevalues.
A:Nonnegativityconstraints
B:Resourcerequirements
C:Objectivefunction
D:Thefeaturesofvariables
答案:AIftheoptimalsolutionofthelinearprogrammingproblemisreachedattwoverticesoffeasibledomainatthesametime,thentheoptimalsolutionhas().
A:Alinesegmentconnectingtwovertices
B:It’simpossible
C:Twosolutions
D:Astraightlineconnectingtwovertices
答案:AThefollowingfeaturesofstandardformofLinearprogrammingarecorrect().
A:Thereisnolimittothesymbolofdecisionvariables
B:Thedecisionvariablesarenonnegative
C:Noneofaboveistrue
D:Thedecisionvariablesarenotequaltozero
答案:BTheoptimalsolutionofthelinearprogrammingproblemmustbethefeasiblesolution.()
A:對(duì)
B:錯(cuò)
答案:A第三章測(cè)試Giventhatalinearprogrammingproblemisasfollowing,theoptimalsolutionofdualproblemis().
A:Y=(0,3/5,4/5,1)
B:Y=(1,0,3/5,4/5)
C:Y=(4/5,3/5,1,0)
D:Y=(0,3/5,1,4/5)
答案:CThefollowingstatementsof100%ruleofobjectivefunctioncoefficientiscorrect().
A:Onlycanincreasingcoefficientsfollowthis100%rule.
B:Noneofaboveiscorrect.
C:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreasedoesnotreach100%,theoptimalsolutionwon’tchange.
D:Thesumofallchangedcoefficientspercentagesofallowableincreaseandallowabledecreaseequals100%,theoptimalsolutionwon’tchange.
答案:CThedualityofadualproblemisnotnecessarilytheprimalproblem.()
A:對(duì)
B:錯(cuò)
答案:BShadowpriceisactuallyamarginalprice.()
A:對(duì)
B:錯(cuò)
答案:AIftheprimalproblemoflinearprogrammingaddsaconstraint,itisequivalenttoaddingavariabletothedualproblem.()
A:錯(cuò)
B:對(duì)
答案:B第四章測(cè)試PleasesolvethefollowingintegerproblemandgetthemaximumZ=().
A:Z=4
B:Z=5
C:Z=3
答案:AAdrillingteamneedstodetermine5explorationwellsfrom10alternativewellstominimizethetotaldrillingcost.If10wellsarerepresentedbys1,s2,…s10,thecostsbeingc1,c2,…c10,oneofconstraintsis:iftheplanchoosess3ors4,thens5cannotbeselectedandviceversa.Weseta0-1variable,xj(j=1,2,…10),thenthisconstraintcanbeexpressed()
A:x3+x5≤1,x4+x5≤1
B:x3+x4+x5≤1
C:x3+x5≥1,x4+x5≥1
D:x3+x5=1,x4+x5=1
答案:ABranch-and-cuttechniqueisonlysuitableforsolvingpureintegerprogrammingproblems.()
A:對(duì)
B:錯(cuò)
答案:BSimplyroundingoffnon-integersimplexsolutionvaluesformodelsrequiringintegersolutionsisnotalwaysappropriate.Roundingcanoftenleadtosuboptimalresults.()
A:錯(cuò)
B:對(duì)
答案:BAssignmentproblemdoesn’tbelongto0-1integerprogrammingproblem.()
A:對(duì)
B:錯(cuò)
答案:B第五章測(cè)試Inthetransportationmodel,thenumberofdemandplacesandsupplyplacesisnandmrespectively.Thenumberofconstraintsis().
A:mn-1
B:m+n-1
C:mn
D:m+n
答案:DTheincorrectstatementoftransportationprobleminthefollowingstatementsis().
A:Itmusthavetheoptimalsolution.
B:Thenumberofconstraintsequalsthenumberofbasevariables.
C:Itcanutilizethetabularmethodtosolve.
D:Itcanutilizethesimplexalgorithmoflinearprogrammingtosolve.
答案:BWhenweadjustthetransportationschemebyclosed-loopmethod,theruleisthatthemaximumvalueoftransportationincreasinginthecellequalstheminimumvalueofthenumeralcelltobereduced,whichisto().
A:makesurethatthebalanceofproductionandsellingcanberealized.
B:makesurethatthefreightcostcanbereducedtoacertainextent.
C:makesurethattheoptimalschemecanberealized.
D:makesurethatthetrafficvolumedoesnotappearnegative.
答案:DAcompanytransportsamaterialfromthreesupplyplacesA1,A2,andA3toB1,B2,andB3.Allinformationoftransportationvolumeislistedasthefollowingtable.Themiddlecellsarethepriceofunittransportationvolume.Fortheoptimalschemeofminimumcost,weutilizethetabularmethodforsolvingitandwecalculatethetestnumberofA2B3thatistheminimumpriceofunitvolumeinnon-basicvariables().
A:2
B:-1
C:1
D:7
答案:BForthetransportationproblemofminimumvalue,theoptimaltransportationschemecanbegainedwhenthetestnumbersarelessthanorequaltozero.()
A:對(duì)
B:錯(cuò)
答案:B第六章測(cè)試Intermsofgraphtheory,thefollowingstatementisincorrect().
A:Ifatreehasnnodes,thenumberofitsedgesisn-1.
B:Nodesinatreemaynotbeconnectedtoeachother.
C:Ifanedgeisremovedfromatree,thetreewon’tbeconnected.
D:Ifthereisonemoreedgeinthetree,theremustbeacircle.
答案:BThereare()oddverticesinthegraph.
A:1
B:4
C:2
D:3
答案:CInordertogettheminimalspanningtreeofthisgraphbyKruskalAlgorithm,thenumberofremainingedgesis(D),andinascendingorderofweight,weshouldremaintheedge()withtheweightof5inordertoavoidcircle.
A:5;(v3,v4)
B:6;(v2,v3)
C:5;(v2,v3)
D:6;(v1,v4)
答案:CDijkstraalgorithmisonlyusedtocalculatetheshortestroutefromthefirstvertexv1toothervertices.()
A:錯(cuò)
B:對(duì)
答案:ATheBellmanalgorithmcanbeusedtofindouttheshortestroutefromv1toanyvertex,eventheweightbeingnegative.()
A:對(duì)
B:錯(cuò)
答案:A第七章測(cè)試IntheGanttcharts,thehorizontalaxisrepresentstimeandtheverticalaxisrepresentseachactivity.()
A:錯(cuò)
B:對(duì)
答案:BThecriticalactivityincriticalpathis().
A:theendactivity
B:thelongestdurationactivity
C:theearliestbeginningactivity
D:themostimportantactivity
答案:BPleaseindicatethecriticalpathinthefollowingnetwork(everynumberbelowtheactivityrepresentsitsduration).()
A:A→B→E→G
B:A→C→F→G
C:A→B→D→F→G
答案:BAvirtualactivityisusedinanAOAnetworktoshowanactualpassageoftime,notjusttheprecedencerelationship.()
A:錯(cuò)
B:對(duì)
答案:AWhenwecarryonthecalculationstepsforthelowestcostscheduleinnetworks,nomatterhowweshortenthedurati
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 潛江外墻清洗合同范例
- 中石油用工合同范例
- 承包電合同范例txt
- 商品購銷合同范例教學(xué)
- 瓷磚外墻合同范例
- 銅仁幼兒師范高等??茖W(xué)校《第四紀(jì)地質(zhì)與地貌學(xué)》2023-2024學(xué)年第一學(xué)期期末試卷
- 桐城師范高等專科學(xué)?!豆こ虣C(jī)械底盤理論與性能》2023-2024學(xué)年第一學(xué)期期末試卷
- 同濟(jì)大學(xué)浙江學(xué)院《建筑制圖計(jì)算機(jī)輔助設(shè)計(jì)一》2023-2024學(xué)年第一學(xué)期期末試卷
- 同濟(jì)大學(xué)浙江學(xué)院《工業(yè)設(shè)計(jì)概論》2023-2024學(xué)年第一學(xué)期期末試卷
- 通遼職業(yè)學(xué)院《有限元及ANSYS應(yīng)用》2023-2024學(xué)年第一學(xué)期期末試卷
- 2024年遂寧廣利工業(yè)發(fā)展有限公司招聘筆試沖刺題(帶答案解析)
- 中國石油天然氣集團(tuán)有限公司投標(biāo)人失信行為管理辦法(試行)
- 縫合線材料的可吸收性研究
- GB/T 43700-2024滑雪場(chǎng)所的運(yùn)行和管理規(guī)范
- 《3-6歲兒童學(xué)習(xí)與發(fā)展指南》知識(shí)競(jìng)賽參考題庫500題(含答案)
- 水電站廠房設(shè)計(jì)-畢業(yè)設(shè)計(jì)
- 幼兒園園長(zhǎng)的園里園外融合教育
- 綜合金融服務(wù)方案課件
- 《鎮(zhèn)原民俗》課件
- 新型電力系統(tǒng)簡(jiǎn)介
- 施工安全管理體系及安全保證措施樣本
評(píng)論
0/150
提交評(píng)論