Linear programming is a tool for solving optimization problems.
线性编程是一个用来解决优化问题的工具。
Many tools are available to solve linear programming problems.
有很多工具都可以用来解决线性编程的问题。
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算法的出现，线性编程已经在工业界、银行界、教育界、林业、石油行业以及运输业界中广泛地用来解决优化问题。
Clegg et al. (1995) explain that in the electronics industry linear-programming models can be used to analyse the viability of the recovered parts in remanufacturing.
克莱格等人(1995)解释说，电子行业的线性规划模型可以用来分析在再制造过程中回收零部件的可行性。
The GNU linear Programming Kit (GLPK) is a library of routines that use well-known operations research algorithms to solve linear problems.
GNULinear ProgrammingKit (GLPK)是一个使用了众所周知的运筹学算法来解决线性问题的程序库。
Linear programming is widely used throughout the world.
线性规划在全世界范围内被广泛应用。
Linear programming is one of the most important methods in optimization.
线性规划是一种重要的最优化方法。
This paper discusses the necessity and feasibility of applying linear programming models in the development and utilization of rural energy sources.
本文分析了线性规划模型在农村能源开发利用中运用的必要性和可行性。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
A multiobjective linear programming problem in which all coefficients are fuzzy Numbers is considered in this paper.
讨论了一类所有系数均为模糊数的多目标线性规划问题。
The facts show that linear programming theory can effectively solve such problems.
事实证明，线性规划理论能够有效地解决产品结构优化决策问题。
The master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
This paper discussed some qualities of a kind of the Fuzzy linear programming, and then gave the definition of the shadow price of the Fuzzy restriction.
本文讨论了一类模糊线性规划的几个性质，给出了模糊约束影子价格的定义。
A stochastic linear programming model with simple recourse was developed to study the asset and liability management of Banks under uncertainties based on the domestic economic environment.
使用带有简单补偿的随机线性规划模型，研究不确定下的银行资产负债管理问题。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
The fixed charge transportation problem (FCTP) is a special linear programming problem.
固定费用运输问题是一种特殊的线性规划问题。
The optional solution of fuzzy multiple objective linear programming is not unique due to uncertain goals and parameters.
由于目标和参数的不确定性，模糊多目标线性规划的最优解不是唯一的。
Secondly, we consider the degenerate linear programming problem with upper bounded variable constrained.
第二，我们研究了变量有上界的退化线性规划问题。
The optimization problem is solved with the sequential linear programming algorithm.
优化问题求解采用序列线性规划算法。
According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
A standard form of interval linear programming was defined.
定义了区间线性规划的标准型。
In this paper, a new linear programming algorithm of optimization design for cylindrical spiral spring is introduced.
本文给出了圆柱螺旋弹簧优化设计的一种新算法——线性规划算法。
Trust region interior point method can settle the problem of adjusting step sizes on successive linear programming well.
信赖域内点法可以很好地解决逐线性规划方法中的步长调整问题。
The solution to the problem of parametric linear programming by lumped matrix is discussed and ordinary method is given.
用分块矩阵法讨论了参数线性规划问题的求解方法，并给出了一般的公式。
Finally, after summarizing the contents in the thesis, we point out the further directions to study the degenerate linear programming problem.
最后，在总结以上研究的基础上，给出了退化线性规划问题进一步研究的研究方向。
Then, we start from uniform approximation to offer optimal transfer matrix algorithm and use method of linear programming to solve for optimal transfer matrix.
然后从一致逼近出发提出最佳传递矩阵计算法，并利用线性规划的方法求出最佳传递矩阵。
In this paper, bilevel linear programming with fuzzy coefficients is studied.
研究具有模糊系数的两层线性规划问题。
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 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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
应用推荐