It is folklore knowledge that nonconvex mixed-integer nonlinear optimization problems can be notoriously hard to solve in practice. In this paper we go one step further and drop analytical properties that are usually taken for granted in mixed-integer nonlinear optimization. First, we only...

The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex...

The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex...

The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex...

In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz constant. In recent literature, methods based on...

We present an adaptive grid refinement algorithm to solve probabilistic optimization problems with infinitely many random constraints. Using a bilevel approach, we iteratively aggregate inequalities that provide most information not in a geometric but in a probabilistic sense. This conceptual...

The European gas market is organized as a so-called entry-exit system with the main goal to decouple transport and trading. To this end, gas traders and the transmission system operator (TSO) sign so-called booking contracts that grant capacity rights to traders to inject or withdraw gas at...

We survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust...