  


The Integer Approximation Error in MixedInteger Optimal Control
Sebastian Sager (sebastian.sageriwr.uniheidelberg.de) Abstract: We extend recent work on nonlinear optimal control problems with integer restrictions on some of the control functions (mixedinteger optimal control problems, MIOCP) in two ways. We improve a theorem that states that the solution of a relaxed and convexified problem can be approximated with arbitrary precision by a solution fulfilling the integer requirements. Unlike in previous publications the new short and selfcontained proof avoids the usage of the KreinMilman theorem, which is undesirable as it only states the existence of a solution that may switch infinitely often. We prove that this bound depends on the control discretization grid. The rounded solution will be arbitrarily close to the relaxed one, if only the underlying grid is chosen fine enough. A numerical benchmark example illustrates the procedure. Keywords: hybrid systems, optimal control, integer programming, MINLP Category 1: Nonlinear Optimization (Systems governed by Differential Equations Optimization ) Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming ) Citation: Mathematical Programming A, http://dx.doi.org/10.1007/s1010701004053 Download: Entry Submitted: 02/06/2009 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  