Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
type: Item
instance of: scholarly article
title: Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
zbMATH Open document ID: 0946.90086
DOI: 10.1023/A:1021781308794
published in: Journal of Optimization Theory and Applications
publication date: 1999-06-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 1300014
zbMATH Keywords: convexlike functions
zbMATH Keywords: alternative theorems of Farkas type
zbMATH Keywords: duality theory
zbMATH Keywords: constrained optimization problems
author: Tibor Illés
author: Gábor Kassay
MaRDI profile type: Publication
cites work: Perfect duality for convexlike programs
cites work: Abstract Kuhn-Tucker theorems
cites work: Nonconvex theorems of the alternative and minimization
cites work: Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
cites work: Inequality systems and optimization
cites work: On the image of a constrained extremum problem and some applications to the existence of a minimum
cites work: Solvability results for sublinear functions and operators
cites work: Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
cites work: Q4347619
cites work: Theorems of the alternative and optimality conditions
cites work: Q3869074
cites work: A generalization of a minimax theorem of Fan via a theorem of the alternative
cites work: Q4764328
cites work: Über das von-Neumannsche Minimax-Theorem
cites work: Q3706043
cites work: Q4384871
cites work: Convex Analysis
cites work: Q4051876
full work available at URL: a:1021781308794
OpenAlex ID: W152156553
description: scientific article; zbMATH DE number 1300014