Duality for nonconvex absolute value programming and a characterization of linear max-min programs (Q1058980)
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 nonconvex absolute value programming and a characterization of linear max-min programs |
scientific article; zbMATH DE number 3902388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for nonconvex absolute value programming and a characterization of linear max-min programs |
scientific article; zbMATH DE number 3902388 |
Statements
Duality for nonconvex absolute value programming and a characterization of linear max-min programs (English)
0 references
1985
0 references
A dual problem for nonconvex linear programs with absolute value functionals is constructed by means of a max-min problem involving bivalent variables. A relationship between the classical linear max-min problem and a linear program with absolute value functionals is developed. This program is then used to compute the duality gap between some max-min and min-max linear problems.
0 references
dual problem
0 references
nonconvex linear programs
0 references
absolute value functionals
0 references
max- min problem
0 references
bivalent variables
0 references
duality gap
0 references
