An efficient algorithm for solving convex-convex quadratic fractional programs (Q946299): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-007-9188-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080740821 / rank
 
Normal rank

Revision as of 02:15, 20 March 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for solving convex-convex quadratic fractional programs
scientific article

    Statements

    An efficient algorithm for solving convex-convex quadratic fractional programs (English)
    0 references
    0 references
    0 references
    23 September 2008
    0 references
    0 references
    nonlinear fractional programs
    0 references
    global optimization
    0 references
    dinkelbach method
    0 references
    nonconvex quadratic programming problems
    0 references
    integer programming
    0 references
    local search algorithms
    0 references
    portfolio analysis
    0 references
    0 references