This paper uses the commutant lifting theorem for representations of the nest algebra to deal with the optimal control of infinite dimensional linear time- varying systems. We solve the model matching problem and a ce...This paper uses the commutant lifting theorem for representations of the nest algebra to deal with the optimal control of infinite dimensional linear time- varying systems. We solve the model matching problem and a certain optimal feedback control problem, each of which corresponds with one type of four-block problem. We also obtain a new formula for the optimal performance and prove the existence of an optimal controller.展开更多
In this paper, we deal with the unrestricted block relocation problem. We present a new integerprogramming formulation for solving the problem. The initial formulation is improved by tighteningconstraints and a pre-pr...In this paper, we deal with the unrestricted block relocation problem. We present a new integerprogramming formulation for solving the problem. The initial formulation is improved by tighteningconstraints and a pre-processing step to fix several variables. We design a exact iterativescheme algorithm based on a fast heuristic for the integer programming formulation (ISA-FH).Computational results show the effectiveness of the improved formulation and algorithm.展开更多
文摘This paper uses the commutant lifting theorem for representations of the nest algebra to deal with the optimal control of infinite dimensional linear time- varying systems. We solve the model matching problem and a certain optimal feedback control problem, each of which corresponds with one type of four-block problem. We also obtain a new formula for the optimal performance and prove the existence of an optimal controller.
基金National Natural Science Foundation of China(62073069)Liao Ning Revitalization Talents Program(XLYC2002041).
文摘In this paper, we deal with the unrestricted block relocation problem. We present a new integerprogramming formulation for solving the problem. The initial formulation is improved by tighteningconstraints and a pre-processing step to fix several variables. We design a exact iterativescheme algorithm based on a fast heuristic for the integer programming formulation (ISA-FH).Computational results show the effectiveness of the improved formulation and algorithm.
