Deterministic algorithms for constrained concave minimization: A unified critical survey

DOI10.1002/(SICI)1520-6750(199609)43:6%3C765::AID-NAV1%3E3.0.CO;2-2MaRDI QIDQ4715980zbMATH OpenOpenAlexFDO

Authors Harold P. Benson

Publication date 11 March 1997

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199609)43:6%3C765::aid-nav1%3E3.0.co;2-2

zbMATH Keywords

branch-and-boundconcavity cut reductionconstrained concave minimizationenumerationextreme point rankingouter approximationsuccessive approximationsuccessive partitioningsurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 757675
• Concave minimization via conical partitions and polyhedral outer approximation
• On the global minimization of concave functions
• Normal conical algorithm for concave minimization over polytopes

Cited in

(25)

• Multiplicative programming problems: Analysis and efficient point search heuristic
• An exact solution method for reliability optimization in complex systems
• On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
• Generalized \(\gamma\)-valid cut procedure for concave minimization
• Fair transfer price and inventory holding policies in two-enterprise supply chains
• An algebra-based approach for linearly constrained concave minimization
• Some results on augmented Lagrangians in constrained global optimization via image space analysis
• Solving sum of ratios fractional programs via concave minimization
• A branch-and-bound based method for solving monotone optimization problems
• Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
• Joint economic production allocation and ordering policies in a supply chain consisting of multiple plants and a single retailer
• A class of convexification and concavification methods for non-monotone optimization problems
• The profit maximization problem in economies of scale
• scientific article; zbMATH DE number 757675 (Why is no real title available?)
• An Optimal Algorithm for Constrained Differentiable Convex Optimization
• A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS
• Production allocation and shipment policies in a multiple-manufacturer–single-retailer supply chain
• Convexification and concavification for a general class of global optimization problems
• Global optimization algorithm for the nonlinear sum of ratios problem
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
• Convexification for a class of global optimization problems with \(C^{1, 1}\) functions
• On the global optimization of sums of linear fractional functions over a convex set
• A filled function method for constrained global optimization
• Global maximization of a generalized concave multiplicative function
• Convexification of nonsmooth monotone functions

This page was built for publication: Deterministic algorithms for constrained concave minimization: A unified critical survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715980)