In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年，George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
Linear programming is a tool for solving optimization problems.
线性编程是一个用来解决优化问题的工具。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
Chapter four gives ABS algorithms for solving linear Diophantine inequations and their application in integer linear programming.
第四章给出了求解线性丢番图不等式组的ABS算法及其在整线性规划中的应用。
An integral algebraic linear programming is defined and an algorithm for solving the programming is given.
定义了整代数线性规划，并给出了求解它的算法。
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.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
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.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
This paper analyzes the theory and the method in solving the network problem by the mathematics model of linear programming and graph theory.
分析了用线性规划、图论的方法解决网络问题的理论和算法。
The feasible directions range was obtained by solving two linear programming problems and available feasible directions was get by vector resultant.
通过解两个线性规划问题得出可行方向的范围，由矢量合成得到可行方向。
This paper provides two new methods for solving linear programming problems and its circulation number.
提出了一种新的求解非线性规划问题的算法。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
This article deals briefly with the modeling and solving of methods of linear programming, including the simplex method and some special methods about the transportation problems and as...
本文简述线性规划问题的构模和求解方法，其中包括单纯形法、运输问题和分配问题的特殊解法等。
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方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
Starting from the Operations Research, this paper proposes method of linear programming approach with weight to fitting variogram, effectively guarantee the non-negative of the results of solving.
从运畴学的角度出发，提出了基于带权线性规划的方法拟合变差函数，有效地保证了求解结果的非负性。
This paper sets forward a new, simple, and direct approach to solving the linear maximum function programming.
本文提出了一种求解线性最大值函数规划的简捷方法。
This article deals briefly with the modeling and solving of methods of linear programming, including the simplex method and some special method...
本文简述线性规划问题的构模和求解方法，其中包括单纯形法、运输问题和分配问题的特殊解法等。
There are many methods to solving interior economical operation of the hydroelectric power such as equal incremental equations method, dynamic programming and non-linear programming.
求解水电厂厂内经济运行的方法很多，如等微增率法、非线性规划和动态规划法等。
This article deals with the basic methods for solving unconstrained and constrained nonlinear problems. It describes also the linear approximation methods of nonlinear programming.
本文阐明无约束和有约束非线性问题的基本解法，并说明非线性规划的线性近似方法。
Hence, the proposed controller can be obtained by solving a standard linear programming problem.
因此控制器设计只需解一个标准线性规划问题。
GLPK is a package intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP) problems.
GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(mip)以及相关问题的自由软件包。
A generalized active set method is presented for solving linear programming problems.
给出了解线性规划的广义起作用集法。
In this paper, the writer proposes a method known as linear Pseudo-Boolean inequality system programming for solving the optimization of coefficient words length of IIR digital filters.
本文首次提出将“解线性伪布尔不等式系统”的算法应用于IIR数字滤波器系数字长的优化问题。
Simplex method, for solving linear programming problems common method.
单纯形法，求解线性规划问题的通用方法。
By taking the minimum cost as optimization aim, the synthetic factor method, minimum cost method, and linear programming method of solving assembled dimensional chains are introduced.
以最低制造成本为优化目标，介绍了求解装配尺寸链的综合因子法、最低成本法和线性规划法，为合理分配装配尺寸链中各环公差提供参考。
As one center farm in BINGTUAN for example, this paper establishes the linear programming model of optimal equipment of farming machinery system, and discusses the solving process by Excel.
阐述了农业机器大修理经济界限分析时的指标选择问题，在此基础上给出了农业机器大修理周期长度、修理周期与更新经济界限的计算方法。
As one center farm in BINGTUAN for example, this paper establishes the linear programming model of optimal equipment of farming machinery system, and discusses the solving process by Excel.
阐述了农业机器大修理经济界限分析时的指标选择问题，在此基础上给出了农业机器大修理周期长度、修理周期与更新经济界限的计算方法。
应用推荐