Higher-order symmetric duality in multiobjective programming with invexity

Xinmin Yang; Xiaoqi Yang; Kok Lay Teo

doi:10.3934/jimo.2008.4.385

Article Contents

2008, Volume 4, Issue 2: 385-391. Doi: 10.3934/jimo.2008.4.385

This issue Previous Article Discrepancy distances and scenario reduction in two-stage stochastic mixed-integer programming Next Article Two numerical schemes for general variational inequalities

Higher-order symmetric duality in multiobjective programming with invexity

1.
Department of Mathematics, Chongqing Normal University, Chongqing 400047
2.
Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
3.
Department of Mathematics and Statistics, Curtin University of Technology, GPO Box U 1987, Perth, W.A. 6845

Received: October 31, 2006

Revised: January 31, 2008

Published: March 2008

Abstract Related Papers Cited by

Abstract

In this paper, a pair of higher order symmetric dual models for multiobjective nonlinear programming is introduced. The weak, strong and converse duality theorems are proven for the formulated higher order symmetric dual programs under invexity conditions.

Keywords:

Mathematics Subject Classification: 90C29, 90C46.

Citation:

Article Metrics

HTML views() PDF downloads(119) Cited by(0)

Higher-order symmetric duality in multiobjective programming with invexity

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Higher-order symmetric duality in multiobjective programming with invexity

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content