Since the development of the simplex algorithm, linear programming has been used to solve optimization problems in industries as diverse as banking, education, forestry, petroleum, and trucking.
由于simplex算法的出现，线性编程已经在工业界、银行界、教育界、林业、石油行业以及运输业界中广泛地用来解决优化问题。
In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年，George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program.
二分单纯形算法中，线性规划问题的最优解是通过求解一系列子问题来实现的。
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.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
Based on variable substitution and the simplex method for linear programming, the paper also discusses the global optimization algorithm for the absolute value programming.
同时，引入变量代换，基于线性规划的单纯形法，提出该类绝对值规划问题的全局优化求解算法。
The simplex optimization method about nonlinear programming problem has been used in the mixed acid linear titration and the effect of various factors on computative speed has been discussed.
将非线性规划问题的单纯形加速法用于混合酸的线性滴定计算，同时优化酸浓度及有关条件常数，求出酸浓度的最优解。 讨论了影响单纯形法计算速度的因素。
Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
Simplex method, for solving linear programming problems common method.
单纯形法，求解线性规划问题的通用方法。
According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
Methods of building linear programming mathematical model for feed compounding and main procedure of realizing improveds simplex algorithm with computer are presented in this paper.
本文首先阐述了如何建立饲料配方的线性规划数学模型，以及用计算机实现改进单纯形算法的主要步骤。
Furthermore a simplex method of the random linear programming is discussed, and the solution for fuzzy random linear programmings is studied.
进一步，我们讨论了随机线性规划的单纯形法，并且研究了这两种模糊随机线性规划的解法。
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...
本文简述线性规划问题的构模和求解方法，其中包括单纯形法、运输问题和分配问题的特殊解法等。
The fuzzy linear programming is changed into general linear programming and solved by simplex method.
通过变换，将模糊线性规划问题转化成一般线性规划问题，用单纯形法求解。
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).
提出了一种求解线性规划(LP)的改进的单纯形法，其迭代过程产生的一部分极点可能出现在可行域外成为不可行极点，因此称之为外点单纯形法。
This article deals briefly with the modeling and solving of methods of linear programming, including the simplex method and some special method...
本文简述线性规划问题的构模和求解方法，其中包括单纯形法、运输问题和分配问题的特殊解法等。
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.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
The symmetric difference decomposition method gives an algorithm for the former problem (§4), which is equivalent to the revised simplex algorithm for linear programming.
用对称差分解法自然得到一个算法（§4），相当于改进单纯形算法。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
应用推荐