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:
Bae, Kwan Deok, Kang, Young Min, Kim, Do Sang (2010)
Journal of Inequalities and Applications [electronic only]
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:
Nobakhtian, S. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Alexandra Šipošová (2008)
Kybernetika
Similarity:
Relations between (proper) Pareto optimality of solutions of multicriteria optimization problems and solutions of the minimization problems obtained by replacing the multiple criteria with -norm related functions (depending on the criteria, goals, and scaling factors) are investigated.
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:
Zalmai, G.J. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Santos, Lucelina Batista, Rojas-Medar, Marko A., Rufián-Lizana, Antonio (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity: