In this paper a dual simplex method for linear programming with bounded variables was given , which generalizes and extends the classic dual simplex method for a general linear programming 摘要給出變量有上界的線性規(guī)劃問題的對偶單純形算法,該算法包含了一般線性規(guī)劃問題的對偶單純形算法,為解變量有上界的線性規(guī)劃問題提供了又一種方法。
In this paper , regularly back analysis methods " computational theories and steps are summarized and viewed , including conjugate gradient method , dfp method , simplex method . their merits and disadvantages are described , too 對常見的各種參數反分析方法共軛梯度法、 dfp法、單純形反分析方法的計算理論、步驟進行了系統(tǒng)的總結和評述,并對各種方法的優(yōu)缺點分別進行了闡述。
To alleviate this difficulty , we developed a hybrid approach that combines ga with simplex method in function optimization . in the same way , the hybrid simplex - genetic method is applied to solve the continuous minimax optimization 力學優(yōu)化算法解決了增廣ragange法的子優(yōu)化命題,最后給出了一種新的增廣lagrangc乘子算法,它可有效地解決目標和約束條件函數可微的單目標優(yōu)化命題。
The proposed method not only makes the exploration capabilities of genetic algorithm stronger through niche techniques , but also has more powerful exploitation capabilities by using simplex method . so it effectively alleviates the two major drawbacks of genetic algorithm 該方法一方面運用小生境技術增強遺傳算法“探測”能力,另一方面通過使用單純形搜索方法提高遺傳算法的“開采”能力,從而有效消除遺傳算法的兩大弱點。
Firstly , this paper introduces the relative knowledge about chaos , and describes coa in detail . for improving the search ability and convergence of coa , this paper proposes a improved search algorithm which is the combination of parallel coa and simplex method 論文首先介紹了混沌理論的相關知識,接著詳細地描述了混沌優(yōu)化算法,在分析混沌優(yōu)化算法特點的基礎上,提出了一種并行混沌優(yōu)化算法融合單純形法的優(yōu)化算法,接著分析了該優(yōu)化算法的優(yōu)化性能。
One is based on the bounded simplex method . at first , nonlinear equations was transferred to linear equations whose feasible region contained all solutions in the given interval vector , then the bounded simplex method was used to determine whether the feasible region was empty or not 有界變量單純形法:首先將非線性問題轉化為帶約束條件的線性規(guī)劃問題,該線性規(guī)劃的可行域包含了所給區(qū)間向量范圍內的所有解,然后使用有界變量的單純形法判斷可行域是否為空。
By synthetically using contract net protocol , the traditional mrp arithmetic theory , goal programming , fuzzy integrated evaluation , a production planning making algorithm for ve is presented creatively . the available - to - promise calculation algorithm model based on goal programming is discussed in details , and an improved simplex method is presented . the mathematics model of bid documents evaluation problem based fuzzy integrated evaluation and the fuzzy relation synthetic is presented in details 3 、綜合運用合同網協議、傳統(tǒng)mrp算法的核心思想、目標規(guī)劃、模糊綜合評判等內容,創(chuàng)造性地提出了一種虛擬企業(yè)的成員企業(yè)之間生產計劃的制訂算法模型;詳細討論了基于目標規(guī)劃的產品可交付量的數學模型,并且提出了一種改進的單純型解法;給出了基于模糊綜合評判的標書選擇問題的數學模型,以及模糊關系合成運算的具體算法。
Moreover , comparing with simplex method , this algorithm could n ' t cause vibration phenomenon . in section two , issue involves how to cakulate the constrained nonlinear programming problem by sumt and ag . the method overcomes some limitations such as differentiability , continuity or singlepeak of functions etc . its applying category is more extensive than any other existing methods . especially , it is very efficient for us to cakulate huge constrained nonlinear programming problems 第二部分內容是關于如何利用sumt與ag求解帶約束條件的非線性規(guī)劃問題,透過這部分內容,我們將發(fā)現,把sumt與ag結合在一起運用到求解帶約束條件的非線性規(guī)劃問題可以克服其他一些算法的局限性,譬如,函數的可導性、單峰性等,因而這種方法的應用范圍更廣,尤其在求解大型帶約束條件的非線性規(guī)劃問題上效果更為明顯。
Modern logistics system simulate optimization this thesis in theory aspect , establish the mathematics model and bring up the calculate way using heuristics method to optimize the right conveyance problem in the simulative logistics system ; solution logistics the center choose problem , make use of the number analysis the method ( center of gravity method ) to proceed the optimization design solution to calculate ; the thesis furthest extrude put great emphasis on the logistics system production total cost had bigness affect and difficult to control over the problem of the manufacture and stock quantity make use of the matlab to bring up the simulative optimization design project separately with simple optimization algorithm and simplex method algorithm 現代物流系統(tǒng)仿真優(yōu)化論文在理論方面,用物流系統(tǒng)仿真對運輸優(yōu)化問題運用啟發(fā)式方法建立數學模型、提出算法;在解決物流中心選址問題時,利用數值分析法(重心法)進行優(yōu)化設計解算。本文最為突出的是運用簡單尋優(yōu)技術的單純形法利用matlab就物流系統(tǒng)中對總成本有巨大影響并難以控制的生產和庫存數量問題提出可行的仿真優(yōu)化設計方案。
The application of transverse resonance theory is firstly extended further from plane homogeneous medium to the inhomogeneous spatial region by primarily combining the current martcatili method . then the simplex method is used to calculate the source point " s best position , frequency and the correspond wavenumber of the region 重點結合已有的marcatili法,首次將橫向諧振法從平面均勻分層介質中的應用進一步延伸到模擬地殼波導的三維非均勻空間區(qū)域中,再利用單純形法,確定源點在該區(qū)域的最佳位置、最佳頻率和對應的傳播常數。