The following pages link to Christopher Thomas Ryan (Q507335):
Displaying 21 items.
- Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
- (Q711714) (redirect page) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- On the sufficiency of finite support duals in semi-infinite linear programming (Q1667165) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- Mixed-integer linear representability, disjunctions, and variable elimination (Q2401146) (← links)
- Rational Generating Functions and Integer Programming Games (Q2893918) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization (Q3465240) (← links)
- A general solution method for moral hazard problems (Q4612474) (← links)
- A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs (Q4971387) (← links)
- Monotonicity of Optimal Contracts Without the First-Order Approach (Q4971397) (← links)
- The Discrete Moment Problem with Nonconvex Shape Constraints (Q4994156) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)
- ``Near'' weighted utilitarian characterizations of Pareto optima (Q6536799) (← links)
- Minimum spanning trees in infinite graphs: theory and algorithms (Q6622744) (← links)
