1) Linear programming with upper and lower bounded variables
变量有上、下界的LP
2) upper bounded variable
有上界变量
3) linear programming with bounded variables
变量有上界的线性规划
1.
In this paper a dual simplex method for linear programming with bounded variables was given, which generalizes and extends the classic dual simplex method for a general linear programming.
给出变量有上界的线性规划问题的对偶单纯形算法 ,该算法包含了一般线性规划问题的对偶单纯形算法 ,为解变量有上界的线性规划问题提供了又一种方
4) upper-lower limit variables
变量带上下界
1.
This paper introduces the interior point algorithm with upper-lower limit variables and its theory and practice.
首先给出了变量带上下界的内点算法及其理论,并在计算机上实现了该算法。
2.
This paper presents and deduces strictly the interior-point method with upper-lower limit variables (IPML), which bases on Karmarkar s algorithm (KA) and is an improvement and development of KA.
本文提出了变量带上下界的内点算法,并对它进行了理论分析和推导。
5) Lp boundedness
Lp有界
6) the boundedness of L~p
Lp有界性
补充资料：变量与变量值
可变的数量标志和所有的统计指标称作变量。变量的数值表现称作
变量值，即标志值或指标值。变量与变量值不能误用。
变量值，即标志值或指标值。变量与变量值不能误用。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条