Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques (Q2477237)
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 5249070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques |
scientific article; zbMATH DE number 5249070 |
Statements
Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques (English)
0 references
13 March 2008
0 references
sealed ceiling bids
0 references
minimax problems
0 references
linear programming
0 references
nonlinear programming
0 references
polyhedral sets
0 references
0.7902702689170837
0 references
0.7640601396560669
0 references
0.7580654621124268
0 references
0.7542076706886292
0 references
0.731749951839447
0 references
