Duality for minmax programs
type: Item
instance of: scholarly article
title: Duality for minmax programs
zbMATH Open document ID: 0546.90074
DOI: 10.1016/0022-247X(84)90088-X
author: T. R. Jefferson
author: Carlton H. Scott
published in: Journal of Mathematical Analysis and Applications
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 49J35
Mathematics Subject Classification ID: 49K35
Mathematics Subject Classification ID: 90C55
zbMATH DE Number: 3871037
zbMATH Keywords: minmax programs
zbMATH Keywords: linear and nonlinear inequalities
zbMATH Keywords: convex finite dimensional constrained minimization
zbMATH Keywords: conjugate duality theory
zbMATH Keywords: dual problem
MaRDI profile type: Publication
cites work: Q5821624
cites work: A Minimax Ordering Policy for the Infinite Stage Dynamic Inventory Problem
cites work: Saddle points of Hamiltonian systems in convex problems of Lagrange
cites work: Geometric Programming
Recommended article: Q3975282
Recommended article: Q3758576
Recommended article: Q3348725
Recommended article: Q5004693
Recommended article: Duality for a class of minmax and inexact programming problem
Recommended article: A duality model for a generalized minmax program
Recommended article: Duality for a minimax programming problem containing \(n\)-set functions
Recommended article: A dual algorithm for minimax problems
Recommended article: Duality for minmax programming involvingV-invex functions
Recommended article: Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
description: scientific article; zbMATH DE number 3871037