A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program - American Journal of Operations Research

AJOR > Vol.3 No.3, May 2013

American Journal of Operations Research

Volume 3, Issue 3 (May 2013)

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

Google-based Impact Factor: 0.84 Citations

A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program ()

HTML XML

Download as PDF (Size: 298KB) PP. 387-392

DOI: 10.4236/ajor.2013.33036 3,623 Downloads 5,604 Views

Author(s)

Tao Li, Yanjun Wang, Zhian Liang

Affiliation(s)

Department of Mathematics Shanghai University of Finance and Economics, Shanghai, China.
Department of Statistics, Missouri University of Science & Technology, Rolla, USA.

ABSTRACT

A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.

KEYWORDS

Noninferior Frontier; Convexification; Weighting Method; Multiobjective Optimization

Share and Cite:

T. Li, Y. Wang and Z. Liang, "A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program," American Journal of Operations Research, Vol. 3 No. 3, 2013, pp. 387-392. doi: 10.4236/ajor.2013.33036.

Cited by

No relevant information.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies