# Mixed-Integer Multi-objective Constrained Optimization Problem Solving

**URL:** <https://discourse.julialang.org/t/mixed-integer-multi-objective-constrained-optimization-problem-solving/83030>\
**Category:** Optimization (Mathematical)\
**Tags:** question, package\
**Created:** [June 19, 2022, 7:50pm UTC](https://discourse.julialang.org/t/mixed-integer-multi-objective-constrained-optimization-problem-solving/83030 "2022-06-19T19:50:22Z")\
**Posts on this page:** 1\
**Showing post:** 3

<div class="post-metadata">

**Author:** ![mtanneau](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mtanneau/32/17787_2.png) [@mtanneau](https://discourse.julialang.org/u/mtanneau)\
**Post date:** [June 20, 2022, 2:54pm UTC](https://discourse.julialang.org/t/mixed-integer-multi-objective-constrained-optimization-problem-solving/83030/3 "2022-06-20T14:54:55Z")

</div>

If you want an out-of-the-box package that will take as input a JuMP problem with multiple objectives, and returns a Pareto front, I’m afraid there is not on at the moment.

If you want to optimize for a weighted combination of objectives (without manually making it into a single objective), or want have a priority in your objectives, e.g., “minimize objective 1, then minimize objective 2 while remaining optimal for objective 1”, it is possible (but not officially supported) with JuMP+Gurobi.

Gurobi supports a range of mixed-integer problems (linear and quadratic) and has [some support for multiple objectives](https://www.gurobi.com/documentation/9.5/refman/multiple_objectives.html). That latter feature is not officially available through JuMP, however, you can follow [this example](https://discourse.julialang.org/t/gurobi-not-using-barrier-method/68078/7) to make it work. Credits to @odow for that original solution.

---

_[View the full topic](https://discourse.julialang.org/t/mixed-integer-multi-objective-constrained-optimization-problem-solving/83030)._