75 citations · 109 across the 11 of their papers we have counts for
12 papers
A geometric simplex method in infinite-dimensional spaces
Robert L Smith, Christopher Thomas Ryan
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges…
Optimizing for Strategy Diversity in the Design of Video Games
Oussama Hanguir, Will Ma, Christopher Thomas Ryan +1
We consider the problem of designing a linear program that has diverse solutions as the right-hand side varies. This problem arises in video game settings where designers aim to ha…
"Near" Weighted Utilitarian Characterizations of Pareto Optima
Yeon-Koo Che, Jinwoo Kim, Fuhito Kojima +1
We characterize Pareto optimality via "near" weighted utilitarian welfare maximization. One characterization sequentially maximizes utilitarian welfare functions using a finite seq…
Mixed-integer bilevel representability
Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan
We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints…
Mixed-integer linear representability, disjunctions, and Chvatal functions --- modeling implications
Amitabh Basu, Kipp Martin, Christopher Thomas Ryan +1
Jeroslow and Lowe gave an exact geometric characterization of subsets of that are projections of mixed-integer linear sets, also known as MILP-representable or MILP-…
The discrete moment problem with nonconvex shape constraints
Xi Chen, Simai He, Bo Jiang +2
The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of mo…