Relaxations and approximations for mixed-integer optimal control (Q2873479)

From MaRDI portal





scientific article; zbMATH DE number 6249992
Language Label Description Also known as
English
Relaxations and approximations for mixed-integer optimal control
scientific article; zbMATH DE number 6249992

    Statements

    0 references
    24 January 2014
    0 references
    optimal control
    0 references
    mixed integer optimal control
    0 references
    Boolean control function
    0 references
    relaxations
    0 references
    inner and outer convexification
    0 references
    Big-M-problem
    0 references
    cutting planes
    0 references
    nonlinear branch-and-bound
    0 references
    approximation
    0 references
    numerical examples
    0 references
    Relaxations and approximations for mixed-integer optimal control (English)
    0 references
    The excellent PhD-thesis of Michael Jung deals with mixed-integer optimal control, it was written under the supervision of S. Sager and G. Reinelt. The thesis is influenced by the Heidelberg research team of optimization. The topic is also referred to as hybrid optimal control. An optimal control system is studied which is described by ODEs or DAEs, respectively, control-state inequalities and control restrictions, and a certain functional is to minimize.NEWLINENEWLINE Necessary optimality conditions and well-known numerical methods for classical controls are listed. The new problem under consideration has an integer feasibility requirement on a subset of the control functions. The author proposes the use of a direct approach to formulate numerical algorithms. Therefore, a discretization of the process is given. Then, an integral relaxation of different modes ODEs and constraints is considered. There are inner convexification and outer convexification. Different approaches are discussed in terms of numerical stability and general solvability.NEWLINENEWLINE The next step treats approximation of the controls in order to obtain integer control functions out of relaxed ones. The solution structure of a branch-and-bound algorithm with a Lagrangian relaxation as subproblems is investigated.NEWLINENEWLINE The last chapter gives numerical examples, it covers four problems: 1) a prototype model from the literature, 2) a Lotka-Volterra-model for fishing control, 3) a sewage network, where the overflow onto streets and environment has to be controlled, 4) an energy-optimal problem of a truck cruise.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references