Skip to main content
Article thumbnail
Location of Repository

A FAST ALGORITHM FOR FINDING THE NON DOMINATED SET IN MULTIOBJECTIVE OPTIMIZATION

By K. K. Mishra and Eep Harit

Abstract

The working of single objective optimization algorithm and multi objective optimization algorithm is quite different. This difference is due to number of optimal solution approached by both the algorithms. In single objective optimization problem there will be a single optimal solution, even though in multi model optimization there may be more than one solution but we are interested in only one optimal solution, where as in multi objective optimization problem, there will be many set of optima

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.184.6452
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ijcaonline.org/allp... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.