Abstract: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problem...

Abstract In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed are line with concept decision robustness, which considers uncertainty respect to implementation a specific solution. An efficient solution is considered be robust if many solutions its neighborhood as well. This rather new area research differs from conc...

In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex. This method is an extension of Benson’s outer approximation algorithm for multi-objective linear programming problems...

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...

This paper aims to find efficient solutions a multi-objective optimization problem (MP) with convex polynomial data. To this end, hybrid method, which allows us transform into scalar \(({\mathrm{P}}_{z})\) and does not destroy the properties of convexity, is considered. First, we show an existence result for under some mild assumption. Then, \((P_{z})\), establish two kinds representations non-...