Generalized -univex -set functions and semiparametric duality models in multiobjective fractional subset programming.
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bae, Kwan Deok, Kang, Young Min, Kim, Do Sang (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Nobakhtian, S. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kim, Ho Jung, Seo, You Young, Kim, Do Sang (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Radu Boţ, Robert Chares, Gert Wanka (2007)
Open Mathematics
Similarity:
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...
Zalmai, G. J. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kim, Do Sang, Lee, Hyo Jung (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)
The Yugoslav Journal of Operations Research
Similarity:
S.K. Mishra, B.B. Upadhyay (2012)
The Yugoslav Journal of Operations Research
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.
Agarwal, Ravi P., Ahmad, I., Husain, Z., Jayswal, A. (2010)
Journal of Inequalities and Applications [electronic only]
Similarity: