On Duality of Multiobjective Rough Convex Programming Problems
- *Corresponding Author:
- Elsisy MA
Faculty of Engineering - Benha
Benha University, Egypt
E-mail: [email protected]
Received date: September 21, 2015 Accepted date: October 17, 2015 Published date: October 23, 2015
Citation: Elsisy MA, Osman MSA, Eid MH (2015) On Duality of Multiobjective Rough Convex Programming Problems. J Appl Computat Math 4:263. doi: 10.4172/2168- 9679.1000263
Copyright: © 2015 Elsisy MA, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Duality assertions are very important in optimization from the theoretical as well as from the numerical point of view. So this paper presents duality of multiobjective rough convex programming problems in rough environment when the multiobjective function is deterministic and roughness is in feasible region. Also it discussed the duality when roughness in multiobjective function and the feasible region is deterministic. The concepts and some theorems of duality in the rough environment are discussed. Also, the procedure of solution of these kind of problems described.