linear programming problem造句
例句與造句
- Secondly , the interval adjustable entropy method for the linear program problem is constructed and its convergence is proved
其次，構(gòu)造了求解線性規(guī)劃問(wèn)題的區(qū)間調(diào)節(jié)熵方法并證明了其收斂性，最后進(jìn)行了大量的數(shù)值實(shí)驗(yàn)。 - To enrich the entropy methods for the linear program problem , the interval adjustable entropy method for the linear program problem is proposed
摘要為豐富線性規(guī)劃問(wèn)題的熵函數(shù)方法，提出了求解線性規(guī)劃問(wèn)題的區(qū)間調(diào)節(jié)熵方法。 - The dissertation takes action about a kind of uncertain linear programming problem with interval numbers and fuzzy numbers in objective programming respectively
本文討論了一類不確定性線性規(guī)劃問(wèn)題? ?目標(biāo)系數(shù)分別為區(qū)間數(shù)和模糊數(shù)的線性規(guī)劃問(wèn)題。 - This verification can be implemented by determining the consistency of a group of linear inequalities , or equivalently , by solving a linear programming problem
該方法將生存性判別轉(zhuǎn)化為判別線性不等式組的相容性或等價(jià)地轉(zhuǎn)化為求解一個(gè)線性規(guī)劃問(wèn)題。 - The method proposed in this paper is a generalization of basis deficiency - allowing variation of the simplex method to linear programming problems with bound constraints
為克服單純形算法中退化現(xiàn)象帶來(lái)的困擾,本文在文[ 1 ]的基礎(chǔ)上進(jìn)一步提出虧基有界變量單純形算法,并證明了算法的收斂性 - It's difficult to find linear programming problem in a sentence. 用linear programming problem造句挺難的
- The main contributions of this dissertation can be summarized as follows : first of all , in the dissertation the linear programming problem whose objective function has interval coefficients is investigated
全文主要內(nèi)容如下：首先，對(duì)目標(biāo)函數(shù)中具有區(qū)間系數(shù)的線性規(guī)劃問(wèn)題進(jìn)行了討論。 - Optimal operation problems in electric power systems are typical non - linear programming problems , in addition , many non - linear , discrete , stochastic and undeterministic factors are involved
電力系統(tǒng)優(yōu)化運(yùn)行是典型的非線性優(yōu)化問(wèn)題，并且涉及到許多非線性、離散、隨機(jī)性及不確定性等因素。 - Firstly , the duality principle is used to change the linear program problem into the minimax problem , an interval extension of the adjustable entropy function is set up and its order of convergence is discussed
首先利用對(duì)偶理論將線性規(guī)劃問(wèn)題轉(zhuǎn)化為極大極小問(wèn)題，建立并討論了調(diào)節(jié)熵函數(shù)的區(qū)間擴(kuò)張及其收斂階。 - 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法與兩階段法在思想方法、輔助線性規(guī)劃問(wèn)題的構(gòu)造、初始可行基、初始單純形表、最優(yōu)性檢驗(yàn)和算法步驟等方面的一致性。 - Network flow problems form a subclass of linear programming problems with applications to transportation , logistics , manufacturing , computer science , project management , finance as well as a number of other domains
網(wǎng)流問(wèn)題構(gòu)成線性規(guī)劃的一個(gè)問(wèn)題子類并可應(yīng)用在運(yùn)輸業(yè),物流業(yè),制造業(yè),電腦科學(xué),專案管理,財(cái)務(wù)學(xué)及數(shù)個(gè)其它領(lǐng)域。 - Network flow problems form a subclass of linear programming problems with applications to transportation , logistics , manufacturing , computer science , project management , finance as well as a number of other domains
網(wǎng)流問(wèn)題構(gòu)成線性規(guī)劃的一個(gè)問(wèn)題子類并可應(yīng)用在運(yùn)輸業(yè),物流業(yè),制造業(yè),計(jì)算機(jī)科學(xué),專案管理,財(cái)務(wù)學(xué)及數(shù)個(gè)其它領(lǐng)域。 - 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
繼續(xù)上述過(guò)程，就能求得線性規(guī)劃問(wèn)題的最優(yōu)解。這就是說(shuō)，自可行域的某頂點(diǎn)出發(fā)，沿可行域的棱經(jīng)過(guò)若干次可行域頂點(diǎn)的轉(zhuǎn)移后，就能得到線性規(guī)劃問(wèn)題的最優(yōu)解(在最優(yōu)解存在的情況下) 。 - 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
本文首先綜述了模糊線性規(guī)劃問(wèn)題中的一些方法和有關(guān)模糊數(shù)排序的幾種方法，然后對(duì)模糊數(shù)的一些排序方法做了推廣，重點(diǎn)討論了模糊數(shù)不等式的問(wèn)題，最后給出了基于置信區(qū)間的一種模糊線性規(guī)劃問(wèn)題。 - 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
摘要對(duì)不等式約束最小二乘平差問(wèn)題，借助非線性規(guī)劃中的凝聚約束方法把多個(gè)不等式約束轉(zhuǎn)化為一個(gè)等式約束，采用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。 - 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
如果線性規(guī)劃問(wèn)題有最優(yōu)解，那么過(guò)可行域的一已知頂點(diǎn)必至少存在這樣一條棱? ?它以該己知頂點(diǎn)為一端點(diǎn)，可行域的另一頂點(diǎn)為另一端點(diǎn)，并使目標(biāo)函數(shù)在另一端點(diǎn)的函數(shù)值優(yōu)于己知端點(diǎn)的函數(shù)值，否則，該己知點(diǎn)就是線性規(guī)劃問(wèn)題的最優(yōu)解。