Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
type: Item
instance of: scholarly article
title: Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
zbMATH Open document ID: 1187.90302
author: Qingxiang Zhang
published in: Journal of Global Optimization
publication date: 2009-12-02T00:00:00Z
review text: By relaxing the definitions of arcwise connected functions and B-vex functions, the paper introduces the generalized convexity concept of (strictly) B-arcwise connected functions. Fritz John and Karush-Kuhn-Tucker type necessary and sufficient optimality conditions as well as duality results are given for semi-infinite optimization problems involving such functions.
reviewed by: Oliver Stein
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 26B25
zbMATH DE Number: 5641562
zbMATH Keywords: B-arcwise connected function
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: optimality condition
zbMATH Keywords: duality
MaRDI profile type: Publication
full work available at URL: s10898-009-9400-8
OpenAlex ID: W2023423909
cites work: Q4135211
cites work: Generalized arcwise-connected functions and characterizations of local- global minimum properties
cites work: B-vex functions
cites work: Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions
cites work: Direct theorems in semi-infinite convex programming
cites work: Duality in semi-infinite programs and some works of Haar and Carathéodory
cites work: Optimality conditions and duality for fractional programming problems involving arcwise connected functions and their generalizations
cites work: On duality in semi-infinite programming and existence theorems for linear inequalities
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Uniform duality in semi-infinite convex optimization
cites work: Duality gaps in semi-infinite linear programming—an approximation problem
cites work: Limiting Lagrangians: A primal approach
cites work: Q4503650
cites work: Q4729606
cites work: Optimality conditions for nondifferentiable convex semi-infinite programming
cites work: Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
cites work: Q3840143
cites work: First-order optimality conditions in generalized semi-infinite programming
cites work: Optimality conditions and duality for arcwise semi-finite programming with parametric inequality constraints
DOI: 10.1007/S10898-009-9400-8
description: scientific article; zbMATH DE number 5641562