約束極值問題 的英文怎麼說

中文拼音 [yāoshùjízhíwèntí]
約束極值問題 英文
constrained extreme-value problem
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. Also, the author ’ s design strategy and creativity has been given in this paper. specifically, it includes : based on the feasibility analysis of the fit selection of control parameters in the aeration process, the aeration process of wastewater treatment of the joint - constructional complete - mixed activated sludge process has been aimed at in this paper. then, the state equations of the aeration process have been proposed in this paper, which is on the base of dissolved oxygen concentration ( do ) and discharge quantity of sludge ( qw ) as control variables, the concentration of bod and sludge as state variables. based on the present study on optimization control of wastewater treatment, the multivariable optimal control model with restriction factor has been presented in the paper with introducing modern control theory and system analysis into the field of activated sludge wastewater treatment,

    具體包括:以完全混合、表面曝氣合建式活性污泥工藝的污水處理曝氣過程為研究對象，在闡述了曝氣過程式控制制參數選取可行性的基礎上，建立了以溶解氧濃度do和活性污泥排放量qw為控制變量，以曝氣池中有機物濃度s和微生物濃度x為狀態變量的活性污泥曝氣過程的基本狀態方程;運用現代控制理論的觀點和污水處理理論，在現有關于污水處理最優控制問題研究的基礎上，建立了有約束條件多變量能耗最小數學模型，該數學模型是以有機物排放總量和狀態變量的末值條件作為約束條件，曝氣過程的能耗最小作為目標泛函;採用增廣拉格朗日乘子法對最優控制問題進行轉化，並對應用極大值原理求解能耗最小這一最優控制問題進行了詳細的解析;引入約束運算元，應用具有控制約束的共軛梯度演算法對能耗最小這一最優控制問題進行求解，並進行模擬實驗驗證。
  2. A full mathematical model of optimal flow pattern design withengineering constraints was put forward, based on modern optimal control theory. an optimal flow pattern design was presented for optimizing meridional channel of axial flow turbine. according to integral optimization of turbine stages, a full physical model and mathematical expression were put forward for proposition of optimal flow pattern, including all performance parameters in turbine stages. this problem was further recast into a typical form control to maximize specific performance index such as work or efficiency of stage with given initial state, fixed terminal condition and constraints for part of state terminal variables. the program was also worked out according penalty function method and conjugate gradient method. the optimal distribution of c1ur1 ( r1 ) was obtained according to constraint conditions and maximized objective function

    把近代最優控制論方法引入軸流透平葉片的設計，在優化的軸流透平子午通道內，建立包括透平級內所有性能參量的最優流型命題的完整的物理模型及其數學表達式，並歸化為一個在給定初始狀態、自變量終端固定、部分狀態變量終端受有約束的條件下，使級的某一性能指標（如級的功率）達到最優的最優控制問題，應用「代價函數法」及「共軛梯度法」編制計算程序，計算得到符合給定約束條件、並使目標函數取極值的最優環量分佈，結果是令人滿意的。
  3. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  4. To the inequality constrained least squares adjustment problem, this paper converts many inequality constraints into one equality constraint by using aggregate function of non - linear programming ; a basic augmented lagrangean algorithm can obtain the solutions for equality constrained non - linear programming problem and the solutions are identical to those obtained by the bayesian method and / or simplex algorithm

    摘要對不等式約束最小二乘平差問題，藉助非線性規劃中的凝聚約束方法把多個不等式約束轉化為一個等式約束，採用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。
  5. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  6. Based on modern optimization theory and optimal control theory, this dissertation studies some questions as follows : 1. the optimization model of parameter identification of three - dimensional geologic history numerical simulation, algorithm and its application geologic history numerical simulation is a basic content of basin numerical simulation, and the porosity is the major parameter in the evolution and development process of oil - bearing basin. according to the sedimentation and burial mechanism, the physical and chemical principles of oil geology, the mudstone porosity ' s non - linear parabolic partial differential equation has been established

    本文應用現代最優化及最優控制理論，對如下一些問題進行了研究： 1 、三維地史數值模擬的參數辨識優化模型、演算法及應用地史模擬是盆地數值模擬的一個基礎性的研究內容，地層孔隙度是含油氣盆地地史演化發育過程中的重要參數，根據地層沉積埋藏機理和石油地質的物理化學原理，通過引入數學物理方程概念，建立了泥巖三維孔隙度場方程，根據問題的特點，給出了方程的定解條件，對方程的動邊界也給出了處理方法，並且證明了解的存在性與惟一性，在此基礎上建立了以當今實測數據為擬合準則的三維地史數值模擬的參數辨識優化模型，這是一個含有二階偏微分方程約束的泛函極值問題。
  7. However, as one of the most complicated mix - integer nonlinear problems with the characteristics of multi - objective, multi - uncertainty, multi - restriction, multi - extremum and discreteness property, the reactive power optimization problem is not yet solved completely

    然而由於無功優化問題是一個非常復雜的非線性問題，具有多目標、多不確定性、多約束、多極值和離散性等特點，尚有很多問題有待解決。
  8. We apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems

    用這些演算法計算大量的規模不是很大的不等式約束優化問題，無約束極大極小問題，一般約束優化問題，數值結果表明它們是有效的
  9. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  10. The conclusion that a set of extremum questions can not be solved by lagrange - multiplication is explained through analysising the extremum questions under linear target functions and linear constrained conditions

    摘要通過對線性的目標函數在線性的約束條件下的極值問題的分析，得到這類極值問題一般是不能用拉格朗日乘數法求解。
  11. The vector extreme problems with the set constraint in the ordered linear topological spaces are studied. the necessary and sufficient optimality conditions are established

    在序線性拓撲空間里研究了含有集約束向量極值問題的最優性條件，並建立了充分性和必要性條件
  12. The nonlinear programming problem that the constraint perturbation attains minimum under the condition when the objective function makes its optimal perturbation is considered

    摘要考慮當目標函數在約束條件下的最優值作擾動時，使各約束作極小擾動的非線性規劃問題。
分享友人
分享到 Line

分享到臉書