Process / pipelineSimulation / optimization

Multi-Objective Mixed-Integer Programming

Multi-Objective Mixed-Integer Programming (MO-MIP) is an optimization framework that simultaneously optimizes two or more conflicting objective functions subject to linear or nonlinear constraints, where some decision variables are restricted to integer values and others are continuous. It is widely applied in engineering design, supply chain planning, resource allocation, and scheduling problems that require discrete choices alongside continuous quantities.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Ehrgott, M. (2005). Multicriteria Optimization (2nd ed.). Springer, Berlin. ISBN: 9783540213987
  2. Mavrotas, G. (2009). Effective implementation of the epsilon-constraint method in Multi-Objective Mathematical Programming problems. Applied Mathematics and Computation, 213(2), 455-465. DOI: 10.1016/j.amc.2009.03.037

Related methods

Referenced by

ScholarGateMulti-objective mixed-integer programming (Multi-Objective Mixed-Integer Programming). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/multi-objective-mixed-integer-programming