We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...

We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...

We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...

The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...

We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...

We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...