Abstract
Consider an integer program
$$ \begin{array}{ll}\kern2em \min \hfill & z={x}_1+{x}_2+{x}_3+{x}_4\hfill \\ {}\mathrm{subject}\;\mathrm{t}\mathrm{o}\hfill & \left[\begin{array}{c}\hfill 3\hfill \\ {}\hfill 1\hfill \end{array}\right]{x}_1 + \left[\begin{array}{c}\hfill 1\hfill \\ {}\hfill 3\hfill \end{array}\right]{x}_2 + \left[\begin{array}{c}\hfill 2\hfill \\ {}\hfill 1\hfill \end{array}\right]{x}_3 + \left[\begin{array}{c}\hfill 1\hfill \\ {}\hfill 2\hfill \end{array}\right]{x}_4 = \left[\begin{array}{c}\hfill 11\hfill \\ {}\hfill 11\hfill \end{array}\right],\hfill \\ {}\hfill & {x}_j\ge 0,\kern0.5em \mathrm{integers}.\hfill \end{array} $$
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hu, T.C., Kahng, A.B. (2016). Asymptotic Algorithms. In: Linear and Integer Programming Made Easy. Springer, Cham. https://doi.org/10.1007/978-3-319-24001-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-24001-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23999-6
Online ISBN: 978-3-319-24001-5
eBook Packages: EngineeringEngineering (R0)