0% found this document useful (0 votes)
16 views1 page

Integer Programming

Uploaded by

Free Account
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views1 page

Integer Programming

Uploaded by

Free Account
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Integer Programming (IP) - Expanded:

 Integer programming extends linear programming by requiring some or all decision


variables to be integers. This is crucial for problems with discrete decisions, such as
yes/no choices or quantities that must be whole numbers.
 Types:
o Binary Integer Programming (BIP): Variables can only be 0 or 1.
o Mixed Integer Programming (MIP): Some variables are integers, and others are
continuous.
 Branch-and-Bound: A common algorithm that systematically explores the solution
space by dividing it into smaller subproblems and eliminating regions that cannot contain
the optimal solution.
 Applications: Facility location, scheduling, routing, project management, and capital
budgeting.
 Example: A company needs to decide which warehouses to open from a set of potential
locations to minimize transportation costs while meeting customer demand. This is a
binary integer programming problem because the decision is whether to open a
warehouse (1) or not (0).

You might also like