Duality for minmax programs (Q798567)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duality for minmax programs |
scientific article; zbMATH DE number 3871037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality for minmax programs |
scientific article; zbMATH DE number 3871037 |
Statements
Duality for minmax programs (English)
0 references
1984
0 references
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.
0 references
minmax programs
0 references
linear and nonlinear inequalities
0 references
convex finite dimensional constrained minimization
0 references
conjugate duality theory
0 references
dual problem
0 references
0.9501155
0 references
0.9444618
0 references
0.9411636
0 references
0 references
0.9318931
0 references
