Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming (Q1111468)
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: Publication:1111468 |
scientific article; zbMATH DE number 4074813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming |
scientific article; zbMATH DE number 4074813 |
Statements
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming (English)
0 references
1988
0 references
This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.
0 references
nonlinear integer programming
0 references
0.7752426266670227
0 references
0.7629548907279968
0 references
0.7623250484466553
0 references
