This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be dir...This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.展开更多
In this paper,we consider optimal control of stochastic differential equations subject to an expected path constraint.The stochastic maximum principle is given for a general optimal stochastic control in terms of cons...In this paper,we consider optimal control of stochastic differential equations subject to an expected path constraint.The stochastic maximum principle is given for a general optimal stochastic control in terms of constrained FBSDEs.In particular,the compensated process in our adjoint equation is deterministic,which seems to be new in the literature.For the typical case of linear stochastic systems and quadratic cost functionals(i.e.,the so-called LQ optimal stochastic control),a verification theorem is established,and the existence and uniqueness of the constrained reflected FBSDEs are also given.展开更多
An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although ...An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.展开更多
This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in whi...This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.展开更多
This paper analyzes the origin of the traditional small-scale peasant economy in China,introduces the development basis of traditional agriculture and the constraints of traditional agricultural development. Then it a...This paper analyzes the origin of the traditional small-scale peasant economy in China,introduces the development basis of traditional agriculture and the constraints of traditional agricultural development. Then it analyzes the possibility of transformation caused by the change of constraints according to the possibility of resource endowment changes and the possibility of changes in economic foundations and political cultural foundations. And finally based on the analysis of constraints,it is concluded that the development of China's future needs to focus on small-scale farmers,large-scale planting households,cooperatives and a small number of enterprises,and put forward three paths to developing modern agriculture which are large scale land operation,the professional cooperation of farmers,and the large scale production processes.展开更多
In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on t...In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on the hyperplanes defined by the world- sheet time . In the present work we quantize the same theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time , using the standard constraint quantization techniques in the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac, which is in contrast to the corresponding case of the instant-form theory, where the theory remains unconstrained in the sense of Dirac. The light-front theory is seen to possess a set of twenty six primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front.展开更多
Recently we have studied the instant-form quantization (IFQ) of the conformally gauge-fixed Polyakov D1 brane action with and without a scalar dilaton field using the Hamiltonian and path integral formulations in the ...Recently we have studied the instant-form quantization (IFQ) of the conformally gauge-fixed Polyakov D1 brane action with and without a scalar dilaton field using the Hamiltonian and path integral formulations in the equal world-sheet time framework on the hyperplanes defined by the world- sheet time σ0=τ=constant . The light-front quantization (LFQ) of this theory without a scalar dilaton field has also been studied by us recently. In the present work we study the LFQ of this theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time σ+=τ+σ=constant , using the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac. The light-front theory is seen to possess a set of twenty seven primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front.展开更多
基金Supported by the National Natural Science Foundation of China(U1162130)the National High Technology Research and Development Program of China(2006AA05Z226)Outstanding Youth Science Foundation of Zhejiang Province(R4100133)
文摘This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.
基金Ying Hu is partially supported by Lebesgue Center of Mathematics“Investissements d’avenir”Program(Grant No.ANR-11-LABX-0020-01)ANR CAESARS(Grant No.ANR-15-CE05-0024)+6 种基金ANR MFG(Grant No.ANR-16-CE40-0015-01)Shanjian Tang is partially supported by the National Science Foundation of China(Grant Nos.11631004 and 12031009)Zuo Quan Xu is partially supported by NSFC(Grant No.11971409)Research Grants Council of Hong Kong(GRF,Grant No.15202421)PolyU-SDU Joint Research Center on Financial MathematicsCAS AMSS-POLYU Joint Laboratory of Applied MathematicsHong Kong Polytechnic University.
文摘In this paper,we consider optimal control of stochastic differential equations subject to an expected path constraint.The stochastic maximum principle is given for a general optimal stochastic control in terms of constrained FBSDEs.In particular,the compensated process in our adjoint equation is deterministic,which seems to be new in the literature.For the typical case of linear stochastic systems and quadratic cost functionals(i.e.,the so-called LQ optimal stochastic control),a verification theorem is established,and the existence and uniqueness of the constrained reflected FBSDEs are also given.
文摘An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.
文摘This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.
文摘This paper analyzes the origin of the traditional small-scale peasant economy in China,introduces the development basis of traditional agriculture and the constraints of traditional agricultural development. Then it analyzes the possibility of transformation caused by the change of constraints according to the possibility of resource endowment changes and the possibility of changes in economic foundations and political cultural foundations. And finally based on the analysis of constraints,it is concluded that the development of China's future needs to focus on small-scale farmers,large-scale planting households,cooperatives and a small number of enterprises,and put forward three paths to developing modern agriculture which are large scale land operation,the professional cooperation of farmers,and the large scale production processes.
文摘In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on the hyperplanes defined by the world- sheet time . In the present work we quantize the same theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time , using the standard constraint quantization techniques in the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac, which is in contrast to the corresponding case of the instant-form theory, where the theory remains unconstrained in the sense of Dirac. The light-front theory is seen to possess a set of twenty six primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front.
文摘Recently we have studied the instant-form quantization (IFQ) of the conformally gauge-fixed Polyakov D1 brane action with and without a scalar dilaton field using the Hamiltonian and path integral formulations in the equal world-sheet time framework on the hyperplanes defined by the world- sheet time σ0=τ=constant . The light-front quantization (LFQ) of this theory without a scalar dilaton field has also been studied by us recently. In the present work we study the LFQ of this theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time σ+=τ+σ=constant , using the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac. The light-front theory is seen to possess a set of twenty seven primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front.
