INOCS

An optimization problem consists in finding a best solution from a set of feasible solutions. Such a problem can be typically modeled as a mathematical program in which decision variables must (i) satisfy a set of constraints that translate the feasibility of the solution and (ii) optimize some (or several) objective function(s).

 The INOCS team aims to develop new models, algorithmic techniques and implementations for optimization problems with complex structure.

 More precisely, we consider that an optimization problem presents a complex structure when it involves decisions of different types/nature (i.e. strategic, tactical or operational), and/or presenting some hierarchical leader-follower structure (bilevel optimization) and/or taken in a uncertain environment (robust/stochastic optimization).