---
title: "Mixed Integer Programming | Intro to Industrial Engineering"
description: "Mixed integer programming mixes integer and continuous variables to model real industrial engineering decisions like scheduling, routing, and resource allocation."
canonical: "https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming"
type: "key-term"
subject: "Intro to Industrial Engineering"
unit: "Unit 1"
---

# Mixed Integer Programming | Intro to Industrial Engineering

## Definition

Mixed integer programming is an optimization method where some decision variables must be integers and others can be continuous. In Intro to Industrial Engineering, it models real constraints like yes/no choices, machine counts, and production limits.

## What It Is

Mixed integer programming, or MIP, is an optimization model used in Intro to Industrial Engineering when some decisions have to be whole numbers and others can vary continuously. That mix is what makes it more realistic than plain linear programming for many operations problems.

The “integer” part matters when a decision cannot be fractional. You can make 3 trucks, open 1 warehouse, or assign 0 workers to a shift, but you cannot make 2.6 trucks or open 0.5 of a facility. MIP lets you build those yes/no or countable decisions directly into the model.

At the same time, MIP can still include continuous variables for things like hours worked, amount of material used, or cost. That is why the model is called “mixed.” One model might decide which plants to open with binary variables and then decide how much product to ship with continuous variables.

In industrial engineering, that combination shows up in production planning, scheduling, logistics, and supply chain design. For example, you might model whether a machine is turned on, how many workers to assign, and how many units to produce, all in the same problem. The constraints then keep the plan realistic by limiting labor, budget, machine time, or storage.

MIP is harder to solve than linear programming because the solver cannot just slide to a best point in a smooth region. It has to search through combinations of integer choices and often uses methods like branch and bound to rule out bad options efficiently. That extra difficulty is why MIP is powerful but also computationally demanding.

A common mistake is to treat an integer variable like it can be rounded after solving a regular linear program. That can break the constraint logic and give you a plan that looks good on paper but does not actually work. In MIP, the integer condition is part of the model from the start, not an afterthought.

## Why It Matters

Mixed integer programming is one of the main tools in Intro to Industrial Engineering because many real systems have both discrete decisions and measurable quantities. A factory does not just ask, “How much should we produce?” It also asks, “Should we run this line at all?”, “Which shifts should be staffed?”, and “Which warehouse should serve which region?”

That makes MIP a strong bridge between math and operations. It lets you turn a messy business problem into variables, constraints, and an objective function that can be tested and improved. When the course covers optimization techniques, MIP is often the first place where you see a model that feels like an actual workplace decision instead of an abstract equation.

It also connects directly to supply chain optimization. Routing trucks, choosing inventory levels, and deciding facility locations often require binary choices plus continuous quantities. If you can recognize which parts of the decision are integer and which are continuous, you can set up the model correctly instead of forcing everything into one type of variable.

In problem solving, MIP trains you to separate logic from quantity. That skill shows up in case studies, Excel Solver work, and written explanations of why a proposed schedule or production plan does or does not meet the constraints.

## Connections

### Linear Programming

Linear programming is the starting point for many optimization models, but it allows variables to be fractional unless you add extra restrictions. Mixed integer programming builds on that structure by keeping the linear objective and constraints while forcing some variables to be whole numbers. If a linear program gives a plan that looks mathematically best but operationally impossible, MIP is often the fix.

### [Integer Programming](/introduction-industrial-engineering/key-terms/integer-programming)

Integer programming is the broader category where all decision variables must be integers. Mixed integer programming is more flexible because it lets only some variables be integers and keeps others continuous. In industrial engineering, that flexibility matters when a model needs both discrete decisions, like opening a facility, and continuous decisions, like shipping amounts.

### [Branch and Bound](/introduction-industrial-engineering/key-terms/branch-and-bound)

Branch and bound is a common algorithm used to solve MIP problems. It splits the problem into smaller cases, checks bounds on the objective value, and throws out branches that cannot beat the best solution found so far. When you see MIP discussed with solvers like CPLEX or Gurobi, branch and bound is often part of the engine underneath.

### [Supply Chain Optimization](/introduction-industrial-engineering/key-terms/supply-chain-optimization)

Supply chain optimization is one of the clearest places to use mixed integer programming. Decisions like opening warehouses, selecting routes, and setting shipment quantities naturally combine yes/no choices with amounts. MIP lets you model the whole system together instead of solving separate pieces that might conflict.

## On the AP Exam

A problem set or quiz question will usually give you a small operations scenario and ask you to decide whether the variables should be integer, binary, or continuous. You might need to identify the objective, list the constraints, and explain why rounding a linear programming answer would fail.

