An approximate approach for fractional programming with absolute-value functions (Q1763230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2136135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate approach for fractional programming with absolute-value functions |
scientific article; zbMATH DE number 2136135 |
Statements
An approximate approach for fractional programming with absolute-value functions (English)
0 references
22 February 2005
0 references
Consider the fractional programming problem with absolute-value functions. The author proposes an approximate approach by converting the problem into an equivalent non-linear quadratic mixed integer programming problem with absolute value. Then the model is linearized using piecewise logarithmic program. The program is finally solved using the branch and bound method.
0 references
fractional programming
0 references
linearization
0 references
goal programming
0 references
absolute-value functions
0 references
quadratic programming
0 references
integer programming
0 references
branch and bound method
0 references
0.8566493988037109
0 references
0.8160987496376038
0 references
0.8120169043540955
0 references
0.7832195162773132
0 references
