Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints (Q358101)
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: Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints |
scientific article; zbMATH DE number 6198530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints |
scientific article; zbMATH DE number 6198530 |
Statements
Separable programming/duality approach to solving the multi-product Newsboy/Gardener problem with linear constraints (English)
0 references
15 August 2013
0 references
inventory control
0 references
mathematical programming
0 references
Newsboy Problem
0 references
0.7483901977539062
0 references
0.7398738861083984
0 references
0.7208640575408936
0 references
