The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems allow us to give dual characterizations for the efficient solutions of the initial fractional problem. The aim of this paper is to compare the intermediate dual problem with other similar dual problems known from the literature. We completely establish the inclusion relations between the image sets of the duals as well as between the sets of maximal elements of the image sets.
In this paper, we formulate and discuss a fairly large number of sets of global parametric sufficient efficiency criteria under various generalized (η, ρ)-invexity assumptions, and prove a semiinfinite version of a well-known second-order sufficiency result for a semiinfinite multiobjective fractional programming problem.
In this paper, we discuss a fairly large number of parametric and semiparametric duality results under various generalized (η, ρ)-invexity assumptions for a semiinfinite multiobjective fractional programming problem.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.