On the use of cuts in reverse convex programs

DOI10.1007/BF00941567zbMath0699.90085MaRDI QIDQ913668

Stephen E. Jacobsen, T. R. Gurlitz

Publication date: 1991

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

zbMATH Keywords

nonconvex programming; cutting method; vertex enumeration; reverse convex programs; examples of nonconvergence; Tuy cuts

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Global optimization and multi knapsack: a percolation algorithm., 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