linear discrete programming 中文意思是什麼

linear discrete programming 解釋
線性離散規劃
  • linear : adj. 1. 線的，直線的。2. 長度的。3. 【數學】一次的，線性的。4. 【動、植】線狀的；細長的。5. 由線條組成的，以線條為主的，強調線條的。
  • discrete : adj. 1. 分離的，分立的；顯然有別的。2. 不連續的；【數學】離散的；【哲學】抽象的 （opp. concrete）。adv. -ly
  • programming : 編程序的
  1. Aimed at multiple - limit, multiple - object, non - linear, discrete of voltage / var optimization and control, on account of whole evolution of evolutionary programming, no demand for differentiability of optimal function, and random search, it can obtain global optimum with mayor probability, this paper solve optimal function with evolutionary programming

    在對優化的具體實現過程中，由於進化規劃著眼于整個整體的進化，對于所求解的優化問題無可微性要求，採用隨機搜索技術，能以較大的概率求解全局最優解的特點，針對電壓無功控制模型是一個多限制、多目標、非線性、離散的優化控制問題，因此應用進化規劃演算法進行模型的求解。
  2. Meanwhile, the properties of the state feedback systems that contain observers are obtained. in part three, the optimal control of 2 - d discrete linear systems described by fmm ii is solved using dynamic programming, and the exact model matching for 2 - d singular roesser model is discussed

    最後，討論了2 - d奇異系統控制中的兩個問題：用動態規劃方法求解2 - dfmm描述的奇異系統的最優控制問題，以及通過狀態反饋對2 - dsrm表示的系統進行精確模型匹配問題。
  3. Since the development of the simplex method many people have contributed to the growth of linear programming by developing its mathematical theory, devising efficient computational methods and codes, exploring new applications, and by their use of linear programming as an aiding tool for solving more complex problems, for instance, discrete programs, nonlinear programs, combinatorial problems, stochastic programming problems, and problems of optimal control

    由於單純形的發展，很多人致力於線性規劃的進步，通過發展它的數學理論、設計高效的計算方法和規則、探索新的應用，以及把線性規劃的使用作為解決更復雜問題的輔助工具，比如，離散規劃，非線性規劃，組合問題，隨機規劃問題和最優控制問題。
  4. 2. this paper advanced mixed integer nonlinear programming ( minlp ) algorithms mixed with constraint programming ( cp ) to solve industrial process hybrid model mixed with logical rule. cp methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. it can effectively solve hybrid model mixed with logical rule by integrating cp, nonlinear programming and mixed integer linear programming

    本文針對結合邏輯的工業過程混雜模型，提出了結合約束程序（ cp ）的混合整數非線性規劃（ mfnlp ）演算法，採用cp方法求解模型的可行點，並採用milp cp方法求解演算法中的milp主問題，通過計算實例可看出，採用這種演算法比採用通用的轉化成minlp方法的計算時間大為減少。
  5. Secondly, according to convex geometric characteristics, a common - perpendicular - line algorithm is developed for the distance between the convex nurbs surfaces by making surfaces discrete, approximating the distance by one between convex hulls of discrete surfaces and solving a linear programming problem to get their vertical projective length on common perpendicular direction, that is, the original distance

    然後，針對凸曲面的幾何特徵，給出了nurbs凸曲面間距離求解的公垂線法和切平面法。公垂線法是把曲面間的距離求解問題轉化成曲面的離散點生成的凸殼間的距離，再歸之為兩凸殼在其公垂線上投影集合間的距離，由此抽象成一個線性規劃問題，估算出近點對。
分享友人
分享到 Line

分享到臉書