用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal.
最优路径规划是智能车辆导航定位系统中一个非常关键的问题。
The optimum path search is a very important problem in the intelligent vehicle guidance and location system.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
该方法将网络训练问题变换为一系列的凸规划子问题，而这些子问题都可以在较短时间内获得全局最优解。
The proposed method transforms the training problem into a number of convex subproblems which can be solved in shorter time to obtain globally solutions.
样条方法是当前自由曲线曲面造型最为常用的方法，动态规划为解决离散最优化问题的有效手段。
B-spline is the most popular method to present free-form curve and surface, and DP algorithm is the effective approach for solving discrete optimization problems.
在相对运动二冲量最优控制的基础上，求解了编队规划问题。
Based on two-impulse optimal control for relative motion, the formation planning problem is solved.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
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.
考虑当目标函数在约束条件下的最优值作扰动时，使各约束作极小扰动的非线性规划问题。
The nonlinear programming problem that the constraint perturbation attains minimum under the condition when the objective function makes its optimal perturbation is considered.
它为工业机器人在非线性运动学约束条件下的时间最优轨迹规划及控制问题提供了一种较好的解决方案。
It provides a better solution to the problem of industrial robot's time optimal trajectory planning and control under the nonlinear kinematical constraints.
分别利用了共轭函数法与直接配置和非线性规划方法对异面最优变轨问题进行了求解。
Adjoint function algorithms and direct collocation and nonlinear programming methods are applied to resolve the non-coplanar optimal orbit transfers problem.
针对考虑负荷概率分布的随机最优潮流问题，建立了相应的机会约束规划模型。
A chance constrained programming model is built to the stochastic optimal power flow problem (S-OPF) considering load probabilistic distributions.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
求线性约束凸规划问题的最优解。
Objective: To search optimal solutions of convex programming problems with linear constraints.
本文首先介绍了国内外喷漆机器人离线编程系统的研究现状及意义，提出了喷枪最优轨迹规划问题(OTPP)。
This paper first describes the research purport and current research level of the off-line programming system for painting robot, and points out the Optimal Trajectory Planning Problems (OTPP).
给出了一类整数规划问题有唯一最优解的充要条件。
The number of the most optimal solutions of this integer programming is determined.
讨论了一类特殊的非线性规划问题，给出了其最优解的解析表达式，最后给出了一个例子。
A class of special nonlinear programming is discussed. The analytic expression of the optimal solution is given. And an example is finally presented.
本文以极大极小代数为基础，给出了一种求解水资源最优规划问题的代数算法。最后用实例验证了该法的有效性。
On the base of the minimax-algebra, this paper proposes an algebra method to solve the optimum planning question of the water resources, and this paper proves its effectiveness by a real example.
针对移动机器人的最速编队问题，结合路径规划和任务分解，提出一种分派问题的新解法和时间最优的编队策略。
A kind of time optimal formation strategy is proposed, which is based on path planning and task decomposition as well as an effective algorithm for assignment problem.
建立了求解最优控制问题的连续微分动态规划算法步骤。
The steps of continuous differential dynamic programming were established for this optimal control problem.
研究了在两固定端点之间运动的三连杆平面欠驱动机械臂的最优运动规划问题。
An optimal motion planning scheme for a three-link planar under-actuated manipulator moving between two stationary states was considered.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
针对现有大区域范围路径规划算法存在的一些问题，提出一种限制搜索区域的多比例尺最优路径规划算法。
In allusion to some problems of existing route planning algorithm of large area, a multi-scale optimal route planning algorithm within restricted searching area was proposed.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
本文引述了动态规划中的最优化原则和一些有关单变量和多变量问题的求解方法。
In this article, we introduce the principle of optimality in dynamic programming and some methods for solving certain simple variable and multi-variable problems.
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
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.
最后，应用近似化方法和黎曼度量方法，研究了机器人最优轨迹规划的问题。
In the end, the problem of robot trajectory planning is investigated by the linearization method and Riemannian metric.
炼钢厂的均衡，连续作业是十分重要的问题。本文首先利用动态规划最优化原理对该问题作了一般性分析。
By means of the optimality principles of the dynamic programming, this paper has given a general analysis of the coordination and the continual operation in a steel mill.
文中着重介绍了当对偶规划问题数学模型出现重复方程时，可通过重构原规划问题的方法，求得问题的最优解。
Emphasis is given to that when repeated equations appear in the mathematical model of the duality programming problem, global optimized solution can be obtained by reconstructing the original program.
文中着重介绍了当对偶规划问题数学模型出现重复方程时，可通过重构原规划问题的方法，求得问题的最优解。
Emphasis is given to that when repeated equations appear in the mathematical model of the duality programming problem, global optimized solution can be obtained by reconstructing the original program.
应用推荐