A visual interactive approach for scenario-based stochastic multi-objective problems and an application

2012-12-01
Balibek, E.
Köksalan, Mustafa Murat
In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decision maker (DM) explores desirable parts of the efficient frontier using a visual representation that depicts the trajectories of the objective function values within confidence bands. In this way, we communicate the effects of randomness inherent in the problem to the DM to help her understand the trade-offs and the levels of risk associated with each objective. Journal of the Operational Research Society (2012) 63, 1773-1787. doi:10.1057/jors.2012.25 Published online 11 April 2012
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

Suggestions

A stochastic approach for load scheduling of cogeneration plants
Doğan, Osman Tufan; Yeşin, Ahmet Orhan; Department of Mechanical Engineering (2010)
In this thesis, load scheduling problem for cogeneration plants is interpreted in the context of stochastic programming. Cogeneration (CHP) is an important technology in energy supply of many countries. Cogeneration plants are designed and operated to cover the requested time varying demands in heat and power. Load scheduling of cogeneration plants represents a multidimensional optimization problem, where heat and electricity demands, operational parameters and associated costs exhibit uncertain behavior. C...
Using Criticalities as a Heuristic for Answer Set Programming
SABUNCU, ORKUNT; Alpaslan, Ferda Nur; AKMAN, VAROL (2004-01-08)
Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of the system. A new heuristic for answer s...
Optimising a nonlinear utility function in multi-objective integer programming
Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01)
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...
Character sums of quadratic forms over finite fields and the number of rational points for some classes of artin-schreier type curves
Coşgun, Ayhan; Doğanaksoy, Ali; Department of Mathematics (2017)
Exponential sums of quadratic forms over finite fields have many applications to various areas such as coding theory and cryptography. As an example to these applications, there is an organic connection between exponential sums of quadratic forms and the number of rational points of algebraic curves defined over finite fields. This connection is central in the application of algebraic geometry to coding theory and cryptography. In this thesis, different facts and techniques of theory of finite fields are co...
An interactive approximation algorithm for multi-objective integer programs
Lokman, Banu; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01)
We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change th...
Citation Formats
E. Balibek and M. M. Köksalan, “A visual interactive approach for scenario-based stochastic multi-objective problems and an application,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 1773–1787, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57625.