In this paper, we describe an interactive procedural algorithm for convex multiobjective programming based upon the Tchebycheff method, Wierzbicki's reference point approach, and the procedure of Michalowski and Szapiro. At each iteration, the decision maker (DM) has the option of expressing his...

Most interactive methods developed for solving multiobjective optimization problems sequentially generate Pareto optimal or nondominated vectors and the decision maker must always allow impairment in at least one objective function to get a new solution. The NAUTILUS method proposed is based on...

In this paper, we present an interactive algorithm (ISTMO) for stochastic multiobjective problems with continuous random variables. This method combines the concept of probability efficiency for stochastic problems with the reference point philosophy for deterministic multiobjective problems....

This paper was written as a technical note to explain the seasonal adjustment procedure used by the Central Bank of Chile. The methodology used here, named X-12-ARIMA, was developed by the U.S. Census Bureau. This paper also includes a procedure manual for the seasonal adjustment of economic...

Despite the mathematical properties and algorithmic features of an interactive method, that method's success usually lies in the kind of information it requires from the decision maker. In some cases, this information constrains the decision maker. If she does not find it easy and comfortable to...

In this paper, we introduce new ways of utilizing preference information specified by the decision maker in interactive reference point based methods. A reference point consists of desirable values for each objective function. The idea is to take the desires of the decision maker into account...