On various duality theorems in nonlinear programming
type: Item
instance of: scholarly article
title: On various duality theorems in nonlinear programming
zbMATH Open document ID: 0595.90072
DOI: 10.1007/BF00938952
author: C. R. Bector
author: M. K. Bector
published in: Journal of Optimization Theory and Applications
publication date: 1987-01-01T00:00:00Z
review text: Recently, Gulati and Craven and Mond and Egudo established strict converse duality theorems for some of Mond-Weir duals for nonlinear programming problems. Here, we establish various duality theorems under weaker convexity conditions that are different from those of Gulati and Craven, Mond and Weir, and Mond and Egudo.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 3959139
zbMATH Keywords: Mond-Weir duals
zbMATH Keywords: duality theorems
zbMATH Keywords: weaker convexity conditions
MaRDI profile type: Publication
cites work: A duality theorem for non-linear programming
cites work: A Strict Converse Duality Theorem in Nonlinear Programming
cites work: On Strict Converse Duality In Nonlinear Programming
cites work: Seven Kinds of Convexity
cites work: Q3220361
cites work: Q3710318
cites work: Invex functions and constrained local minima
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Generalization of some duality theorems in nonlinear programming
cites work: Convex Analysis
cites work: Q4133421
full work available at URL: https://doi.org/10.1007/bf00938952
OpenAlex ID: W2029978297
description: scientific article; zbMATH DE number 3959139