7 citations · 17 across the 5 of their papers we have counts for
5 papers
Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
Dimitri J. Papageorgiou, Francisco Trespalacios
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a d…
Pooling problems under perfect and imperfect competition
Dimitri J. Papageorgiou, Stuart M. Harwood, Francisco Trespalacios
We investigate pooling problems in which multiple players vie with one another to maximize individual profit in a non-cooperative competitive market. This competitive setting is in…
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
Stuart Harwood, Francisco Trespalacios, Dimitri Papageorgiou +1
Solution methods for generalized Nash equilibrium have been dominated by variational inequalities and complementarity problems. Since these approaches fundamentally rely on the suf…
A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity
Dimitri J. Papageorgiou, Francisco Trespalacios, Stuart Harwood
Discretely-constrained Nash-Cournot games have attracted attention as they arise in various competitive energy production settings in which players must make one or more discrete d…
A note on semi-infinite program bounding methods
Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios
Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blan…