本文提出用模糊线性规划求解网络计划最低费用日程的优化方法。
This paper discusses an optimization method to determine the minimum cost scheduling in network schedule by means of fuzzy linear programming.
本文使用递减梯度和基变换技术的惩罚线性规划求解杆系结构的极限载荷。
In present paper we use a penalty linear programming method using Reduced Gradient Basis-Exchange Techniques to find the limit load of structures of beam systems.
结合线性规划求解全部最优解的需要，讨论了具有某些约束条件时的实现方法。
With the purpose to find all optimal solution in linear programming, author also discuss the method under some restraint condition.
通过对模型校验策略的分析，讨论了如何建立这一问题的优化模型，并给出了基于线性规划和非线性规划的模型求解方法。
This paper discusses how to found its optimal model through the analysis of model check countermeasure and proposes its solution based on linear and non-linear programming.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
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 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.
在此基础上，建立了一种线性规划模型，求解使资源利用综合水平最大化的采购量分配方案。
Based on the highest comprehensive level of resources exploitation, this paper establishes a linear programming modal to solve the optimal order quantities allocation.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
单纯形法是求解线性规划问题的有效方法。
Simplex algorithm is an effective method for solving linear programming problem.
优化问题求解采用序列线性规划算法。
The optimization problem is solved with the sequential linear programming algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
利用单纯形法求解该线性规划问题，便可得到整数规划的最优解。
By using simplex method to solve the LP, the optimal solution of ILP can be obtained.
提出了一种求解线性规划(LP)的改进的单纯形法，其迭代过程产生的一部分极点可能出现在可行域外成为不可行极点，因此称之为外点单纯形法。
This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).
通过建立企业产品结构优化的一般线性规划模型，进行求解并获得最佳的产品生产计划。
By setting up a commonly linear programming of enterprise product structure optimization, carrying out it and gaining a optimal production.
讨论带不等式和等式约束优化问题，提出了求解非线性规划问题的广义摄动梯度投影算法。
In this paper, the constrained optimization problem is discussed to arrive at a general perturbed gradient projection method for solution.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。
Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied.
用分块矩阵法讨论了参数线性规划问题的求解方法，并给出了一般的公式。
The solution to the problem of parametric linear programming by lumped matrix is discussed and ordinary method is given.
给出了一类特殊的非线性规划问题，其目标函数中带有绝对值符号，这类问题可以转化为线性规划问题来求解。
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.
二分单纯形算法中，线性规划问题的最优解是通过求解一系列子问题来实现的。
In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program.
几何规划是求解非线性规划问题的一个有效方法，该方法已成功地用于工程优化设计。
Geometric programming is a effective method for solving nonlinear programming. This method has been successfully used in optimization design of engineering.
给出了一类约束函数单调而目标函数非单调的非线性规划问题的一种新的求解方法。
A new method is applied to a kind of nonlinear programming problem with monotonic functions and non-monotonic objective functions.
建立了基于浇次计划的炉次计划模型，经过变换，将混合整数规划问题转化为线性规划迭代求解问题。
A model of furnace plan based on casting plan was established, which was converted from mixed integral program problem to linear program problem.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
给出了不需引入人工变量的线性规划问题的求解算法。
Then a new algorithm for linear programing is described and proved without the use of any artificial variable.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
应用推荐