Fluid models are used to study functionals of the underlying random processes. Instead of analysing the trajectories, we investigate algebraic equations of the dynamic programming type which turn out to be discrete analogs of the corresponding differential equations. This analysis makes it...

We consider the problem of optimally allocating the seats on a single flight leg to the demands from multiple fare classes that arrive sequentially. It is well-known that the optimal policy for this problem is characterized by a set of protection levels. In this paper, we develop a new...

We approximate the price of the American put for jump diffusions by a sequence of functions, which are computed iteratively. This sequence converges to the price function uniformly and exponentially fast. Each element of the approximating sequence solves an optimal stopping problem for geometric...

Numerical evaluation of compound distributions is an important task in insurance mathematics and quantitative risk management. In practice, both recursive methods as well as transform based techniques are widely used. We give a survey of these tools, point out the respective merits and provide...

In this paper, we introduce a one-parametric class of smoothing functions which contains the Fischer–Burmeister smoothing function and the CHKS smoothing function as special cases. Based on this class of smoothing functions, a smoothing Newton algorithm is extended to solve linear programming...

In this paper we investigate scaling properties of risky asset returns and make a strong case (1) against the need for multifractal models and (2) in favor of the requirement of heavy tailed distributions. Amongst the standard empirical properties of risky asset returns are an autocorrelation...

We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and...

In this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems with variable domination structures are investigated. Criteria and characterizations for two types of Levitin–Polyak well-posedness of vector equilibrium problems are shown. Moreover, by virtue of a gap...

We give an equation reformulation of the Karush–Kuhn–Tucker (KKT) condition for the second order cone optimization problem. The equation is strongly semismooth and its Clarke subdifferential at the KKT point is proved to be nonsingular under the constraint nondegeneracy condition and a...

We study a new search problem in continuous time. In the traditional approach, the basic formulation is to maximize the expected (discounted) return obtained by taking a job, net of search cost incurred until the job is taken. Implicitly assumed in the traditional modeling is that the agent has...