It's a typical large-scale non-linear programming problem.
它是典型的大型多约束非线性规划问题。
One of the most important thing is a pure integer linear programming problem.
其中最重要的是纯整数线性规划问题。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
The fixed charge transportation problem (FCTP) is a special linear programming problem.
固定费用运输问题是一种特殊的线性规划问题。
Hence, the proposed controller can be obtained by solving a standard linear programming problem.
因此控制器设计只需解一个标准线性规划问题。
The discussion of the relation of bilevel linear programming problem(BLPP) and BBPP is also given.
此外，还讨论了二层线性规划与双目标规划的关系。
This is essentially a linear programming problem. This case is more special than the general problem, since
这实际上是一个线性编程问题。
Secondly, we consider the degenerate linear programming problem with upper bounded variable constrained.
第二，我们研究了变量有上界的退化线性规划问题。
A multiobjective linear programming problem in which all coefficients are fuzzy Numbers is considered in this paper.
讨论了一类所有系数均为模糊数的多目标线性规划问题。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
Finally, after summarizing the contents in the thesis, we point out the further directions to study the degenerate linear programming problem.
最后，在总结以上研究的基础上，给出了退化线性规划问题进一步研究的研究方向。
Secondly, game theory is applied to bilevel programming problem for a better illustration and soluntion of the bilevel linear programming problem.
其次，针对二层线性规划问题，将博弈论中非合作的博弈关系应用到二层规划问题中。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
People solve linear programming problem without ready-made feasible basis often adopting traditional method by introducing an auxiliary programming problem.
对没有现成可行基的线性规划问题，目前都采用传统的引进辅助规划问题的方法求解。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
The dissertation takes action about a kind of uncertain linear programming problem with interval numbers and fuzzy numbers in objective programming respectively.
本文讨论了一类不确定性线性规划问题一一变量为三角模糊数的线性规划问题。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
Apply singular value decomposition and generalize inverse of the matrix to discuss the existence and uniqueness of the solution of the standard linear programming problem.
用矩阵的奇异值分解和广义逆讨论标准线性规划问题解的存在性和唯一性问题。
Using K-T condition and the aggregation properties of KS function, a multi-constraints linear programming problem is become a single constraint linear programming problem.
提出了一种求解线性规划问题的新方法：利用K—T条件及KS函数的凝聚特性，将多约束线性规划问题凝聚为单约束优化问题进行求解。
It is a linear programming problem with minimizing the total operational cost as its object function and taking the restraint of are and node capacities into consideration.
模型以路网总的运营费用最低作为目标函数，同时考虑了线路、车站的能力约束。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
As for this kind of programming, people mainly turn a fuzzy linear programming problem into a classical linear programming through extensive investigation before we solved the problem.
对于这类问题，人们通过广泛而深入的研究，得到了许多结论，这些方法都是把模糊线性规划问题转化为经典的线性规划问题。
The efficient algorithms for large-scale linear programming problem have been attracting considerable attention from both theorists and practitioners in a variety of disciplines since 1970s.
关于大规模线性规划问题的有效求解问题一直受到人们的关注。
The two different kinds of combined relations in this problem are de-coupled by variable replacing, and the problem is changed into a non-linear programming problem with complex constraints.
通过变量代换将问题中的两种耦合关系分解开，使得该问题转化为一个含有复杂约束条件的非线性规划问题。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
应用推荐