A note on mixed type converse duality in multiobjective programming problems

Xinmin Yang; Xiaoqi Yang

doi:10.3934/jimo.2010.6.497

Article Contents

2010, Volume 6, Issue 3: 497-500. Doi: 10.3934/jimo.2010.6.497

This issue Previous Article Optimal strategies of benchmark and mean-variance portfolio selection problems for insurers Next Article A heterogeneous two-server network system with balking and a Bernoulli vacation schedule

A note on mixed type converse duality in multiobjective programming problems

Xinmin Yang^1, and
Xiaoqi Yang^2,

1.
Department of Mathematics, Chongqing Normal University, Chongqing 400047
2.
Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong

Received: September 30, 2009

Revised: February 28, 2010

Published: June 2010

Abstract Related Papers Cited by

Abstract

In this note, we establish a mixed type converse duality for a class of multiobjective programming programs. This clarifies several omissions in an earlier work by Yang et al. [Mixed type converse duality in multiobjective programming problems, J. Math. Anal. Appl. 304 (2005) 394-398].

Keywords:

Mathematics Subject Classification: Primary: 90C25, 90C48, 90C29.

Citation:

Article Metrics

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

A note on mixed type converse duality in multiobjective programming problems

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A note on mixed type converse duality in multiobjective programming problems

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content