It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can...
In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represe...
Patrizia Beraldi, Lucio Grandinetti, Roberto Musma...