• Title/Summary/Keyword: scalarization approach

Search Result 2, Processing Time 0.016 seconds

SCALARIZATION METHODS FOR MINTY-TYPE VECTOR VARIATIONAL INEQUALITIES

  • Lee, Byung-Soo
    • East Asian mathematical journal
    • /
    • v.26 no.3
    • /
    • pp.415-421
    • /
    • 2010
  • Many kinds of Minty's lemmas show that Minty-type variational inequality problems are very closely related to Stampacchia-type variational inequality problems. Particularly, Minty-type vector variational inequality problems are deeply connected with vector optimization problems. Liu et al. [10] considered vector variational inequalities for setvalued mappings by using scalarization approaches considered by Konnov [8]. Lee et al. [9] considered two kinds of Stampacchia-type vector variational inequalities by using four kinds of Stampacchia-type scalar variational inequalities and obtain the relations of the solution sets between the six variational inequalities, which are more generalized results than those considered in [10]. In this paper, the author considers the Minty-type case corresponding to the Stampacchia-type case considered in [9].

A Study of New Evolutionary Approach for Multiobjective Optimization (다목적함수 최적화를 위한 새로운 진화적 방법 연구)

  • Shim, Mun-Bo;Suh, Myung-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.6
    • /
    • pp.987-992
    • /
    • 2002
  • In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.