This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
This is essentially a linear programming problem. This case is more special than the general problem, since
这实际上是一个线性编程问题。
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 master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
A multiobjective linear programming problem in which all coefficients are fuzzy Numbers is considered in this paper.
讨论了一类所有系数均为模糊数的多目标线性规划问题。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
Then using the approach to the transportation problem in the linear programming, a network configuration with optimal current-flow and minimum line-loss can be found out.
然后按线性规划中运输问题的解法，寻求最小线损网架的优化电流潮流，从而定出合理的线损最小网架。
A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.
本文运用旋转变换法，经有限次变换后，将普通线性规划（LP）问题，化为一个等价的易于求解的连续背包问题。
The fixed charge transportation problem (FCTP) is a special linear programming problem.
固定费用运输问题是一种特殊的线性规划问题。
This formulation results in a large scale 0-1 programming problem with nonlinear objective function and linear or nonlinear constraints.
该数学表达式表现为一个具有非线性目标函数及线性与非线性约束条件的大规模0 - 1规划问题。
Hence, the proposed controller can be obtained by solving a standard linear programming problem.
因此控制器设计只需解一个标准线性规划问题。
The fuzzy linear programming (FLP) problem with nonlinear membership function (NLMF) is usually a nonlinear programming (NLP) problem.
带有非线性隶属函数(NLMF)的模糊线性规划(FLP)问题。通常是一个非线性规划(NLP)问题。
Basing on the trait of United Logistics and the principle of min-cost, a single-objective linear programming model (SLPM) for the ammunition transportation problem is presented.
结合联勤体制下我军弹药调运的特点，基于最低运费的原则，建立了弹药运输问题的单目标线性规划模型，并通过表上作业法求解了实际算例。
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函数的凝聚特性，将多约束线性规划问题凝聚为单约束优化问题进行求解。
This process can be described as an integrated optimization problem and to solve it by linear programming is a proper option.
这个过程可以用一个综合优化问题进行描述，采用线性规划法来求解。
Presents a special nonlinear programming problems, its objective function contains absolute value symbol, this kind of problem can be transformed to the solution of a linear programming problems.
给出了一类特殊的非线性规划问题，其目标函数中带有绝对值符号，这类问题可以转化为线性规划问题来求解。
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.
对于这类问题，人们通过广泛而深入的研究，得到了许多结论，这些方法都是把模糊线性规划问题转化为经典的线性规划问题。
According to integrated supply policy, a non-linear programming model was built to analyze integrated suppliers ordering problem under the condition of multiple-supplier.
针对集成化供应策略，建立了用于分析多供应商条件下集成供应商订货问题的非线性规划模型。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
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.
关于大规模线性规划问题的有效求解问题一直受到人们的关注。
Based on the first one, the second stage was calculating the process parameters according to the principle of minimizing the total loss of choke energy. It is a typical linear programming problem.
第二阶段是在前一阶段的基础上，根据节流损失最小的原则确定各泵及减压站的增减压值，并转化为线性规划问题求解。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
By linear weighing-sum method, the multi-objective optimization was converted into a linear programming problem with the evaluation equation. Process parameters were optimized with SQP algorithm.
利用线性加权和法，建立了评价函数，将多目标优化问题转化为单目标非线性规划问题。
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.
通过变量代换将问题中的两种耦合关系分解开，使得该问题转化为一个含有复杂约束条件的非线性规划问题。
Finally, numerical experiments are made and the results show that the proposed algorithms in this paper for a class of linear fractional programming problem are very effective.
最后，通过数值实验表明，本文提出的算法对该类线性分式双层规划问题比较有效。
A matrix B-game problem may be transformed into a linear discrete programming problem.
矩阵对策可以转化为线性离散规划求解。
Secondly, game theory is applied to bilevel programming problem for a better illustration and soluntion of the bilevel linear programming problem.
其次，针对二层线性规划问题，将博弈论中非合作的博弈关系应用到二层规划问题中。
The model is formulated as a mixed integer linear programming (MILP) problem.
模型表达为一个混合整数规划(MIL P)问题。
应用推荐