In this paper we develop a methodology to study the sensitivity and the stability of models built using the Analytic Network Process. We study two types of stability: core and solution stability. The former deals with finding the region of the perturbation space in which the initial solution...

We consider a two-stage decision problem, in which an online retailer first makes optimal decisions on his profit margin and free-shipping threshold, and then determines his inventory level. We start by developing the retailer’s expected profit function. Then, we use publicly-available...

In this paper we consider choice problems under the assumption that the preferences of the decision maker are expressed in the form of a parametric partial weak order without assuming the existence of any value function. We investigate both the sensitivity (stability) of each non-dominated...

Decision making in public and political contexts can be complex. Multi-attribute value/utility theory (MAVT/MAUT) can support such decision processes by providing a transparent framework that helps focusing on objectives and corresponding degrees of achievement by different alternatives.

This paper focuses on sensitivity analysis of the degenerate transportation problem (DTP) when perturbation occurs on one cost coefficient. The conventional Type I sensitivity analysis of the transportation problem (TP) determines the perturbation ranges for the invariant optimal basis. Due to...

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...

Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the...

In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is...

Using a market share attraction structure of advertising competition and following a supermodular game approach, this article demonstrates for an asymmetric oligopoly, the directional impact of changes in model parameters on the marketing controlled variables of all rivals (advertising budgets)...

In this paper, the anchor points in DEA, as an important subset of the set of extreme efficient points of the production possibility set (PPS), are studied. A basic definition, utilizing the multiplier DEA models, is given. Then, two theorems are proved which provide necessary and sufficient...