A method for solving a discrete optimization problem with polynomially tabular functions (Q1395338)
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: A method for solving a discrete optimization problem with polynomially tabular functions |
scientific article; zbMATH DE number 1940696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for solving a discrete optimization problem with polynomially tabular functions |
scientific article; zbMATH DE number 1940696 |
Statements
A method for solving a discrete optimization problem with polynomially tabular functions (English)
0 references
1 July 2003
0 references
The paper is concerned with a method for solving a discrete optimization problem in which all functions are multidimensional polynomials of random tables. In this method, each function is represented as a difference of two monotone nondecreasing functions. The method is validated by solving a practical problem of discrete optimization of a complex object.
0 references
discrete optimization problem
0 references
polynomials
0 references
goal function
0 references
constraints
0 references
