Constraint qualifications in the invex case
type: Item
instance of: scholarly article
title: Constraint qualifications in the invex case
zbMATH Open document ID: 0944.90086
DOI: 10.1080/02522667.1998.10699386
published in: Journal of Information and Optimization Sciences
publication date: 1999-08-02T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 1319644
zbMATH Keywords: constraint qualifications
zbMATH Keywords: nonlinear programming problem
author: Giorgio Giorgi
author: Angelo Guerraggio
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/02522667.1998.10699386
OpenAlex ID: W2334697612
cites work: Constraint qualifications in maximization problems
cites work: Constraint Qualifications Revisited
cites work: Foundations of optimization
cites work: What is invexity?
cites work: On constraint qualifications in nonlinear programming
cites work: A Necessary and Sufficient Qualification for Constrained Optimization
cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Optimality criteria in nonlinear programming involving nonconvex functions
cites work: Q5591247
Recommended article: Sufficient conditions for invexity
Recommended article: Q3351153
Recommended article: Invexity and the Kuhn-Tucker theorem
Recommended article: Avoiding a Constraint Qualification
description: scientific article; zbMATH DE number 1319644