Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959)
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: Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions |
scientific article; zbMATH DE number 5073096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions |
scientific article; zbMATH DE number 5073096 |
Statements
Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (English)
0 references
15 November 2006
0 references
inventory
0 references
production
0 references
newsvendor problem
0 references
convex programming
0 references
constraint satisfaction
0 references
0 references
0.8413926959037781
0 references
0.8237694501876831
0 references
0.7989220023155212
0 references
0.7958819270133972
0 references
