Category:Outer convexification
From mintOC
Revision as of 12:29, 20 November 2010 by SebastianSager (Talk | contribs)
For time-dependent and space- independent integer controls often another formulation is beneficial, e.g., <bibref>Kirches2010</bibref>. For every element of a binary control function is introduced.
The general equation
can then be written as
If we impose the special ordered set type one condition
there is a bijection between every feasible integer function and an appropriately chosen binary function , compare <bibref>Sager2009</bibref>. The relaxation of is given by . We will refer to the two constraints as outer convexification <bibref>Sager2005</bibref> of the original model.
References
<bibreferences/>
Pages in category "Outer convexification"
This category contains only the following page.