Generalized linear multiplicative and fractional programming (Q2277368): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with linear fractional functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the sum of a linear and linear-fractional function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515952 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02283691 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058469120 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Generalized linear multiplicative and fractional programming
scientific article

    Statements

    Generalized linear multiplicative and fractional programming (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The nonconvex problem of minimizing the sum of a convex function and the product of two linear functions over a polytope is shown to be solvable by a sequence of convex programming problems, by embedding the original n-dimensional problem into an \((n+1)\)-dimensional master problem and then applying a parametric programming approach.
    0 references
    global optimization
    0 references
    product of two linear functions
    0 references
    sequence of convex programming problems
    0 references
    parametric programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references