Mixed-Integer Linear Optimization

Ramteen Sioshansi () and Antonio J. Conejo ()
Additional contact information
Ramteen Sioshansi: The Ohio State University
Antonio J. Conejo: The Ohio State University

Chapter Chapter 3 in Optimization in Engineering, 2017, pp 123-196 from Springer

Abstract: Abstract In this chapter, we study mixed-integer linear optimization problems, which are also known as mixed-integer linear programming problems (MILPPs). MILPPs are problems with an objective function and constraints that all linear in the decision variables. What sets MILPPs apart from linear optimization problems is that at least some of the variables in MILPPs are constrained to take on integer values. This chapter provides examples to show the practical significance of MILPPs. We also demonstrate the use of a special type of integer variable known as a binary variable, to model a number of types of nonlinearities and discontinuities while maintaining a linear model structure. Two solution techniques for MILPPs are also introduced.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-56769-3_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319567693

DOI: 10.1007/978-3-319-56769-3_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().