Invex functions and generalized convexity in multiobjective programming
type: Item
instance of: scholarly article
title: Invex functions and generalized convexity in multiobjective programming
zbMATH Open document ID: 0921.90133
DOI: 10.1023/A:1022628130448
author: R. Osuna-Gómez
author: A. Rufián-Lizana
author: P. Ruíz-Canales
published in: Journal of Optimization Theory and Applications
publication date: 1999-03-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1236677
zbMATH Keywords: weakly efficient points
zbMATH Keywords: optimality conditions
zbMATH Keywords: invex functions
zbMATH Keywords: vectorial optimization
zbMATH Keywords: KuhnTucker points
zbMATH Keywords: multiobjective programming
zbMATH Keywords: generalized convexity
MaRDI profile type: Publication
cites work: The essence of invexity
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Invex functions and constrained local minima
cites work: What is invexity?
cites work: Q3682265
cites work: Further Generalizations of Convexity in Mathematical Programming
cites work: A characterization of weakly efficient points
cites work: Lagrangean conditions and quasiduality
Recommended article: Invexity in multifunction optimization
Recommended article: Generalized invexity and duality in multiobjective programming problems
Recommended article: Generalized convexity in multiobjective programming
Recommended article: Generalized invexity and duality in multiobjective nonlinear programming.
Recommended article: A note on invex functions and duality in multiple objective optimization
Recommended article: Q2990568
Recommended article: Q4612277
Recommended article: Multiple Objective Programming Involving Differentiable (Hp, r)-invex Functions
description: scientific article; zbMATH DE number 1236677