Motivated by important applications, the theory of mathematical programming has been extended to the case of infinitely many restrictions. At the same time, this theory knew remarcable developments since invexity and its further generalizations have been introduced as substitute of convexity. Here, we consider the multiobjective programming with a set of restrictions indexed in a compact. We obtain optimality criteria of Kuhn-Tucker type under new weaker invexity conditions. Also some dual probles are introduced and it is proved that the weak and strong duality properties hold within the same environement.

Semi-infinite multiobjective programming with generalized invexity

FERRARA, Massimiliano
Methodology
;
2010-01-01

Abstract

Motivated by important applications, the theory of mathematical programming has been extended to the case of infinitely many restrictions. At the same time, this theory knew remarcable developments since invexity and its further generalizations have been introduced as substitute of convexity. Here, we consider the multiobjective programming with a set of restrictions indexed in a compact. We obtain optimality criteria of Kuhn-Tucker type under new weaker invexity conditions. Also some dual probles are introduced and it is proved that the weak and strong duality properties hold within the same environement.
2010
multiobjective programming, invexity, efficiency
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12318/7243
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 22
social impact