Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60944138, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Digital Circuit Optimization via Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programming Models for Environmental Quality Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of acceleration for a class of multiplicative programming problems with exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-reduction-bound algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming: Methods, Computations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Weighted Mean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable branch and bound algorithm for sum of linear ratios problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization for sum of linear ratios problem with coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to globally solve the sum of several linear ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for globally solving a class of nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified monotonic approach to generalized linear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design of a membrane separation process using signomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming using linear relaxation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chapter 7: The specialized MINLP approach / rank
 
Normal rank

Latest revision as of 13:53, 27 July 2024

scientific article
Language Label Description Also known as
English
Inner approximation algorithm for generalized linear multiplicative programming problems
scientific article

    Statements

    Inner approximation algorithm for generalized linear multiplicative programming problems (English)
    0 references
    0 references
    0 references
    15 December 2021
    0 references
    generalized multiplicative programming
    0 references
    inner approximation algorithm
    0 references
    geometric programming
    0 references

    Identifiers

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