The analytic solution to an optimal control problem is investigated using the canonical dual method. By means of the Pontryagin principle and a transformation of the cost functional, the optimal control of a nonconvex...
详细信息
The analytic solution to an optimal control problem is investigated using the canonical dual method. By means of the Pontryagin principle and a transformation of the cost functional, the optimal control of a nonconvex problem is obtained. It turns out that the optimal control can be expressed by the costate via canonical dual variables. Some examples are illustrated. Copyright (C) 2009 *** and ***.
In this paper, we study the following nonlinear nonconvex programming problem: {minf(x)/ε.t.g.(x)≤0,i∈M,M={1.2,...,M}. Under the condition that the feasible set is bounded and connected, but it has a point that t...
详细信息
In this paper, we study the following nonlinear nonconvex programming problem: {minf(x)/ε.t.g.(x)≤0,i∈M,M={1.2,...,M}. Under the condition that the feasible set is bounded and connected, but it has a point that the boundary is not regular at this point, we propose the combined homotopy method to solve this problem by constructing a new constraint function and a combined homotopy equation. The convergence of the method is proved and the existence of a smooth homotopy path from any interior point to a solution of the problem is *** method is very different from previous homotopy method. Numerical examples show that this method is feasible and effective.
In this paper,we study the following nonlinear nonconvex programming problem:min f(x),***(x) ≤0,i ∈M,M={1,2,···,m}.Under the condition that the feasible set is bounded and connected,and the feasible s...
详细信息
In this paper,we study the following nonlinear nonconvex programming problem:min f(x),***(x) ≤0,i ∈M,M={1,2,···,m}.Under the condition that the feasible set is bounded and connected,and the feasible set does not satisfy the pseudonormal cone conditions,we propose the combined homotopy method to solve this problem by constructing new constraint functions and a combined homotopy *** convergence of the method is proved and the existence of a smooth homotopy path from any interior point to a solution of the problem is *** examples show that this method is feasible and effective.
Urban traffic congestion has already become an urgent problem. Artificial societies, Computational experiments, and Parallel execution (ACP) method is applied to urban traffic problems. In ACP framework, optimization ...
详细信息
ISBN:
(纸本)9781479960798
Urban traffic congestion has already become an urgent problem. Artificial societies, Computational experiments, and Parallel execution (ACP) method is applied to urban traffic problems. In ACP framework, optimization for urban road networks achieves remarkable effect. Optimization for urban road networks is a problem of nonlinear and non-convex programming with typical large-scale continual and integer variables. Due to the complicated urban traffic system, this paper focuses on the ACP-based Computational experiments modeling. It hopes to find an optimization model that is further accord with the practical situation. To this end, we use a mixed integer nonlinear programming problem (MINLP) and an genetic algorithm (GA) for urban road networks optimization. The systemic simulation experiments show that the approach is more effective in improving traffic status and increasing traffic safety.
Consider the following nonlinear programming problem:where f, gi’s are sufficiently smooth functions in R;. LetIt is well known that if x;∈Ω is a solution of （1） then there exists λ;=（λ;,…,λ;）∈R;such that...
详细信息
Consider the following nonlinear programming problem:where f, gi’s are sufficiently smooth functions in R;. LetIt is well known that if x;∈Ω is a solution of （1） then there exists λ;=（λ;,…,λ;）∈R;such that（x;,λ;） is a solution of the K-K-T system
We use the Schaefer fixed-point theorem, combined with the Bressan-Colombo selection theorem for lower-semicontinuous multivalued operators with nonempty closed and decomposable values, for the investigation of the ex...
详细信息
We extend work by Pei-Ping and Gui-Xia, 2007, to a global optimization problem for more general functions. Pei-Ping and Gui-Xia treat the optimization problem for the linear sum of polynomial fractional functions, usi...
详细信息
暂无评论