Duality theorems for certain programs involving minimum or maximum operations
From MaRDI portal
Publication:4191873
DOI10.1007/BF01582120zbMath0405.90067OpenAlexW2035569196MaRDI QIDQ4191873
Jacob Flachs, Moshe A. Pollatschek
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582120
Related Items (14)
Multipliers and general Lagrangians ⋮ A convex-like duality scheme for quasi-convex programs ⋮ Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs ⋮ An extension of D.C. duality theory, with an appendix on ∗-subdifferentials ⋮ A duality approach to minimax results for quasi-saddle functions in finite dimensions ⋮ Critical duality ⋮ Conjugacy in quasi-convex programming ⋮ V -dualities and ⊥-dualities ⋮ Are dualities appropriate for duality theories in optimization? ⋮ What is quasiconvex analysis? ⋮ A stability result in quasi-convex programming ⋮ Global saddle-point duality for quasi-concave programs ⋮ Conjugaison par tranches ⋮ Global saddle-point duality for quasi-concave programs, II
Cites Work
This page was built for publication: Duality theorems for certain programs involving minimum or maximum operations
