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:
S.K. Mishra, B.B. Upadhyay (2012)
The Yugoslav Journal of Operations Research
Similarity:
I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)
The Yugoslav Journal of Operations Research
Similarity:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Nobakhtian, S. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Tran Quoc Chien (1984)
Kybernetika
Similarity:
Bae, Kwan Deok, Kang, Young Min, Kim, Do Sang (2010)
Journal of Inequalities and Applications [electronic only]
Similarity: