The aim of the paper is to present the postoptimal analysis of a chosen extreme efficient point in multicriteria linear programming. There are three cases considered: one objective function coefficient change, objective function addition and objective function removal. The proven theorems allow...

This paper, studies the sensitivity analysis of weakly efficient extreme solutions in multiple objective linear programming (MOLP). The aim of the paper is to compute the set of the parameters (corresponding to one coefficient) for which a given extreme point is a weakly efficient solution. We...

This article describes two methods of creating Olympic rankings based on number of medals won. One method is based on the weighted mean value, which we will show is equivalent to the compromise programming known in Multi-Criteria Decision Analysis (MCDM). The other method uses volume-based...

The main question is how to compute the upper and lower limits of the range of possible values of a given statistic, when the data range over given intervals. Initially some well-known statistics, such as sample mean, sample variance or F-ratio, are considered in order to illustrate that in some...

Data in many real-life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb. We consider a generalized linear fractional programming problem with interval data and present an...

Traditional sensitivity and parametric analysis in linear optimization was based on preserving optimal basis. Interior point methods, however, do not converge to a basic solution (vertex) in general. Recently, there appeared new techniques in sensitivity analysis, which consist in preserving so...