In this paper the meaning and role of shadow prices on the Dual linear programming in the readjustment of Feed formula are discussed.
本文探讨了对偶规划中的影子价格和灵敏度分析在饲料配方调整中的意义和作用。
Initiating the construction of CGE model together with its dual linear programming and values traced, the paper expatiates the contribution o.
本文从CGE模型的构建过程以及对偶线性规划、影子价格等方面阐述了线性规划理论与方法对古典经济学理论的贡献。
Then using the thought of the surrogate dual of DC programming, the surrogate dual of bilevel linear programming and the duality properties are given.
利用DC规划共轭对偶的思想，讨论解型线性双层规划的共轭对偶规划及其对偶性质。
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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
This paper proposes a command and control method of the battlefield materials transportation, which is based on linear programming and dual analysis.
一种基于线性规划及对偶分析的战场物资运输的指挥控制方法为解决此类问题提供了一种可行途径。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
In linear programming, a series of theorems of dual theory are adopted to deal with the linear programmings with unbounded variables.
线性规划中对偶理论的一系列定理是针对变量无上界的线性规划的。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes.
针对目标函数具有递增斜率的分段线性规划问题，提出了一种快速的对偶算法。
Based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.
提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。
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.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。
First, the main procedures and the distinctive features of the most-obtuse-angle (MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming.
首先回顾了采用最钝角行、列主元规则求解线性规画问题的原始、对偶可行解的主要过程，阐述了其与众不同的特性。
A primal-dual neural network(PDNN)based on linear variational inequalities(LVIs)is introduced as the real-time solver for the resultant quadratic programming scheme.
提出了基于线性变分不等式的原对偶神经网络，并将其作为所对应的二次型规划方案的实时求解器。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
应用推荐