An effective linear approximation method for separable programming problems (Q1036545)
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: An effective linear approximation method for separable programming problems |
scientific article; zbMATH DE number 5632596
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective linear approximation method for separable programming problems |
scientific article; zbMATH DE number 5632596 |
Statements
An effective linear approximation method for separable programming problems (English)
0 references
13 November 2009
0 references
The author introduces a piecewise linearization method to solve separable programs. Here, instead of the usual \(m\) binary variables, \(\lceil \log_2(m-1) \rceil\) variables are used to linearize the concave functions. This is of interest for decreasing the runtime of the optimization procedure for big problems with large \(m\). Examples are given that are solved numerically to accentuate the improvements achieved with the method.
0 references
separable programming
0 references
piecewise linearization
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
