In this paper we suggest a new efficient technique for solving integer knapsack problems. Our algorithms can be seen as application of Fast Fourier Transform to generating functions of integer polytopes. Using this approach, it is possible to count the number of boolean solutions of a single...

The current paper defines the optimal sequential information gathering structure of a rational utility maximizer decision maker in the simplest non-trivial theoretical scenario, where the decision maker is allowed to acquire only two pieces of information from a set of multidimensional goods. We...

How do people make choices in a dynamic stochastic environment when they face uncertainty about the return of their choices? The classical approach to this problem is to assume consumers use dynamic programming to obtain the optimal decision rule. However, this approach has two drawbacks. First,...

This paper introduces recent developments in the analysis of inventory systems with partial observations. The states of these systems are typically conditional distributions, which evolve in infinite dimensional spaces over time. Our analysis involves introducing unnormalized probabilities to...

This paper introduces a flexible method based on dynamic programming to calculate the quantitative value of any approach to managing the innovation process. The quantification lets managers precisely compare the values of different approaches, and so identify those that are optimised for their...

The goal programming (GP) is a well-known approach applied to multi-criteria decision making (M-DM). It has been used in many domains and the literature offers diverse extensions of this procedure. On the other hand, so far, some evident analogies between M-DM under certainty and scenario-based...