According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
An optimal solution would require linear programming techniques with much less trivial code.
最佳解决方案需要线性编程技术，而且所需的代码更少。
This paper discusses how to found its optimal model through the analysis of model check countermeasure and proposes its solution based on linear and non-linear programming.
通过对模型校验策略的分析，讨论了如何建立这一问题的优化模型，并给出了基于线性规划和非线性规划的模型求解方法。
The optional solution of fuzzy multiple objective linear programming is not unique due to uncertain goals and parameters.
由于目标和参数的不确定性，模糊多目标线性规划的最优解不是唯一的。
With the purpose to find all optimal solution in linear programming, author also discuss the method under some restraint condition.
结合线性规划求解全部最优解的需要，讨论了具有某些约束条件时的实现方法。
The solution to the problem of parametric linear programming by lumped matrix is discussed and ordinary method is given.
用分块矩阵法讨论了参数线性规划问题的求解方法，并给出了一般的公式。
Apply singular value decomposition and generalize inverse of the matrix to discuss the existence and uniqueness of the solution of the standard linear programming problem.
用矩阵的奇异值分解和广义逆讨论标准线性规划问题解的存在性和唯一性问题。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
Furthermore a simplex method of the random linear programming is discussed, and the solution for fuzzy random linear programmings is studied.
进一步，我们讨论了随机线性规划的单纯形法，并且研究了这两种模糊随机线性规划的解法。
We can use dynamic programming on the tree decomposition to find an optimal solution in linear time.
我们可以使用树分解的动态规划在线性时间内找到最优解。
To some certain extent, the proposed method improves the computational complexity problem resulting from state explosion and solution to the linear programming problems.
这种优化的算法在一定程度上改善了由状态爆炸引起的求解线性规划次数指数级递增的问题；
Theoretical analysis and case study show this method can guarantee the network to converge to non inferior solution of the multiobjective linear programming.
理论分析和实例研究证明，该方法能保证网络收敛于原规划的非劣解。
The stability of the solution of grey linear programming is discussed.
并讨论了当决策者调整愿望偏好时，灰线性规划解的稳定性。
Presents a special nonlinear programming problems, its objective function contains absolute value symbol, this kind of problem can be transformed to the solution of a linear programming problems.
给出了一类特殊的非线性规划问题，其目标函数中带有绝对值符号，这类问题可以转化为线性规划问题来求解。
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方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
The solution to the cross-layer design is modeled as a Markov decision process and utilizes the linear programming method to obtain the optimal adaptive transmission policy.
该跨层设计将问题的求解建模为马尔科夫决策过程，利用线性规划推导出最优的自适应传输策略。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
Through the analysis of the feasible solution of the linear programming, the sensitivity analysis of DEADA on linear assumption in the errors of sampled observations was discussed.
通过对线性规划可行解的分析，讨论了在线性假设下，改变决策单元数据时DEA -DA模型的灵敏度分析问题。
An approach to obtaining possible effective solution is proposed and an extension of interval number linear programming is given.
给出了求可能有效解的方法，并对区间数线性规划进行拓展。
In the process of its solution, the multiobjective programming problem is transformed to a linear programming one with the aid of qualitative analysis.
在求解过程中，结合定性分析的手段，将多目标规划问题转化成单目标的线性规划问题，使得求解简单易行，有利于进行多方案分析和评价。
In this paper, We advance multiple objective linear programming with interval Numbers, According to the method of interval Numbers, We given find solution method of the model.
提出了具区间数的多目标线性规划模型，根据对区间数的处理方法，给出了该模型的求解方法。
Fuzzy linear programming with trapezoid fuzzy Numbers in restricted condition is transformed into classical linear programming by using a new ranking criterion, and an optimal solution is obtained.
利用一种新的模糊数排序准则，将约束条件中含有梯形模糊数的模糊线性规划转化为经典的线性规划，进而求得了原模糊线性规划的最优解。
This paper solves some special estimating value problems of double integral with the help of the optimality principle and graphical solution of the linear programming.
利用线性规划论的最优性原理和图解法解决一些特殊二重积分的估值问题。
A model was built based on mixed-integer linear programming. Through the model solution and revision and diverse distribution, the optimal layout of the logistics distribution of an area was obtained.
采用混合整数规划法建立模型，通过对模型的求解和修正，并实施多样化分拨，得出该地区物流配送的最优规划布局。
From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph.
从一实例分析出发，推导出一般线性目标规划数学模型的多重解结构为一无向图。
Solutions of this model offer decision-makers an alternative optimal solution. This linear goal programming model is an effective method to make product distribution decisions.
对模型解的分析为决策者提供了改变目标优先级情况下的可供选择的最优方案，因此，线性目标规划法是解决产品分销决策的一种有效方法。
Solutions of this model offer decision-makers an alternative optimal solution. This linear goal programming model is an effective method to make product distribution decisions.
对模型解的分析为决策者提供了改变目标优先级情况下的可供选择的最优方案，因此，线性目标规划法是解决产品分销决策的一种有效方法。
应用推荐