J23; J65; J68 </AbstractSection> Copyright Hijzen and Martin; licensee Springer. 2013

We develop a new model for studying the phenomenon of congestion in a transient environment, focusing on the problem of aircraft landings at a busy "hub" airport. Our model is based on a Markov/semi-Markov treatment of changes in the weather, the principal source of uncertainty governing service...

This paper deals with a basic issue: How does one approach the problem of designing the "right" objective for a given resource allocation problem? The notion of what is right can be fairly nebulous; we consider two issues that we see as key: efficiency and fairness. We approach the problem of...

In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust...

Employing probabilistic techniques we compute best possible upper and lower bounds on the price of an option on one or two assets with continuous piecewise linear payoff function based on prices of simple call options of possibly distinct maturities and the no-arbitrage condition, but without...

This paper presents a binary optimization framework for modeling dynamic resource allocation problems. The framework (a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; (b) is widely applicable in a variety of...

We propose a new algorithm for solving integer programming (IP) problems that is based on ideas from algebraic geometry. The method provides a natural generalization of the Farkas lemma for IP, leads to a way of performing sensitivity analysis, offers a systematic enumeration of all feasible...