0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.02.013 * Corresponding author. E-mail address: [email protected] (A. Kus This paper presents a framework for finding optimal modules in a delayed product differentiation scenario. Historical product sales data is utilized to estimate demand probability and customer preferences. Then this information is used by a mul...

In this paper, we focus on expensive multiobjective optimization problems and propose a method to predict an approximation of the Pareto optimal set using classification of sampled decision vectors as dominated or nondominated. The performance of our method, called EPIC, is demonstrated on a set of benchmark problems used in the multiobjective optimization literature and compared with state-of ...

We study a stochastic version of Fudenberg–Tirole’s preemption game. Two firms contemplate entering a new market with stochastic demand. Firms differ in sunk costs of entry. If the demand process has no upward jumps, the low cost firm enters first, and the high cost firm follows. If leader’s optimization problem has an interior solution, the leader enters at the optimal threshold of a monopolis...

This paper presents a technique that incorporates preference information within the framework of multi-objective evolutionary algorithms for the solution of many-objective optimization problems. The proposed approach employs a single reference point to express the preferences of a decision maker, and adaptively biases the search procedure toward the region of the Pareto-optimal front that best ...

We consider the problem of optimally acquiring and retiring assets that are undergoing technological change over an unbounded horizon. The allowance for technological change prevents one from adopting the classic repeated-plant assumption that future replacements will be identical in costs to current asset contenders, thus confronting one with a non-stationary infinite horizon problem to solve....

Although the celebrated Vickrey auction is strategy-proof and guaranteed to achieve an efficient allocation in a singleobject auction, if there exists no outside party (i.e., a seller or an auctioneer) with the right to collect the payment, the collected payment will be wasted. Redistribution mechanisms try to redistribute the payment to participating agents as much as possible without violatin...

Abstract: We address the problem of deriving Pareto optimal solutions of multiple objective optimization problems with predetermined upper bounds on trade-offs. As shown, this can be achieved by a linear transformation of objective functions. Each non-diagonal element of the transformation matrix is related to a bound on the trade-off between a pair of the objective functions.

Classical evolutionary multi-objective optimization algorithms aim at finding an approximation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended prefere...

Abstract—A thermo-exergy optimization of a gas turbine cycle with two different regenerator designs is established. A comparison was made between the performance of the two regenerators and their roles in improving the cycle efficiencies. The effect of operational parameters (the pressure ratio of the compressor, the ambient temperature, excess of air, geometric parameters of the regenerators, ...

We deal with the problem faced by a portfolio manager in charge of multiple accounts. We argue that because of market impact costs, this setting differs in several subtle ways from the classical (single account) case, with the key distinction being that the performance of each individual account typically depends on the trading strategies of other accounts, as well. We propose a novel, tractabl...