J Austral Math Soc Ser B 33 pp531--544, 1992.

Duality without constraint qualification for multiobjective programming

R. R. Egudo, T. Weir and B. Mond

(Received 10 December 1990; revised 13 March 1991)

Abstract

Extending earlier duality results for multiobjective programs, this paper defines dual problems for convex and generalised convex multiobjective programs without requiring a constraint qualification. The duals provide multiobjective extensions of the classical duals of Wolfe and Schechter and some of the more recent duals of Mond and Weir.

Browse the article

Read the article in your browser. (Print at 75% on A4 paper).

Authors

R. R. Egudo: School of App. Science, Monash University College, Churchill VIC. 3842.
B. Mond: Department of Mathematics, Australian Defence Force Academy, Campbell, ACT 2600.
T. Weir: Department of Mathematics, La Trobe University, Bundoora, VIC 3083.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Sun Jan 27 17:56:48 2002