The paper shows that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a minmax mixed integer formulation by introducing finitely many binary variables,...

We consider noncooperative games where each player minimizes the sum of a smooth function, which depends on the player, and of a possibly nonsmooth function that is the same for all players. For this class of games we consider two approaches: one based on an augmented game that is applicable...

Dynamic system optimum (DSO) is a special case of the general dynamic traffic assignment (DTA). It predicts the optimal traffic states of a network under time-dependent traffic conditions from the perspective of the entire system. An optimal control framework is proposed in this paper for the...