Minimax programming under \((p,r)\)-invexity
type: Item
instance of: scholarly article
title: Minimax programming under \((p,r)\)-invexity
zbMATH Open document ID: 1061.90115
DOI: 10.1016/S0377-2217(03)00352-7
author: Tadeusz Antczak
published in: European Journal of Operational Research
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 2083616
zbMATH Keywords: Minimax programming
zbMATH Keywords: \((p,r)\)-invex function with respect to \(\eta\)
zbMATH Keywords: optimality
zbMATH Keywords: conditions
zbMATH Keywords: duality
MaRDI profile type: Publication
cites work: \((p,r)\)-invex sets and functions
cites work: Q3693272
cites work: Q3402438
cites work: Invex functions and constrained local minima
cites work: An algorithm for generalized fractional programs
cites work: Q5534710
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Q5589748
cites work: Q3325486
cites work: Q3980000
cites work: Necessary conditions and sufficient conditions for static minmax problems
cites work: Nondifferentiable mathematical programming and convex-concave functions
cites work: Q5285557
cites work: A duality theorem for non-linear programming
full work available at URL: s0377-2217(03)00352-7
OpenAlex ID: W2033288946
description: scientific article; zbMATH DE number 2083616