alexa On Duality of Multiobjective Rough Convex Programming Problems

Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

On Duality of Multiobjective Rough Convex Programming Problems

The mathematical programming in rough environment was introduced in [1-4]. The multiobjective rough convex programming problem (MRCPP) can be classified according to existence of roughness is in multiobjective function or constraints. The mathematical problems can be classified into three classes. First class: MRCPP with rough feasible set and deterministic multiobjective function. Second class: problems with deterministic feasible set and rough multiobjective function. Third Class: problems with rough feasible set and rough multiobjective function. There are two solution sets of the MRCPP; surely Pareto optimal solution set and possibly Pareto optimal solution set. The aim of this paper is to present the concepts of duality of MRCPP when roughness is in the multiobjective function and the feasible region is deterministic. Also it discussed the duality when roughness is in feasible region and multiobjective is deterministic.

  • Share this page
  • Facebook
  • Twitter
  • LinkedIn
  • Google+
  • Pinterest
  • Blogger
Top