In this paper, we consider interaction between spot and forward trading under demand and cost uncertainties, deriving the equilibrium of the multi-player dynamic games. The stochastic programming and worst-case analysis models based on discrete scenarios are developed to analyze the impact of...

Solutions of portfolio optimization problems are often influenced by errors or misspecifications due to approximation, estimation and incomplete information. Selected methods for analysis of results obtained by solving stochastic programs are presented and their scope illustrated on generic...

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each...

Solutions of portfolio optimization problems are often influenced by errors or misspecifications due to approximation, estimation and incomplete information. Selected methods for analysis of results obtained by solving stochastic programs are presented and their scope illustrated on generic...

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each...

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one...

In this paper we compare expected loss minimization to worst-case or minimax analysis in the design of simple Taylor-style rules for monetary policy using a small model estimated for the euro area by Orphanides and Wieland (2000). We find that rules optimized under a minimax objective in the...

Postoptimality or sensitivity analysis are well-developed subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of this type of analysis for a specific class of mathematical programming...

The bounds on direct shipping cost developed by Gallego and Simchi-Levi are used in this note to demonstrate that it is difficult to rule out multiple stop inventory-routing strategies, even when the optimal shipment size for direct shipping is a full vehicle.

Focusing on a seller's regret in not acting optimally, we develop a model of overbooking and fare-class allocation in the multifare, single-resource problem in revenue management. We derive optimal static overbooking levels and booking limits, in closed form, that minimize the maximum relative...