1,721,196 research outputs found
最优控制问题中改进高阶脉冲波型的方法
No full textOptimal control problem with linear unrestricted control is considered. We do some transformations of this problem to the nonlinear one for which the classical solving methods are effective. Algorithm of improvement is suggested. Approximation of piecewise continuous trajectories of system using continuous functions is constructed
严格凸二次规划的拟单纯解法
No full textIn this paper, a robust method of directly searching the optimum objective point for strictly convex quadratic programming is presented, while no Kuhn-Tucker condition is applied to the solution. During the searching procedure the objective point is moved along a broken line on the boundary of the constraint polyhedron. This idea moving the objective point may be considered a natural generalization of the simplex method for linear programming where the objective point is moved from a vertex to another
Non-Lyapunov stability of linear singular systems: A quite new approach in time domain
No full textThe main features of Non - Lyapunov stability concept have been extended to the linear regular time-invariant singular systems operating in free regime. In comparison to the previous results, based on Lyapunov-like concept and matrix measure approach a quite new idea has been applied yielding the sufficient conditions of this type of stability for above mentioned class of systems. Brief discussion on derived results is given. Definition and corresponding theorem were stated and proved for a general class of autonomous linear singular systems, which guarantee theirs finite time stability on time invariant sets in state space. Presented results need not calculation of so called Drazin inverse, what enables one to get the easiest form of solutions as well the quick check of results derived. In comparison with the previous results this one is less conservative what can be shown by numerical examples
Isometric Cylinder Method for Strict Mixed-integer Linear Programming
No full textIn this paper, we solve strict mixed-integer linear programming not including integer linear programming by isometric cylinder method under the MATLAB environment. The algorithm considers the optimization problems for both whole and real variables of the strict mixed-integer linear programming, and can quickly obtain the optimal mixed-integer point simultaneously using isometric planes and cutting planes derived from polyhedral-cones and rounded-minimal-cylinders at the highest vertex. Only a few linear programming problems need to be solved. Numerical tests show the conclusions
Incompletely Enumerative Solution for 1D Cutting-Stock Problem
No full textThis paper analyzes the linear programming method for 1D cutting-stock problem, and presents and argues an incompletely enumerative solution. With the incomplete enumeration of single-cutting-modes, the optimal cutting-stock mode is approximately obtained under lower computational cost. Some numerical experiments show us the conclusion. A complete mathematical model of 1D cutting-stock problem is presented at the end of paper
Incompletely enumerative solution for 1D cutting-stock problem II
No full textIn this note, several implicitly enumerative properties of the incompletely enumerative solution for 1D cutting-stock problem given by [Far East J. Math. Sci. (FJMS) 5(1) (2002), 25-46] are proved
An iterative solution for the travelling salesman problem
No full textThe travelling salesman problem (TSP) is a typical NP-hard problem. In this paper, a well implied enumeration method for TSP is presented where the solution of the TSP is obtained by an iterative process. At each iteration, an integer linear programming is solved by the isometric surface method. The efficiency of the algorithm is dependent on that of the integer linear programming
IMPROVED DYNAMIC PROGRAMMING ALGORITHM FOR UNCONSTRAINED TWO-DIMENSIONAL STOCK CUTTING PROBLEM
No full text本文给出了一种求解无限制板材下料问题的动态规划解法,对该算法的计算复杂度进行了分析.并针对算法的特点提出了改进方案.通过理论分析得到改进方案的适用范围,并描述了这一改进动态规划算法的应用前景.数值实验表明,该算法可以缩简传统动态规划算法的计算时间和空间,同时得到解的最优值
- …
