On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
type: Item
instance of: scholarly article
title: On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
zbMATH Open document ID: 0964.90051
author: C. R. Bector
author: Suresh Chandra
author: Abha
published in: Journal of Mathematical Analysis and Applications
publication date: 2000-12-19T00:00:00Z
review text: Starting from a partitioning of the constraints, the authors introduce incomplete Lagrange functions for three classes of mathematical programming problems and use them to establish saddle point optimality criteria under generalized convexity assumptions.
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 1545031
zbMATH Keywords: incomplete Lagrange functions
zbMATH Keywords: saddle point optimality criteria
zbMATH Keywords: generalized convexity
reviewed by: Wolfgang W. Breckner
MaRDI profile type: Publication
full work available at URL: jmaa.2000.7014
OpenAlex ID: W2029061302
cites work: Q4135211
cites work: Q3134873
cites work: Duality in nonlinear fractional programming
cites work: Generalized fractional programming duality: A parametric approach
cites work: Q3202144
cites work: What is invexity?
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Q5589748
cites work: Q3325486
cites work: A duality theorem for non-linear programming
DOI: 10.1006/JMAA.2000.7014
description: scientific article; zbMATH DE number 1545031