If the class uses software like Excel Solver or GAMS, you may also be asked to interpret the output, check whether the solution is feasible, or explain what a binary variable is doing in the model. The big move is recognizing the discrete decisions first, then pairing them with the continuous quantities that make the plan workable.

## mixed integer programming vs Integer Programming

Integer programming is the broader term for optimization problems where every variable must be an integer. Mixed integer programming is narrower, because only some variables are restricted to integers while others may be continuous. If a model has both whole-number decisions and amount variables, MIP is the better label.

## Key Takeaways

- Mixed integer programming is an optimization method that combines integer variables with continuous variables in one model.
- Use MIP when some decisions must be whole numbers or yes/no choices, like opening a warehouse or scheduling a machine.
- It is common in Intro to Industrial Engineering because production, routing, staffing, and inventory problems usually mix discrete and continuous decisions.
- MIP is harder to solve than linear programming because the solver has to search among integer choices, not just optimize a smooth region.
- The biggest mistake is solving a relaxed linear model and rounding the answer afterward, because that can violate the real constraints.

## FAQs

### What is mixed integer programming in Intro to Industrial Engineering?

Mixed integer programming is an optimization method where some variables must be integers and others can be continuous. In industrial engineering, it shows up when you need to model both discrete decisions, like opening a facility, and numeric decisions, like how much to ship.

### What is the difference between mixed integer programming and linear programming?

Linear programming lets all decision variables take fractional values unless you add restrictions. Mixed integer programming keeps the linear structure but forces some variables to be whole numbers, which makes it better for real-world choices that cannot be split into decimals.

### Why is mixed integer programming harder to solve?

The integer restrictions make the problem combinatorial, so the solver cannot just follow one smooth path to the best answer. It often has to test many possible integer combinations and use methods like branch and bound to eliminate bad ones efficiently.

### Can you give an example of mixed integer programming?

A factory planning model might use binary variables for whether to open each production line and continuous variables for how many units to make on the lines that are open. That lets the model capture both the yes/no decision and the production quantity in one setup.

## Related Study Guides

- [1.3 Optimization Techniques and Applications](/introduction-industrial-engineering/unit-1/optimization-techniques-applications/study-guide/kPsFsCWW9ul1zAh4)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming#resource","name":"Mixed Integer Programming | Intro to Industrial Engineering","url":"https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:23:09.379Z","isPartOf":{"@type":"Collection","name":"Intro to Industrial Engineering Key Terms","url":"https://fiveable.me/introduction-industrial-engineering/key-terms"},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming#term","name":"mixed integer programming","description":"Mixed integer programming is an optimization method where some decision variables must be integers and others can be continuous. In Intro to Industrial Engineering, it models real constraints like yes/no choices, machine counts, and production limits.","url":"https://fiveable.me/introduction-industrial-engineering/key-terms/mixed-integer-programming","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Intro to Industrial Engineering Key Terms","url":"https://fiveable.me/introduction-industrial-engineering/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is mixed integer programming in Intro to Industrial Engineering?","acceptedAnswer":{"@type":"Answer","text":"Mixed integer programming is an optimization method where some variables must be integers and others can be continuous. In industrial engineering, it shows up when you need to model both discrete decisions, like opening a facility, and numeric decisions, like how much to ship."}},{"@type":"Question","name":"What is the difference between mixed integer programming and linear programming?","acceptedAnswer":{"@type":"Answer","text":"Linear programming lets all decision variables take fractional values unless you add restrictions. Mixed integer programming keeps the linear structure but forces some variables to be whole numbers, which makes it better for real-world choices that cannot be split into decimals."}},{"@type":"Question","name":"Why is mixed integer programming harder to solve?","acceptedAnswer":{"@type":"Answer","text":"The integer restrictions make the problem combinatorial, so the solver cannot just follow one smooth path to the best answer. It often has to test many possible integer combinations and use methods like branch and bound to eliminate bad ones efficiently."}},{"@type":"Question","name":"Can you give an example of mixed integer programming?","acceptedAnswer":{"@type":"Answer","text":"A factory planning model might use binary variables for whether to open each production line and continuous variables for how many units to make on the lines that are open. That lets the model capture both the yes/no decision and the production quantity in one setup."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Intro to Industrial Engineering","item":"https://fiveable.me/introduction-industrial-engineering"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/introduction-industrial-engineering/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 1","item":"https://fiveable.me/introduction-industrial-engineering/unit-1"},{"@type":"ListItem","position":4,"name":"mixed integer programming"}]}]}
```