Gurobi Optimization Gurobi v5.0.1 GurobiOptimizationGurobiv5.0.1英文正式版(線性混合整數優化軟體線性混合整數優化軟體) 破解說明: 關掉主程式,破解檔放置於crack夾內,請將破解檔複製於主程式的安裝目錄內既可破解 內容說明: Gurobi4隆重發佈,在數學優化器領域繼續擴大領先優勢。主要特色包括: 新增QP和MIQP優化器; 在版本3基礎上,線性和混合整數問題求解速度進一步提升; 數值計算穩定性進一步提升; 併發LP計算; 新增MIP終止計算策略選項; 支援和VisualStudio2010集成 Java和.Net環境下浮動許可的更多自主控制。 Gurobi特點 Gurobi具有許多獨特的特點和功能,可以使得用戶迅速而準確地獲得最優結果。這些特點包括: 採用最新優化技術,充分利用多核處理器優勢 任何版本都支持平行計算,並且計算結果確定而非隨機 提供了方便輕巧的介面,支援C++,Java,Python,.Net開發,記憶體消耗少 支持多種平臺,包括Windows,Linux,MacOSX 支援AMPL、GAMS、AIMMS和WindowsSolverFoundation建模環境 單一版本,開發版本也就是發佈版本,程式轉移便捷 性價比突出,為學校、企業提供了差異化價格,方便各種需求 第三方商業和免費軟體支援和Matlab介面 強大的技術支援力量,Gurobi提供中英文雙語技術支援 完備的用戶使用手冊 Gurobi可以解決的問題   Gurobi可以解決的數學問題: 線性問題(Linearproblems) 二次型目標問題(Quadraticproblems) 混合整數線性和二次型問題(Mixedintegerlinearandquadraticproblems) 突出的性價比 Gurobi不區分開發許可和實施許可,一個許可軟體既可以用在開發上也可以用在實施上。 同時,允許一個許可軟體應用于多個應用程式上,極大地降低了大型優化項目的開發和實 施成本。 應用領域 線性混合整數優化是應用在各個領域中最常見的優化方法之一,是過去30年當中在實際應 用中創造價值最巨大的優化方法。在物流、生產製造、金融、交通運輸、資源管理、積體 電路設計、環境保護、電力管理等等領域,幾乎無所不在。在世界一流的企業資源管理( ERP)、供應鏈管理(SCM)、運輸管理等企業決策工具中,都有線性混合整數優化器的存 在。 英文說明: TheGurobiOptimizerisastate-of-the-artsolver forlinearprogramming(LP),quadraticprogramming (QP)andmixed-integerprogramming(MILPandMIQP). Itwasdesignedfromthegrounduptoexploitmodern multi-coreprocessors.EveryGurobilicenseallows parallelprocessing,andtheGurobiParallel Optimizerisdeterministic:twoseparaterunsonthe samemodelwillproduceidenticalsolutionpaths. ForsolvingLPandQPmodels,theGurobiOptimizer includeshigh-performanceimplementationsofthe primalsimplexmethod,thedualsimplexmethod,and aparallelbarriersolver.ForMILPandMIQPmodels, theGurobiOptimizerincorporatesthelatestmethods includingcuttingplanesandpowerfulsolution heuristics.Allmodelsbenefitfromadvanced presolvemethodstosimplifymodelsandslashsolve times. TheGurobiOptimizeriswritteninCandis accessiblefromseverallanguages.Inadditiontoa powerful,interactivePythoninterfaceanda matrix-orientedCinterface,weprovide object-orientedinterfacesfromC++,Java,Python, andthe.NETlanguages.Theseinterfaceshaveall beendesignedtobelightweightandeasytouse, withthegoalofgreatlyenhancingtheaccessibility ofourproducts.Andsincetheinterfacesare lightweight,theyarefasteranduselessmemory thanotherstandardinterfaces.Ouronline documentation(QuickStartGuide,ExampleTourand ReferenceManual)describestheuseofthese interfaces. Gurobiisalsoavailablethroughseveralpowerful third-partymodelingsystemsincludingAIMMS,AMPL, FRONTLINESOLVERS,GAMS,MPL,OptimJandTOMLAB. Mostofthechangesinthe4.5releaseoftheGurobi Optimizerarerelatedtoperformance.Usersof previousversionswilltypicallynotneedtomake anychangestotheirprogramstousethenew version.Thenewversiondoescontainafewnew features,describedhere. *NewdefaultMethodforcontinuousmodels:The newversionusesanewAutomaticsettingasthe defaultforsolvingcontinuousmodels.Inprevious releases,continuousmodelsweresolvedwiththe dualsimplexmethodbydefault.Whiletheexact strategyusedbythenewAutomaticsettingmay changeinfuturereleases,inthisreleasethenew approachusestheconcurrentoptimizerfor continuousmodelswithalinearobjective(LPs), thebarrieroptimizerforcontinuousmodelswitha quadraticobjective(QPs),andthedualsimplex optimizerfortherootnodeofaMIPmodel.You shouldchangetheMethodparameterifyouwould liketochooseadifferentmethod. *NewMinimumReleaxationheuristic:Thenew versioncontainsanewMinimumRelaxation heuristicthatcanbeusefulforfindingsolutions toMIPmodelswhereotherstrategiesfailtofind feasiblesolutionsinareasonableamountoftime. UsethenewMinRelNodesparametertocontrolthis newheuristic. *Newbranchdirectioncontrol:Thenewversion allowsmorecontroloverhowthebranch-and-cut treeisexplored.Specifically,whenanodeinthe MIPsearchiscompletedandtwochildnodes, correspondingtothedownbranchandtheupbranch arecreated,thenewBranchDirparameterallows youtodeterminewhethertheMIPsolverwill explorethedownbranchfirst,theupbranch first,orwhetheritwillchoosethenextnode basedonaheuristicdeterminationofwhich sub-treeappearsmorepromising. *Cutpasslimit:Thenewversionallowsyouto limitthenumberofcutpassesperformedduring rootcutgenerationinMIP.UsethenewCutPasses parameter. *Additionalinformationforinfeasibleand unboundedlinearmodels:Thenewversionallows youtoobtainaFarkasinfeasibilityprooffor infeasiblemodels,andanunboundedrayfor unboundedmodels.UsethenewInfUnbdInfo parameter,andthenewFarkasProof,FarkasDual, UnbdRayattributestoobtainthisinformation. 圖片說明: 相關商品:GurobiOptimizationGurobiforAMPLv5.0.1英文正式版(線性混合整數優化軟體線性混合整數優化軟體)