On linear programming duality and necessary and sufficient conditions in minimax theory

Simple item page
dc.contributor.authorFrenk, J. B. G.
dc.contributor.authorKas, P.
dc.contributor.authorKassay, G.
dc.date.accessioned2026-02-06T18:34:32Z
dc.date.issued2007
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractIn this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality for a general class of optimization problems.
dc.identifier.doi10.1007/s10957-007-9164-6
dc.identifier.endpage439
dc.identifier.issn0022-3239
dc.identifier.issue3
dc.identifier.orcid0000-0002-2161-8681
dc.identifier.orcid0000-0003-1269-6095
dc.identifier.scopus2-s2.0-34547304982
dc.identifier.scopusqualityQ2
dc.identifier.startpage423
dc.identifier.urihttps://doi.org/10.1007/s10957-007-9164-6
dc.identifier.urihttps://hdl.handle.net/11129/11842
dc.identifier.volume132
dc.identifier.wosWOS:000248205700005
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer/Plenum Publishers
dc.relation.ispartofJournal of Optimization Theory and Applications
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WoS_20260204
dc.subjectminimax theory
dc.subjectgame theory
dc.subjectLagrangian duality
dc.subjectlinear programming duality
dc.titleOn linear programming duality and necessary and sufficient conditions in minimax theory
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu