In this study, we develop an interactive algorithm for the multiple criteria selection problem
that aims to find the most preferred alternative among a set of known alternatives evaluated …

In this study, we develop a new solution approach for the dynamic missile allocation
problem of a naval task group (TG). The approach considers the rescheduling of the surface …

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 …

In this paper, we study a class of multi-player multi-objective game models with linear
objectives. Based on the duality theory and Karush–Kuhn–Tucker (KKT) conditions, two …

In multi-criteria decision making approaches it is typical to consider an underlying
preference function that is assumed to represent the decision maker's preferences. In this …

We address the problem of finding the nadir point in a multi-objective integer programming
problem. Finding the nadir point is not straightforward, especially when there are more than …

Fairness is one of the primary concerns in resource allocation problems, especially in
settings which are associated with public welfare. Using a total benefit-maximizing approach …

We develop an interactive algorithm for biobjective integer programs that finds the most
preferred solution of a decision maker whose preferences are consistent with a quasiconvex …

This article develops exact algorithms to generate all non-dominated points in a specified
region of the criteria space in Multi-Objective Integer Programs (MOIPs). Typically, there are …

In this article, a new exact method is proposed to solve a problem, say (ILFP) _E (ILFP) E, of
maximizing a linear fractional function over the integer efficient set of multi-objective integer …