The optimization problem is solved with the sequential linear programming algorithm.
优化问题求解采用序列线性规划算法。
In this paper, a new linear programming algorithm of optimization design for cylindrical spiral spring is introduced.
本文给出了圆柱螺旋弹簧优化设计的一种新算法——线性规划算法。
Based on partial preference information (i. e. weight), this paper presents a linear programming algorithm for multi objective decision making.
基于部分偏好信息(目标权重)，本文提出了多目标决策的一种线性规划算法。
This paper describes a non-linear programming algorithm for the optimization of voltage and reactive power in the electric power system. The reduced gradient method is used in the algorithm.
本文叙述了采用非线性规划法进行电力系统无功和电压优化的一种实用方法，其数学模型为梯度法。
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算法——来解决线性编程的问题。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
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.
本文首先阐述了如何建立饲料配方的线性规划数学模型，以及用计算机实现改进单纯形算法的主要步骤。
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, the authors present an algorithm to handle linear fractional programming in the general form directly, which need not transform the constraints of the problem into the standard form.
本文提出一个直接处理一般形式线性分式规划的算法而不需要把问题的约束条件转化为标准形式。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
In this paper, the descending dimension algorithm for nonlinear programming problems with linear equality constraints are discussed.
本文研究含有线性等式约束的非线性规划问题的降维算法。
A linear scaling(LS) based dynamic programming(DP) algorithm was developed for accurate matching of queries by humming.
提出一种用于哼唱识别精确匹配的线性伸缩动态规划算法。
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 algorithm can be applied to various linear and nonlinear bilevel programming problems.
算法适用于各类线性和非线性二层规划问题。
A new global optimal algorithm is presented to solve linear programming problems with nonlinear constraints.
本文提出了一种新的适用于处理非线性约束下线性规划问题的全局优化算法。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
Based on simple and practical idea for an algorithm, some improvements of the new algorithm for linear programming are given. It makes the method more simple and efficient.
本文基于算法要简单实用的思想，对一种线性规划新算法中的核心算法进行改进，使其计算方法更简单计算量更少，使整个算法更为可行有效。
Proposed the model of fuzzy chance constrained programming with fuzzy decision, and did some research on fuzzy linear support vector regression (algorithm) on this base.
给出带有模糊决策的模糊机会约束规划模型，在此基础上，研究模糊线性支持向量分类机(算法)和模糊线性支持向量回归机(算法)。
An interactive linear fractional programming algorithm is presented to solve multiple attribute decision problems based on the assumption that the decision-maker has a linear utility function.
基于决策者的线性效用函数提出了一种求解多属性决策问题的交互线性分式规划算法。
The core algorithm is the generation and selection based on integer linear programming (ILP).
该系统的核心算法是基于整数规划的“生成与选择”方法。
The model of bilevel linear programming which upper lever has without constraint is discussed in this paper, the algorithm which can find all vertexes of the programming is given.
讨论的是上层不带约束的二层线性规划模型，给出了求其所有顶点的算法，此算法为进行二层线性规划的灵敏度分析打下了坚实的基础。
An integral algebraic linear programming is defined and an algorithm for solving the programming is given.
定义了整代数线性规划，并给出了求解它的算法。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
应用推荐