Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

References

• Aichholzer O., Aurenhammer F., Hurtado F., Krasser H. Towards compatible triangulations. Theoret. Comput. Sci. (2003) 296:3–13Crossref, Google Scholar
• Balakrishnan A., Graves S. C. A composite algorithm for a concave-cost network flow problem. Networks (1989) 19:175–202Crossref, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–51Crossref, Google Scholar
• Bergamini M. L., Aguirre P., Grossmann I. Logic-based outer approximation for globally optimal synthesis of process networks. Comput. Chemical Engrg. (2005) 29:1914–1933Crossref, Google Scholar
• Bergamini M. L., Grossmann I., Scenna N., Aguirre P. An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chemical Engrg. (2008) 32:477–493Crossref, Google Scholar
• Carnicer J. M., Floater M. S. Piecewise linear interpolants to Lagrange and Hermite convex scattered data. Numer. Algorithms (1996) 13:345–364Crossref, Google Scholar
• Coppersmith D., Lee J. Parsimonious binary-encoding in integer programming. Discrete Optim. (2005) 2:190–200Crossref, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. (2003a) 49:1268–1273Link, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. Models and methods for merge-in-transit operations. Transportation Sci. (2003b) 37:1–22Link, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. Variable disaggregation in network flow problems with piecewise linear costs. Oper. Res. (2007) 55:146–157Link, Google Scholar
• Dantzig G. B. On the significance of solving linear-programming problems with some integer variables. Econometrica (1960) 28:30–44Crossref, Google Scholar
• Dantzig G. B.Linear Programming and Extensions (1963) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• de Farias I. R., Zhao M., Zhao H. A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. (2008) 36:234–238Crossref, Google Scholar
• Fourer R., Gay D. M., Kernighan B. W.AMPL–A Modeling Language for Mathematical Programming (1993) (The Scientific Press)Google Scholar
• Garfinkel R. S., Nemhauser G. L.Integer Programming (1972) (Wiley, New York) Google Scholar
• Graf T., Vanhentenryck P., Pradelleslasserre C., Zimmer L. Simulation of hybrid circuits in constraint logic programming. Comput. Math. Appl. (1990) 20:45–56Crossref, Google Scholar
• Ibaraki T. Integer programming formulation of combinatorial optimization problems. Discrete Math. (1976) 16:39–52Crossref, Google Scholar
• Jeroslow R. G. Representability in mixed integer programming 1: Characterization results. Discrete Appl. Math. (1987) 17:223–243Crossref, Google Scholar
• Jeroslow R. G. Representability of functions. Discrete Appl. Math. (1989) 23:125–137Crossref, Google Scholar
• Jeroslow R. G., Lowe J. K. Modeling with integer variables. Math. Programming Stud. (1984) 22:167–184Crossref, Google Scholar
• Jeroslow R. G., Lowe J. K. Experimental results on the new techniques for integer programming formulations. J. Oper. Res. Soc. (1985) 36:393–403Crossref, Google Scholar
• Kannan R. Lattice translates of a polytope and the Frobenius problem. Combinatorica (1992) 12:161–177Crossref, Google Scholar
• Keha A. B. A polyhedral study of nonconvex piecewise linear optimization. (2003) . Ph.D. thesis, Georgia Institute of Technology, AtlantaGoogle Scholar
• Keha A. B., de Farias I. R., Nemhauser G. L. Models for representing piecewise linear cost functions. Oper. Res. Lett. (2004) 32:44–48Crossref, Google Scholar
• Keha A. B., de Farias I. R., Nemhauser G. L. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. (2006) 54:847–858Link, Google Scholar
• Lasdon L. S., Waren A. D. A survey of nonlinear programming applications. Oper. Res. (1980) 28:1029–1073Link, Google Scholar
• Lee J., Wilson D. Polyhedral methods for piecewise-linear functions I: The lambda method. Discrete Appl. Math. (2001) 108:269–285Crossref, Google Scholar
• Lowe J. K. Modelling with integer variables. (1984) . Ph.D. thesis, Georgia Institute of Technology, AtlantaGoogle Scholar
• Magnanti T. L., Stratila D., Nemhauser G. L., Bienstock D. Separable concave optimization approximately equals piecewise linear optimization. IPCO, Lecture Notes in Computer Science (2004) 3064(Springer, Berlin) 234–243Crossref, Google Scholar
• Markowitz H., Manne A. On the solution of discrete programming problems. Econometrica (1957) 25:84–110Crossref, Google Scholar
• Martin A., Moller M., Moritz S. Mixed integer models for the stationary case of gas network optimization. Math. Programming (2006) 105:563–582Crossref, Google Scholar
• Meyer R. R. Mixed integer minimization models for piecewise-linear functions of a single variable. Discrete Math. (1976) 16:163–171Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley-Interscience, New York) Crossref, Google Scholar
• Padberg M. Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. (2000) 27:1–5Crossref, Google Scholar
• Padberg M. W., Rijal M. P.Location, Scheduling, Design, and Integer Programming (1996) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Pottmann H., Krasauskas R., Hamann B., Joy K. I., Seibold W. On piecewise linear approximation of quadratic functions. J. Geometry and Graphics (2000) 4:9–31Google Scholar
• Sherali H. D. On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. (2001) 28:155–160Crossref, Google Scholar
• Todd M. J., Karamardian S. Union Jack triangulations. Fixed Points: Algorithms and Applications (1977) (Academic Press, New York) 315–336Crossref, Google Scholar
• Tomlin J. A., Hansen P. A suggested extension of special ordered sets to non-separable non-convex programming problems. Studies on Graphs and Discrete Programming, Annals of Discrete Mathematics (1981) 11(North-Holland, Amsterdam) 359–370Crossref, Google Scholar
• Vajda S.Mathematical Programming (1964) (Addison-Wesley, Reading, MA) Google Scholar
• Vielma J. P., Nemhauser G. L., Lodi A., Panconesi A., Rinaldi G. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. IPCO, Lecture Notes in Computer Science (2008) 5035(Springer, Berlin) 199–213Crossref, Google Scholar
• Vielma J. P., Nemhauser G. L. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Programming (2009) . ForthcomingGoogle Scholar
• Vielma J. P., Keha A. B., Nemhauser G. L. Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optim. (2008) 5:467–488Crossref, Google Scholar
• Wilf H. S.Combinatorial Algorithms—An Update (1989) (Society for Industrial and Applied Mathematics, Philadelphia) Crossref, Google Scholar
• Wilson D. L. Polyhedral methods for piecewise-linear functions. (1998) . Ph.D. thesis, University of Kentucky, LexingtonGoogle Scholar