In this paper, we state sufficiency, necessity, convergence, existence and uniqueness results for infinite horizon optimal control problems with unbounded payoffs in which the assumptions are very weak and there are no topological assumptions about the model components. We also state a sequence...

In this paper, we introduce and develop the theory of semimartingale optimal transport in a path dependent setting. Instead of the classical constraints on marginal distributions, we consider a general framework of path dependent constraints. Duality results are established, representing the...

Assortment optimization is an important problem in revenue management arising in industries such as online advertising, retailing and airline ticketing. We study assortment optimization under an arbitrary mixture of multi-nomial logit (MNL) models, when the universe of products is dense. In...

Investors typically measure an asset’s potential to diversify a portfolio by its correlations with the portfolio’s other assets, but correlation is useful only if it provides a good estimate of how an asset’s returns co-occur cumulatively with the other asset returns over the investor’s...

In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker's objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e....

Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...

The utopia point of a multicriteria optimization problem is the vector that specifies for each criterion the most favourable among the feasible values. The Euclidean compromise solution in multicriteria optimization is a solution concept that assigns to a feasible set the alternative with...

The utopia point of a multicriteria optimization problem is the vector that specifies for each criterion the most favourable among the feasible values. The Euclidean compromise solution in multicriteria optimization is a solution concept that assigns to a feasible set the alternative with...