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 全文主要内容如下:首先,对目标函数中具有区间系数的线性规划问题进行了讨论。
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 电力系统优化运行是典型的非线性优化问题,并且涉及到许多非线性、离散、随机性及不确定性等因素。
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 首先利用对偶理论将线性规划问题转化为极大极小问题,建立并讨论了调节熵函数的区间扩张及其收敛阶。
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法与两阶段法在思想方法、辅助线性规划问题的构造、初始可行基、初始单纯形表、最优性检验和算法步骤等方面的一致性。
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 网流问题构成线性规划的一个问题子类并可应用在运输业,物流业,制造业,电脑科学,专案管理,财务学及数个其它领域。
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 网流问题构成线性规划的一个问题子类并可应用在运输业,物流业,制造业,计算机科学,专案管理,财务学及数个其它领域。
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 继续上述过程,就能求得线性规划问题的最优解。这就是说,自可行域的某顶点出发,沿可行域的棱经过若干次可行域顶点的转移后,就能得到线性规划问题的最优解(在最优解存在的情况下) 。
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 本文首先综述了模糊线性规划问题中的一些方法和有关模糊数排序的几种方法,然后对模糊数的一些排序方法做了推广,重点讨论了模糊数不等式的问题,最后给出了基于置信区间的一种模糊线性规划问题。
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 摘要对不等式约束最小二乘平差问题,借助非线性规划中的凝聚约束方法把多个不等式约束转化为一个等式约束,采用拉格朗日极值法求解,解与贝叶斯解或单纯形解一致。
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 如果线性规划问题有最优解,那么过可行域的一已知顶点必至少存在这样一条棱? ?它以该己知顶点为一端点,可行域的另一顶点为另一端点,并使目标函数在另一端点的函数值优于己知端点的函数值,否则,该己知点就是线性规划问题的最优解。