Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (Q3892089): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a cutting plane method for solving concave minimization problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Nonconvex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Path Problems with Concave Cost-Time Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Facility Location with Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave minimization over a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Maximization of a Convex Function with Linear Inequality Constraints / rank
 
Normal rank

Latest revision as of 10:45, 13 June 2024

scientific article
Language Label Description Also known as
English
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
scientific article

    Statements

    Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    resource allocation problems
    0 references
    nonconvex programming
    0 references
    surrogate duality
    0 references
    economics of scale
    0 references
    linearly constrained optimization problems
    0 references
    surrogate dual problem
    0 references
    economic interpretation
    0 references
    computation of lower bounds
    0 references
    explicity quasi-concave lower semicontinuous isotone cost function
    0 references
    branch-and-bound algorithm
    0 references