TY - JOUR ID - 3836 TI - A Class of Multiple Objective Mathematical Programming Problems in a Rough Environment JO - Scientia Iranica JA - SCI LA - en SN - 1026-3098 AU - Hamzehee, A. AU - Yaghoobi, M A.. AU - Mashinchi, M. AD - Department of Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran AD - Department of Statistics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran Y1 - 2016 PY - 2016 VL - 23 IS - 1 SP - 301 EP - 315 KW - Rough set KW - Multiple objective programming KW - Rough programming KW - Complete-optimal solutions KW - Efficient solutions DO - 10.24200/sci.2016.3836 N2 - This paper presents a set of multiple objective programming problems in a rough environment. These problems are classified into five classes according to the location of the roughness in the objective functions or the feasible set. We study the class in which all of the objective functions are crisp and the feasible region is a rough set and, in particular, discuss the properties of the completely and efficient (Pareto optimal) solutions of rough multiple objective programming problems. In order to obtain these solutions we need certain theorems which we derive. Finally, we illustrate our results by examples UR - https://scientiairanica.sharif.edu/article_3836.html L1 - https://scientiairanica.sharif.edu/article_3836_f3a552de6952f7679f30d001dace2c30.pdf ER -