An optimal solution would require linear programming techniques with much less trivial code.
最佳解决方案需要线性编程技术，而且所需的代码更少。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
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.
通过对模型校验策略的分析，讨论了如何建立这一问题的优化模型，并给出了基于线性规划和非线性规划的模型求解方法。
By setting up a commonly linear programming of enterprise product structure optimization, carrying out it and gaining a optimal production.
通过建立企业产品结构优化的一般线性规划模型，进行求解并获得最佳的产品生产计划。
Then, we start from uniform approximation to offer optimal transfer matrix algorithm and use method of linear programming to solve for optimal transfer matrix.
然后从一致逼近出发提出最佳传递矩阵计算法，并利用线性规划的方法求出最佳传递矩阵。
With the purpose to find all optimal solution in linear programming, author also discuss the method under some restraint condition.
结合线性规划求解全部最优解的需要，讨论了具有某些约束条件时的实现方法。
Then using the approach to the transportation problem in the linear programming, a network configuration with optimal current-flow and minimum line-loss can be found out.
然后按线性规划中运输问题的解法，寻求最小线损网架的优化电流潮流，从而定出合理的线损最小网架。
The study shows the optimal collocation model based on the gray layout theory excels in answer's stability and model's adaptability by compared with the similar linear programming models.
研究表明：基于灰色规划原理构建的最佳配置模型在解的稳定性、模型的适应性上要优于同类线性规划模型。
To resolve the problem of the traditional linear sensor networks design not having detailed integer linear programming (ILP) model, an optimal redundant sensor network model was proposed.
针对传统的线性测量网络设计中没有给出具体的整数线性规划(ILP)模型问题，提出一种传感器优化配置模型。
This paper presents two methods of optimal levelling network design based on criterion matrix and linear programming of required precision.
本文介绍了根据准则矩阵和根据所需精度要求的线性规划法水准网优化设计的两种方法。
By a given example optimal mixed strategy is obtained by the method of linear programming.
给出了一个实例，并用线性规划方法得到了最优混合策略。
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.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
A new global optimal algorithm is presented to solve linear programming problems with nonlinear constraints.
本文提出了一种新的适用于处理非线性约束下线性规划问题的全局优化算法。
Based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.
提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。
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.
利用一种新的模糊数排序准则，将约束条件中含有梯形模糊数的模糊线性规划转化为经典的线性规划，进而求得了原模糊线性规划的最优解。
Objective: To search optimal solutions of convex programming problems with linear constraints.
求线性约束凸规划问题的最优解。
Based on the highest comprehensive level of resources exploitation, this paper establishes a linear programming modal to solve the optimal order quantities allocation.
在此基础上，建立了一种线性规划模型，求解使资源利用综合水平最大化的采购量分配方案。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
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方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
The optimal results of the groundwater management in the city were determined by linear programming. Finally, the proposals, consisting o…
用线性规划模型提出淮北市地下水资源的最佳管理方案。
In order to minimize the expected loss of overstock and shortage, first of all the optimal supply is determined, and then a mixed integer linear programming model under certainty is built.
为使潜在的仓库积压和产品缺货的损失最小，首先确定了最优的产品供货量，然后建立了一个确定性的混合整数规划模型。
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.
采用混合整数规划法建立模型，通过对模型的求解和修正，并实施多样化分拨，得出该地区物流配送的最优规划布局。
We can use dynamic programming on the tree decomposition to find an optimal solution in linear time.
我们可以使用树分解的动态规划在线性时间内找到最优解。
This article presents a direct collocation mixed integer linear programming (DCMILP) method for energy-optimal trajectory planning of satellite formation reconfiguration.
针对编队卫星队形重构的轨迹规划问题，提出了直接配置混合整数线性规划(DCMILP)方法。
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.
该跨层设计将问题的求解建模为马尔科夫决策过程，利用线性规划推导出最优的自适应传输策略。
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.
对模型解的分析为决策者提供了改变目标优先级情况下的可供选择的最优方案，因此，线性目标规划法是解决产品分销决策的一种有效方法。
应用推荐