On the use of cuts in reverse convex programs

DOI10.1007/BF00941567zbMath0699.90085MaRDI QIDQ913668

T. R. Gurlitz, Stephen E. Jacobsen

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

nonconvex programmingcutting methodvertex enumerationreverse convex programsexamples of nonconvergenceTuy cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Intersection Disjunctions for Reverse Convex Sets, Global optimization and multi knapsack: a percolation algorithm., On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Computational experience using an edge search algorithm for linear reverse convex programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex programs with an additional reverse convex constraint
• Convex programs with several additional reverse convex constraints
• The design centering problem as a d.c. programming problem
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• Methods for Global Concave Minimization: A Bibliographic Survey
• Complementary Geometric Programming
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• An algorithm for determining all extreme points of a convex polytope
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems