caa a22 4500 386360707 CHVBK 20180307111914.0 cr unu---uuuuu 161130e198904 xx s 000 0 eng 10.1017/S000497270000277X doi S000497270000277X pii (NATIONALLICENCE)cambridge-10.1017/S000497270000277X Generalised convexity and duality in multiple objective programming [Elektronische Daten] 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. Copyright © Australian Mathematical Society 1989 Weir T. 7/35 Gaza Rd., West Ryde NSW 2114 Australia Mond B. Department of Mathematics La Trobe University Bundoora, Victoria, 3083 Australia Bulletin of the Australian Mathematical Society Cambridge University Press 39/2(1989-04), 287-299 0004-9727 39:2<287 1989 39 BAZ https://doi.org/10.1017/S000497270000277X text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1017/S000497270000277X text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Weir T. 7/35 Gaza Rd., West Ryde NSW 2114 Australia NATIONALLICENCE 700 1- Mond B. Department of Mathematics La Trobe University Bundoora, Victoria, 3083 Australia NATIONALLICENCE 773 0- Bulletin of the Australian Mathematical Society Cambridge University Press 39/2(1989-04), 287-299 0004-9727 39:2<287 1989 39 BAZ CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-cambridge