Duality gap in interval linear programming (Q2302757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7174587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality gap in interval linear programming |
scientific article; zbMATH DE number 7174587 |
Statements
Duality gap in interval linear programming (English)
0 references
26 February 2020
0 references
The duality gap in interval linear programming is studied. Concepts of a weakly and strongly zero duality gap for interval linear programming problems are introduced. The authors consider three types of interval linear programming problems: 1) problems with equality constraints and nonegative variables, 2) problems with inequality constraints without restrictions on signs of variables, 3) problems with inequality constraints and nonnegative variables. A characterization for weakly zero duality is proposed. Both sufficient and necessary conditions for a strongly zero duality gap are proved. The computational complexity of the proposed procedures is analyzed. Some open questions for further research in the area are summarized in the Conclusion.
0 references
interval analysis
0 references
linear programming
0 references
interval linear programming
0 references
duality gap
0 references
computational complexity
0 references
0 references
0 references
0 references
0.94825184
0 references
0 references
0.91262674
0 references
0.9125551
0 references
0.91004664
0 references
0.90781516
0 references
0.9050391
0 references
