A new two-level linear relaxed bound method for geometric programming problems (Q1774846): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex multiplicative programming via quasiconcave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized linear multiplicative and fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for minimizing the product of several convex functions on a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite algorithm for generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversed geometric programming: A branch-and-bound method involving linear subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of indefinite quadratic programs to bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex polynomial programming problems having rational exponents / rank
 
Normal rank

Latest revision as of 10:59, 10 June 2024

scientific article
Language Label Description Also known as
English
A new two-level linear relaxed bound method for geometric programming problems
scientific article

    Statements

    A new two-level linear relaxed bound method for geometric programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Geometric programming
    0 references
    Algorithm
    0 references
    Global optimization
    0 references
    Linearization technique
    0 references
    Branch-and-bound method
    0 references
    Relaxed approximation
    0 references
    0 references