Duality for minmax programs
From MaRDI portal
A convex finite dimensional constrained minimization problem with objective function being a maximum of a finite number of convex functions is considered. Using conjugate duality theory for generalized geometric programming the authors derive a dual problem. For a particular class of practically meaningful objective functions the dual problem is relatively simple and allows numerical treatment.
Recommendations
- scientific article; zbMATH DE number 17929
- scientific article; zbMATH DE number 4008134
- scientific article; zbMATH DE number 4199989
- scientific article; zbMATH DE number 7377700
- Duality for a class of minmax and inexact programming problem
- A duality model for a generalized minmax program
- Duality for a minimax programming problem containing n-set functions
- A dual algorithm for minimax problems
- Duality for minmax programming involvingV-invex functions
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
Cites work
Cited in
(40)- Duality for nonconvex absolute value programming and a characterization of linear max-min programs
- Conjugate duality for convex programs: A geometric development
- Unconstrained duals to partially separable constrained programs
- On a certain duality for segmented minmax problems
- Duality in D. C. programming: The case of several D. C. constraints
- Minimization of certain cost functions with error bounds
- Duality for radiant and shady programs
- Duality results for nonlinear single minimax location problems via multi-composed optimization
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- A Lagrange duality approach for multi-composed optimization problems
- A general correspondence between dual minimax problems and convex programs
- Symmetric duality in continuous-time programming via minmax duality
- Duality of unary convex functions programming
- Theoretical framework for the analysis of linearly constrained convex programs
- scientific article; zbMATH DE number 4199989 (Why is no real title available?)
- Matrix Programming with Set-Inclusive Constraints and Objective Set
- scientific article; zbMATH DE number 5006248 (Why is no real title available?)
- scientific article; zbMATH DE number 4164563 (Why is no real title available?)
- scientific article; zbMATH DE number 3895744 (Why is no real title available?)
- scientific article; zbMATH DE number 3895745 (Why is no real title available?)
- On duality for convex minimization with nested maxima
- scientific article; zbMATH DE number 3971598 (Why is no real title available?)
- Apex duality for constrained optimization
- Dual Techniques for Minimax
- scientific article; zbMATH DE number 4057279 (Why is no real title available?)
- Duality for programs involving non-separable objective functions
- scientific article; zbMATH DE number 17929 (Why is no real title available?)
- Composite convex programs
- Dualitätstheorie für hyperboiisehe und stückweise lineare konvexe optimierungsprobleme
- Conjugate duals for power functions
- scientific article; zbMATH DE number 3894904 (Why is no real title available?)
- Multifacility minimax location problems via multi-composed optimization
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- Dynamic dualization in a general setting
- Duality for anticonvex programs.
- Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
- Duality inequalities as a numerical aid
- Simplication of dual extremal problems invariant with respect to change in variables
- Farkas-type results for max-functions and applications
- Convexification by duality for a multiple Leontief technology production design problem
This page was built for publication: Duality for minmax programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798567)
