Duality theorems for certain programs involving minimum or maximum operations

DOI10.1007/BF01582120MaRDI QIDQ4191873zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Conjugate FunctionsDualityMaximum OperationsSeperation Hyperplane

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• Decision-Making in a Fuzzy Environment
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Further results on fuzzy-mathematical programming
• Fuzzy sets
• scientific article; zbMATH DE number 3435272 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)

Cited in

(14)

• Conjugaison par tranches
• Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs
• A duality approach to minimax results for quasi-saddle functions in finite dimensions
• A stability result in quasi-convex programming
• Critical duality
• Conjugacy in quasi-convex programming
• V -dualities and ⊥-dualities
• A convex-like duality scheme for quasi-convex programs
• Global saddle-point duality for quasi-concave programs
• Global saddle-point duality for quasi-concave programs, II
• An extension of D.C. duality theory, with an appendix on ∗-subdifferentials
• What is quasiconvex analysis?
• Multipliers and general Lagrangians
• Are dualities appropriate for duality theories in optimization?

This page was built for publication: Duality theorems for certain programs involving minimum or maximum operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4191873)