A Class of Multiple Objective Mathematical Programming Problems in a Rough Environment

Authors

1 Department of Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran

2 Department of Statistics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran

Abstract

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

Keywords


Volume 23, Issue 1 - Serial Number 1
Transactions on Industrial Engineering (E)
February 2016
Pages 301-315
  • Receive Date: 17 January 2015
  • Revise Date: 21 December 2024
  • Accept Date: 27 July 2017