linear programming problem的意思|示意

美 / / 英 / /

[数] 线性规划问题


linear programming problem的网络常见释义

线性规划问题 ...)满足条件,将(1)式分数规划问题(fractional programming problem)转换成较容易处理的线性规划问题 (linear programming problem):

规划问题 多期供应链网络均衡模型的研究 - docin.com豆丁网 Seidel法、与牛顿法幅1。 同年,Boyce也提出各种关于网络均衡与设计问题的模型,其中对线性 规划问题(LinearProgrammingProblem,LP)、二次规划问题(Quadratic Programming Problem,QP)、中凸性规划问题(

linear programming problem相关短语

1、 dual linear programming problem 对偶线性规划问题

2、 integer linear programming problem 整数线性规划问题

3、 solving linear programming problem 解线性规划问题

linear programming problem相关例句

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方法)是一种比较有效的求解有约束非线性规划问题的算法,但它只能得到局部最优解。

One of the most important thing is a pure integer linear programming problem.

其中最重要的是纯整数线性规划问题。

A multiobjective linear programming problem in which all coefficients are fuzzy Numbers is considered in this paper.

讨论了一类所有系数均为模糊数的多目标线性规划问题。

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.

内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。

Hence, the proposed controller can be obtained by solving a standard linear programming problem.

因此控制器设计只需解一个标准线性规划问题。

This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.

本文通过对线性规划问题中的核心矩阵的分析,提出了一种基于核心矩阵的原始对偶算法。