An approximate approach for fractional programming with absolute-value functions (Q1763230): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—“Linear” Programming with Absolute-Value Functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming with absolute-value functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—Linear Fractional Functionals Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polynomial mixed 0-1 fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the posynomial fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global approach for general \(0-1\) fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a global approach for general 0-1 fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fifth bibliography of fractional programming<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified goal programming model for piecewise linear functions / rank
 
Normal rank

Latest revision as of 18:20, 7 June 2024

scientific article
Language Label Description Also known as
English
An approximate approach for fractional programming with absolute-value functions
scientific article

    Statements

    An approximate approach for fractional programming with absolute-value functions (English)
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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 references
    0 references
    0 references