Open AccessThis article is
- freely available
A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs
Department of Industrial and Systems Engineering, University of Washington, Seattle, WA 98195, USA
* Author to whom correspondence should be addressed.
Received: 15 June 2013; in revised form: 30 August 2013 / Accepted: 30 August 2013 / Published: 4 September 2013
Abstract: Large-scale binary integer programs occur frequently in many real-world applications. For some binary integer problems, finding an optimal solution or even a feasible solution is computationally expensive. In this paper, we develop a discrete meta-control procedure to approximately solve large-scale binary integer programs efficiently. The key idea is to map the vector of n binary decision variables into a scalar function defined over a time interval [0; n] and construct a linear quadratic tracking (LQT) problem that can be solved efficiently. We prove that an LQT formulation has an optimal binary solution, analogous to a classical bang-bang control in continuous time. Our LQT approach can provide advantages in reducing computation while generating a good approximate solution. Numerical examples are presented to demonstrate the usefulness of the proposed method.
Keywords: large-scale binary integer programs; linear quadratic tracking; optimal control
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Zhang, P.; Kohn, W.; Zabinsky, Z.B. A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs. Entropy 2013, 15, 3592-3601.
Zhang P, Kohn W, Zabinsky ZB. A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs. Entropy. 2013; 15(9):3592-3601.
Zhang, Pengbo; Kohn, Wolf; Zabinsky, Zelda B. 2013. "A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs." Entropy 15, no. 9: 3592-3601.