linear programming problem 中文意思是什麼

linear programming problem 解釋
線性規劃問題
  • linear : adj. 1. 線的，直線的。2. 長度的。3. 【數學】一次的，線性的。4. 【動、植】線狀的；細長的。5. 由線條組成的，以線條為主的，強調線條的。
  • programming : 編程序的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. This paper takes the point of solving one of the main problems, i. e. having no steady fund source, which exists in the implementary of public housing system in xi ' an, as the incisive point. the paper analyzes and calculates the problem of fund deficiency in today ' s fund source channel and studies the method of solving the problem during the process of incorporating, using and managing in extant employee housing accumulation fund system in the towns. the paper also advances the ampliative accumulation fund system and builds up the corresponding operating model by adopting the mode of financing affiance, analyzes the investment method by using blurred linear programming and appraises its incremental effect

    本文以解決西安市廉租住房制度實施中存在的主要問題之一?無穩定的資金來源為切入點，在調研資料的基礎上，分析測算了目前的資金來源渠道存在的資金不足問題，同時研究了現存的城鎮職工住房公積金制度在歸集、使用和管理過程中存在問題的解決途徑，提出了擴大的住房公積金並採用金融信託方式構建了相應的運作模式，利用模糊線性規劃模型對其投資方式進行了分析並對其增值效果進行了評價。
  2. Efficient solutions of linear bilevel programming problem

    二層線性規劃的有效解
  3. A globally convergent algorithm for solving the bilevel linear programming problem

    雙層線性規劃的一個全局優化方法
  4. A bilevel linear programming problem with follower responding marginal function to leader

    下層以最優值反應上層的兩層線性規劃
  5. Linear programming thought solution assignment problem

    線性規劃思想解指派問題
  6. 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

    如果線性規劃問題有最優解，那麼過可行域的一已知頂點必至少存在這樣一條棱? ?它以該己知頂點為一端點，可行域的另一頂點為另一端點，並使目標函數在另一端點的函數值優於己知端點的函數值，否則，該己知點就是線性規劃問題的最優解。
  7. 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 ）建立了基於現代控制理論的品位控制模型。
  8. The quadratic programming perturbation approximation method for the linear programming problem

    求解線性規劃問題的二次規劃攝動逼近法
  9. 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

    摘要對不等式約束最小二乘平差問題，藉助非線性規劃中的凝聚約束方法把多個不等式約束轉化為一個等式約束，採用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。
  10. Optimal solution for a linear programming problem

    一類線性規劃問題的最優解
  11. In contrast to existing simplex method, this method has several peculiarities as follows : to begin with, applying it to solve linear programming problem. one need n ' t introduce any additional variable such as relaxing variable, artificial variable and other parameters, so that calculation is subtracted on a large scale. in addition to this, as a result of its higher degree of structuralization, this algorithm can be more easily transformed into program language and, of course, more quickly performed by computers

    與現有的單純形法相比，新演算法具有如下主要特徵：第一，求解過程不需要引進諸如松馳變量、人工變量等參變量參與運算，計算量大大減少了；第二，新演算法較單純形法的結構化程度高，更容易轉化為程序語言，進而在計算機上更快地得以實現；第三，新演算法在運算過程中不會引起攝動現象。
  12. In section one, based on theory of n dimensional euclid space, a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem. this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter

    第一部分內容是在n維歐氏空間理論的基礎上提出了一種求解線性規劃問題的新演算法? 「點線面」循環尋優法，本演算法是基於如下思想提出來的：我們知道，在三維歐氏空間中，線性規劃問題的可行域是一個由若干個平面圍成的廣義多面體，目標函數可以看作是以目標函數值為參變量的一個平行平面束。
  13. 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

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

    一種求線性規劃問題的初始基本可行解的新方法
  15. Secondly, ranging fuzzy numbers are introduced by several methods. thirdly, rangking methods of fuzzy numbers are extended and put the methods into comparition of inequality practice and the method of trapezoid fuzzy numbers comparition is extended. at last, we use two statistical confidence intervals to derive level interval - valued fuzzy numbers, and get another linear programming problem

    本文首先綜述了模糊線性規劃問題中的一些方法和有關模糊數排序的幾種方法，然後對模糊數的一些排序方法做了推廣，重點討論了模糊數不等式的問題，最後給出了基於置信區間的一種模糊線性規劃問題。
  16. After obtaining linear programming problem we try to research on it to get local analytic solution

    轉換成線性規劃之後嘗試求出局部解析解形式
  17. According to order relations defined between fuzzy numbers, the pareto less optimal solution and the pareto optimal solution are defined, then a fuzzy evaluation function is introduced into a multiobjective programming problem, this method results in a multiobjective programming problem been converted into a one objective programming problem, accordingly the solution by this method is the pareto less optimal solution to the primitive problem, which is given proof a multiobjective problem with general fuzzy number coefficients is also further discussed, by _ cutset of fuzzy sets a multiobjective problem can be transformed into a interval linear programming problem, and using the method of the previous chapter, we can obtain the pareto less optimal solution

    從模糊數之間的序關系出發，分別定義了弱較優解和較優解，然後對模糊多目標問題引入模糊評價函數，將多目標化為單目標，在此也證明了求得的解為原問題的弱較優解。還討論了系數為一般模糊數的多目標問題，通過模糊集的水平集可將多目標問題轉化為區間數線性規劃問題，並利用上一章所講的方法，得到原問題的弱較優解。最後，對變量為模糊數的線性規劃問題也進行了討論。
  18. 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凸曲面間距離求解的公垂線法和切平面法。公垂線法是把曲面間的距離求解問題轉化成曲面的離散點生成的凸殼間的距離，再歸之為兩凸殼在其公垂線上投影集合間的距離，由此抽象成一個線性規劃問題，估算出近點對。
  19. This verification can be implemented by determining the consistency of a group of linear inequalities, or equivalently, by solving a linear programming problem

    該方法將生存性判別轉化為判別線性不等式組的相容性或等價地轉化為求解一個線性規劃問題。
  20. The consistency of the big m method and two - phase method in idea, auxiliary linear programming problem, initial feasible basis, initial simplex tableau and optimality criterion, etc., is analyzed

    摘要分析了大m法與兩階段法在思想方法、輔助線性規劃問題的構造、初始可行基、初始單純形表、最優性檢驗和演算法步驟等方面的一致性。
分享友人
分享到 Line

分享到臉書