Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T04:37:55.265Z Has data issue: false hasContentIssue false

Generalised convexity and duality in multiple objective programming

Published online by Cambridge University Press:  17 April 2009

T. Weir
Affiliation:
7/35 Gaza Rd., West Ryde NSW 2114Australia
B. Mond
Affiliation:
Department of MathematicsLa Trobe UniversityBundoora, Victoria, 3083Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

By considering the concept of weak minima, different scalar duality results are extended to multiple objective programming problems. A number of weak, strong and converse duality theorems are given under a variety of generalised convexity conditions.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1989