dual constraints 中文意思是什麼

dual constraints 解釋
對偶約束
  • dual : adj. 二的；二重的；二體的；二元的。 dual personality 雙重人格。n. 【語法】雙數；【數學】對偶。 the D- Monarchy 雙重君主國〈指第一次世界大戰前的奧匈帝國〉。
  • constraints : 變動極限
  1. But, the course of chinese industrialization is always confined by the pressure of population and agriculture farm - operation, which cause dual constraints to the relationship of agriculture and industry with economic development

    但是，中國的工業化進程始終受制於人口壓力以及在此背景下農業的家庭經營，造成了工農業關系與經濟發展的兩重約束。
  2. Normally, we try to get the dual form of mathematical programming to change primary programming, which is difficult to be solved into its dual programming, which is easily to be solved. after we had got the dual form of two programming, we found their form were very simply because they had only nonnegative and linear constraints

    通常，我們求出規劃問題的對偶形式是希望將不易求解的原問題轉化為易於求解的對偶問題，在分別得到這兩類問題的對偶形式后，發現其形式簡單，只帶有非負約束和線性約束。
  3. Abstract : in this paper, we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems. besides the addition of augmented objective, we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem. at the same time, we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method. using the numerous useful solutions we get in the lagrangian relaxation as the original genes, we can improve the solution further. test results show that these methods achieve satisfied outcome for job - shop problems. they can also be applyed to other programming problems with constraints

    文摘:針對車間調度問題，提出了一種改進的拉氏鬆弛演算法.在增加輔助目標函數的基礎上，通過對子問題的限制和搜索策略的改變，使拉氏演算法的計算量減少，近優解的搜索能力有很大改善.本文還提出了一種基因優化演算法，充分利用拉氏演算法得到的多個近優解，進一步優化結果.模擬結果表明對車間調度問題得到了較好的結果.本方法也可用於其它有約束的規劃問題
  4. 2. for the problem with size, stress and displacement constraints, the stress constraint is transformed into movable lower bounds of sizes, the displacement constraint is transformed into an approximate function which explicitly includes design variables by using mohr integral theory. a mathematical programming model of the optimization problem is set up. the dual programming of the model is approached into a quadratic programming model

    2 .對于尺寸、應力和位移約束的問題，將應力約束化為動態下限，用單位虛荷載方法將位移約束近似顯式化，構造優化問題的數學規劃模型，將其對偶規劃處理為二次規劃問題，採用lemke演算法進行求解，得到滿足尺寸、應力和位移約束條件的截面最優解。
  5. In order to improve the efficiency of the algorithm, we not only correct some defects of the primal - dual interior point algorithm in [ 4 ], but also give a modified primal - dual interior point algorithm for convex quadratic programming problem with box constraints

    為提高演算法的有效性，對文[ 4 ]所給的原始-對偶內點演算法理論上的某些缺陷加以更正，並給出框式約束凸二次規劃問題的一個修正原始-對偶內點演算法。
  6. Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints. we prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions. the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms

    第2章建立求解不等式約束優化問題的一類對偶演算法的理論框架，在適當的假設條件下，證明了該類演算法的局部收斂性質，並給出近似解的誤差界，驗證了polyak （ 1992 ）的修正障礙函數演算法以及bertsekas （ 1982 ）的增廣lagrange函數演算法都是這類演算法的特例。
  7. The dissertation tries to eliminate these affection in details : far - near field problem can be relieved by changing the pesudolite ' s signal format and increasing the dynamic range of receivers ; dual - satellite ' s dual directions timing technology and atomic tinier are contributions to enhance synchronization, the constraints of the layout and location of pesudolite stations, such as gdop, proof - interfere etc., are also focused in

    從偽衛星信號格式和接收機動態范圍出發改進了遠近場問題的影響。研究了偽衛星與衛星精確時間同步。通過對gdop 、衛星間及與用戶接收機的共視性、抗干擾性等幾個約束條件的分析，對偽衛星基站進行了合理選址和優化布局。
  8. Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial

    文摘:本文為框式約束的一類凸規劃提出了一個新的內點演算法，原始-對偶路徑跟蹤法，並證明了演算法的迭代復雜性為多項式時間性
分享友人
分享到 Line

分享到臉書