Towards an efficient numerical procedure for mixed integer optimal control Academic Article

abstract

• An efficient numerical procedure for solving mixed-integer optimal control (MIOPCON) problems is developed in this paper, which involves a decomposition strategy through a series of optimal control and mixed-integer linear programming (MILP) subproblems. The optimal control problem is defined by fully implicit differential-algebraic equations, which are substituted by discrete time implicit equations resulting from the integration of the system equations by an implicit Runge-Kutta method. The advantage of this approach is that the dual information necessary for the MILP master problem can be obtained directly from the adjoint variables of the optimal control primal problem. As a result the MIOPCON problem is solved only in the reduced space, enabling efficient application of the algorithm to problems described by large-scale differential algebraic equations.

authors

• Pistikopoulos, Stratos

published proceedings

• COMPUTERS & CHEMICAL ENGINEERING

author list (cited authors)

• Mohideen, M. J., Perkins, J. D., & Pistikopoulos, E. N.

citation count

• 40

complete list of authors

• Mohideen, MJ||Perkins, JD||Pistikopoulos, EN

publication date

• May 1997

publisher

• Elsevier  Publisher

published in

• Computers and Chemical Engineering  Journal

Digital Object Identifier (DOI)

• 10.1016/s0098-1354(97)87544-8

start page

• S457

end page

• S462

volume

• 21

issue

• SUPPL.1

URL

• http://dx.doi.org/10.1016/s0098-1354(97)87544-8