Classification of diet models We distinguish between two classes: 1 Single-objective problems: minimize (or maximize) one linear function of Xi: Minimize.

Our main result shows that computing a tight upper bound on the expected value of a mixed 0-1 linear program in maximization form with random objective is a completely positive program. This naturally ...

A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel optimization problem. In this paper, we examine the case where each player tries to maximize the ...