Comparison between different duals in multiobjective fractional programming

Radu Boţ; Robert Chares; Gert Wanka

Displaying similar documents to “Comparison between different duals in multiobjective fractional programming”

Efficiency and Duality in Nonsmooth Multiobjective Fractional Programming Involving η-pseudolinear Functions

S.K. Mishra, B.B. Upadhyay (2012)

The Yugoslav Journal of Operations Research

Similarity:

Duality for Multiobjective Fractional Programming Problems Involving $d$ -Type-I -Set $n$ -Functions

I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)

The Yugoslav Journal of Operations Research

Similarity:

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and global parametric sufficient optimality conditions in minmax fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Duality without constraint qualification in nonsmooth optimization.

Nobakhtian, S. (2006)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and parametric duality models in minmax fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

Radu Boţ, Ioan Hodrea, Gert Wanka (2008)

Open Mathematics

Similarity:

We consider a convex optimization problem with a vector valued function as objective function and convex cone inequality constraints. We suppose that each entry of the objective function is the composition of some convex functions. Our aim is to provide necessary and sufficient conditions for the weakly efficient solutions of this vector problem. Moreover, a multiobjective dual treatment is given and weak and strong duality assertions are proved.

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Duality in vector optimization. I. Abstract duality scheme

Tran Quoc Chien (1984)

Kybernetika

Similarity:

Efficiency and generalized convex duality for nondifferentiable multiobjective programs.

Bae, Kwan Deok, Kang, Young Min, Kim, Do Sang (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Unification of the abstract duality scheme

Tran Quoc Chien (1987)

Kybernetika

Similarity: