☆ 1、如有部分內(nèi)容理解不透或消化不好，可免費(fèi)在以后培訓(xùn)班中重聽；
      ☆ 2、在課程結(jié)束之后,授課老師會(huì)留給學(xué)員手機(jī)和E-mail,免費(fèi)提供半年的課程技術(shù)支持，以便保證培訓(xùn)后的繼續(xù)消化；
      ☆3、合格的學(xué)員可享受免費(fèi)推薦就業(yè)機(jī)會(huì)。
      ☆4、合格學(xué)員免費(fèi)頒發(fā)相關(guān)工程師等資格證書，提升您的職業(yè)資質(zhì)。

• SOPT是一款功能強(qiáng)大的線性、非線性和整數(shù)的高效優(yōu)化軟件。它為工業(yè)決策支持系統(tǒng)提供了多種新的快速算法和應(yīng)用能力。基于數(shù)學(xué)編程中的突破性技術(shù)，SOPT以閃電般的速度解決問題。
• ?
• 強(qiáng)調(diào)：
• 目前SOPT有三種版本： SOPT-CP是線性和非線性的優(yōu)化程序； SOPT-IP是線性和整數(shù)的優(yōu)化程序； SOPT-SP包括SOPT-IP和AMPL。每個(gè)模塊都具有獨(dú)特算法的實(shí)際實(shí)現(xiàn)，這可以幫助您的解決方案開發(fā)解決復(fù)雜的決策問題。
• 對于線性程序：
• 閃電般的速度，性能穩(wěn)定
• 對變量或約束的數(shù)量沒有限制
• 各種算法（例如，Newton Barrier，Simplex，Cross-over）
• ?
• 對于整數(shù)程序：
• 高效實(shí)用的啟發(fā)式搜索
• 易于使用的定制參數(shù)
• 快速啟動(dòng)以進(jìn)行方案分析
• ?
• 對于非線性程序：
• 快速二次優(yōu)化
• 用于凸函數(shù)的靈活的用戶子程序
• 全局優(yōu)化功能
• ?
• 支持平臺：
• SOPT可以單獨(dú)使用，也可以作為子程序庫或DLL使用。
• ?
• 最新版本的SOPT
• SOPT新版本為4.2，隨著發(fā)布，SOPT創(chuàng)建了一個(gè)動(dòng)態(tài)優(yōu)化日志，其中包含有解決方案值和縮短時(shí)間的信息，以便及時(shí)SOPT仍然在解決問題，用戶也可以訪問正在進(jìn)行的優(yōu)化狀態(tài)。此功能對于SaaS應(yīng)用程序等在線應(yīng)用程序特別有用。
• ?
• 最近的版本包括從SOPT數(shù)據(jù)結(jié)構(gòu)中檢索多個(gè)證書解決方案以及CSV各式的各種解決方案文件等功能。選擇多個(gè)近似解決方案中的餓一個(gè)是一種實(shí)用且方便的方法，可以為您的應(yīng)用確定最佳解決方案，而最佳客觀價(jià)值可能并不意味著最佳的解決方案。
• ?
• 之前我們在版本3中引用了一種新的搜索算法。這種寬展搜索伏安法實(shí)用切割平面和子LP解決方案，它視圖通過原理局部最優(yōu)來找到更好的整數(shù)解。它已經(jīng)應(yīng)用于困難的組合問題，例如集合覆蓋和TSP問題，這些問題經(jīng)常出現(xiàn)在調(diào)度和路由應(yīng)用中。最后一個(gè)版本還包括GUI改進(jìn)，例如顯示LP和IP解決方案性能。
• ?
• ?
• ?
• 【英文介紹】
• ?
• SOPT is an efficient optimizer for linear, integer, and nonlinear programs. It offers a variety of new and fast algorithms and application capabilities for industrial decision support systems. Based on breakthrough technologies in math programming, SOPT solves problems with lightning speed and robustness.
• Highlights
• Currently SOPT has three versions, SOPT-CP for linear and nonlienar programs, SOPT-IP for linear and integer programs, and SOPT-SP (SOPT-IP and AMPL). Each module has practical implementation of unique algorithms, which may help your solution development to solve complex decision problems.
• For Linear Programs:
• Lightning-fast speed and stable performance
• No limits on number of variables or constraints
• Variety of algorithms (e.g., Newton Barrier, Simplex, Cross-over)
• For Integer Programs:
• Efficient and practical heuristic searches
• Easy-to-use customization parameters
• Quick warm-starts for scenario analysis
• ?
• For Nonlinear Programs:
• Speedy quadratic optimization
• Flexible user subroutines for convex functions
• Global optimization capabilities
  
• ?
• Supported Plaforms: Win32 Unix
  SOPT can be used stand-alone, or as a subroutine library or DLL.
• ?
• Latest version of SOPT
• A new version SOPT 4.2 will be released on August 25. With theis release, SOPT creates a dynamic optimization log with information on incumbent solution values and elasped times so that users can access the ongoing optmization status even when SOPT is still solving the problem. This feature is particularly useful for online applications such as SaaS appliacations.
• Recent releases include such features as retrieval of multiple integer solutions from the SOPT data structure, and various solutions files in the CSV format. Choosing one of multiple near-optiomal solutions is a practical and convenicent way to identify the best solution for your application, when the best objective value may not mean the best solution. Recent release note for SOPT is available from here.
• Previously we introduced a new search algorithm in version 3. This extended search algorithm uses cutting planes and sub LP solutions, and it tries to find better integer solutions by moving away from local optima. It has been applied to difficult combinatorial problems, such as set covering and TSP problems, which are often found in scheduling and routing applications. The last version also included GUI improvement such as displaying LP and IP solution performance.