In this paper, we are concerned with a new algorithm for multichain finite state Markov decision processes which finds an average optimal policy through the decomposition of the state space into some communicating classes and a transient class. For each communicating class, a relatively optimal...

In this paper, we propose a projection method for solving a system of nonlinear monotone equations with convex constraints. Under standard assumptions, we show the global convergence and the linear convergence rate of the proposed algorithm. Preliminary numerical experiments show that this...

We propose a new scenario tree reduction algorithm for multistage stochastic programs, which integrates the reduction of a scenario tree into the solution process of the stochastic program. This allows to construct a scenario tree that is highly adapted on the optimization problem. The algorithm...

This paper addresses constrained Markov decision processes, with expected discounted total cost criteria, which are controlled by non-randomized policies. A dynamic programming approach is used to construct optimal policies. The convergence of the series of finite horizon value functions to the...

The Karush-Kuhn-Tucker (KKT) conditions for an optimization problem with fuzzy-valued objective function are derived in this paper. A solution concept of this optimization problem is proposed by considering an ordering relation on the class of all fuzzy numbers. The solution concept proposed in...

The constructed hierarchical optimization model of vintage capital replacement takes into account network effects and the age-dependent technological structure of capital equipment. It involves the control of a network coalition choice, endogenous investments, capital structure, and capital...

New concepts of relative monotonicity were introduced in Konnov (Oper Res Lett 28:21–26, 2001a) which extend the usual ones. These concepts enable us to establish new existence and uniqueness results for variational inequality problems over product sets. This paper presents first-order...

In many industries, managers face the problem of selling a given stock of items by a deadline. We investigate the problem of dynamically pricing such inventories when demand is price sensitive and stochastic and the firm’s objective is to maximize expected revenues. Examples that fit this...

We consider a two-stage tandem queueing network where jobs from station 1 join station 2 with a certain probability. Each job incurs a linear holding cost, different for each station. Each station is attended by a dedicated server, and there is an additional server that is either constrained to...

In this paper, we study a scheduling problem of jobs from two different queues on several parallel servers. Jobs have exponentially distributed processing times, and incur costs per unit of time, until they leave the system, and there are no arrivals to the system at any time. The objective is...