American Journal of Operations Research

Volume 4, Issue 6 (November 2014)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 1.04  Citations  h5-index & Ranking

A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming

HTML  XML Download Download as PDF (Size: 2555KB)  PP. 331-339  
DOI: 10.4236/ajor.2014.46032    2,756 Downloads   3,450 Views  Citations

ABSTRACT

In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.

Share and Cite:

Meng, Z. , Shen, R. and Jiang, M. (2014) A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming. American Journal of Operations Research, 4, 331-339. doi: 10.4236/ajor.2014.46032.

Cited by

[1] Optimal Chiller Loading by MOEA/D for Reducing Energy Consumption
Intelligent Computing Theories and Application, 2018

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.