linear programming solution 中文意思是什麼

linear programming solution 解釋
線性規劃求解
  • linear : adj. 1. 線的，直線的。2. 長度的。3. 【數學】一次的，線性的。4. 【動、植】線狀的；細長的。5. 由線條組成的，以線條為主的，強調線條的。
  • programming : 編程序的
  • solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
  1. Linear programming thought solution assignment problem

    線性規劃思想解指派問題
  2. Set - valued linear programming and its satisfactory solution

    集值線性規劃及其滿意解
  3. Determining the optimal solution set for linear programming in general form

    一般形式線性規劃最優解集的確定
  4. If some linear programming problem has optimum solution, then there must at least exist such a edge among ali edges passing through some known vertex of feasible region that the objective function value of the other vertex is more optimic than the one of the known vertex, otherwise, the known vertex is the optimum solution of the linear programming problem

    如果線性規劃問題有最優解，那麼過可行域的一已知頂點必至少存在這樣一條棱? ?它以該己知頂點為一端點，可行域的另一頂點為另一端點，並使目標函數在另一端點的函數值優於己知端點的函數值，否則，該己知點就是線性規劃問題的最優解。
  5. This thesis primarily makes below the work of a few aspects : ( 1 ) the method that measuring and solution of the control point ' s coordinate, calculation of the point, solution of intersection with polygons, and calculation the quantity of ore reserves in a drawing file by computer technology ; ( 2 ) the theory and the method to draw the diagram of the equivalent line by establishing the abnormal triangle net, and ore blending with the diagram of the equivalent degree ' s line ; ( 3 ) the principle and method to automatically divide the ore, and the method to adjust to the quantity of ore and search the ore ' s information ; ( 4 ) adoption the line program to beg to solve the problem to ore blending, and establish the linear programming model and the simplification model with ore blending. ( 5 ) establish the control model with ore degree based on modem control theories

    本論文主要完成了以下幾方面的工作： （ 1 ）利用計算機技術直接在一張現狀圖中，實現了控制點的測量與求解、坐標展點計算、多邊形求交以及爆堆礦巖量的計算； （ 2 ）提出了通過建立非規則三角網的方法來繪制等值線圖的理論和實現方法，通過等品位線圖指導配礦工作； （ 3 ）提出了配礦塊段自動劃分的原理和方法，並在此基礎上實現礦塊礦量調整和礦塊信息查詢； （ 4 ）採用線性規劃的方法求解配礦問題，建立了配礦問題的線性規劃模型和簡化模型； （ 5 ）建立了基於現代控制理論的品位控制模型。
  6. Some notes on optimum solution in fuzzy linear programming

    線性規劃最優解的一些注記
  7. A new approach to the optimal solution to fuzzy linear programming

    線性規劃最優解新探
  8. Calculator simulate of most satisfactory solution in fuzzy linear programming

    模糊線性規劃最滿意解的計算機模擬
  9. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  10. Summaries are made concerning the typical network optimization problem. the paper independently puts forward several optimal methods to improve network traffic transmission, such as the maximum - flow problem over mpls, including the arc - based and path - based solution, which adopt the method of splitting and unsplitting traffic, the solution to the greatest reliability of transmission, the solution to concurrent maximum - flow for load balance via linear programming. on the basis of mpls path protection several protection methods over mpls are proposed, including n - to - 1, n - to - m protection solution in splitting and unsplitting cases and in diffserv cases, whose partial simulation results are provided as well

    即： 1 ） mpls網路最大流傳輸問題，包括基於弧的最大流解決方案、基於路徑的最大流解決方案，分流與不分流的最大流處理方法以及多源多匯最大流解決方案； 2 ）最大可靠性傳輸問摘要博士論文題: 3 ）基於弧的求解流量負載平衡問題的線性規劃方法; 4 ）基於路徑的流量負載平衡方法以及其他負載均衡問題; 5 ）在mpls路徑保護的思想和方法的基礎上，提出了基於mpls的若干新的路徑保護方法，即n一t 。
  11. The model of bilevel programming under uncertainty is converted to some linear programming models on uncertain parameters based on the theory of multi - parametric linear programming, and one of its optimal solution chosen from the worst cases is obtained by using the pessimistic principle of uncertain decision methods

    摘要基於多參數線性規劃理論，將不確定型二層線性規劃問題轉化為多個關于不確定參數的線性規劃問題，利用不確定型決策方法中的悲觀準則，從最不利的結果中選擇最有利的結果，從而得到不確定型二層線性規劃的最優解。
  12. In the past, to obtain the optimal tension solution, the problem was regarded as a linear programming one, and solved by the iteration which has disadvantages such as lack of uniqueness of termination rules, slow calculation and multiple optimal solutions

    以往學者將繩拉力的優化歸結為一個線性規劃問題並採用迭代法進行求解，而迭代法不僅計算速度慢，且無確定的優化解。
  13. In the past, to obtain the optimal tension solution, the problem was regarded as a linear programming one, and solved by the iteration which has the disadvantages such as lack of uniqueness of termination rules, slow calculation and multiple optimal solutions

    以往學者將繩拉力的優化歸結為一個線性規劃問題並採用迭代法進行求解，而迭代法不僅計算速度慢，且無確定的優化解。
  14. Optimal solution for a linear programming problem

    一類線性規劃問題的最優解
  15. The study of criteria of linear programming with optimal solution

    線性規劃問題最優解判別定理的研究
  16. Continuing above curse, then we can get its optimum solution, that is to say, starting from some feasible vertex, we will get the optimum solution of some linear programming problem after finite times transition of vertex along edge of feasible region

    繼續上述過程，就能求得線性規劃問題的最優解。這就是說，自可行域的某頂點出發，沿可行域的棱經過若干次可行域頂點的轉移后，就能得到線性規劃問題的最優解（在最優解存在的情況下） 。
  17. A new method for seeking initial basic feasible solution of linear programming problem

    一種求線性規劃問題的初始基本可行解的新方法
  18. In section 2, a certain linear fractional bilevel programming problem ( lfbp ) is introduced and studied in which the leader ' s objective function is a linear fractional function and the leader ' s constraints are linear, and the follower ' s programming is a linear programming with parameters. it is proved that, under certain conditions, the existences of the optimal solution to the problem ( lfbp ). under a fairly week condition, some results are explored concerned with an exact penalty function formulation of the problem ( lfbp )

    首先給出了一些預備知識，並證明了在一定的條件下，問題（ lfbp ）解存在；然後在較弱的條件下給出了問題（ lfbp ）的一些有關恰當罰函數的結果；接著總結了問題（ lfbp ）的一些有關lagrange對偶的結果；最後利用例子說明了前面給出的結果，並通過例子說明所用的假設條件確實比現有常用的假設條件更弱。
  19. A linear programming solution to integer linear programming

    整數規劃的一種線性規劃解法
  20. Linear programming solution to a category of portfolio investment

    一類組合投資問題的線性規劃解法
分享友人
分享到 Line

分享到臉書