A new linearization method for generalized linear multiplicative programming (Q622153): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2010.10.016 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Generalized concavity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mean-absolute deviation-skewness portfolio optimization model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome-space finite algorithm for solving linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image space analysis of generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method for a class of multiplicative programming with exponent / 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 new accelerating method for globally solving a class of nonconvex programming problems / 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: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some representation theorems for functions and sets and their application to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering method for d.c. optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding GM-estimators with global optimization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm based on DC programming and DCA for clustering / 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: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the convex multiplicative programming problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2010.10.016 / rank
 
Normal rank

Latest revision as of 22:31, 9 December 2024

scientific article
Language Label Description Also known as
English
A new linearization method for generalized linear multiplicative programming
scientific article

    Statements

    A new linearization method for generalized linear multiplicative programming (English)
    0 references
    31 January 2011
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers