On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
From MaRDI portal
Publication:1102872
DOI10.1016/0167-6377(88)90071-5zbMath0644.90085OpenAlexW2082736860MaRDI QIDQ1102872
Jakob de Vries, Nguyen Van Thoai, Reiner Horst
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90071-5
multiextremal optimizationredundant constraintscutting plane methodsall new verticessequentially generated polytopes
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items
An algorithm for solving general D. C. programming problems, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, D.c sets, d.c. functions and nonlinear equations, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Unnamed Item, A decomposition method for the min concave cost flow problem with a staircase structure, Decomposition approach for the global minimization of biconcave functions over polytopes, Canonical DC programming problem: Outer approximation methods revisited, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, An efficient solution method for rank two quasiconcave minimization problems, An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming, DC programming: overview., A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, On the minimization of a quasi-concave function subject to linear constraints, On-line and off-line vertex enumeration by adjacency lists, An algorithm for indefinite quadratic programming with convex constraints, An analytical approach to global optimization, A modified version of Tuy's method for solving d.c. programing problem, A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, The complementary convex structure in global optimization, Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization, Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, A global optimization approach for solving the convex multiplicative programming problem, Polyhedral annexation, dualization and dimension reduction technique in global optimization, An algorithm for solving convex programs with an additional convex- concave constraint, Bisecton by global optimization revisited, A global optimization approach for the linear two-level program, An exact solution method for reliability optimization in complex systems, Separable concave minimization via partial outer approximation and branch and bound, Convex minimization under Lipschitz constraints, An algorithm for a concave production cost network flow problem, Selected bibliography on degeneracy, A partial cooperation model for non-unique linear two-level decision problems, A quasiconcave minimization method for solving linear two-level programs, Concave minimization via conical partitions and polyhedral outer approximation
Cites Work
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- On an outer approximation concept in global optimization
- A method for globally minimizing concave functions over convex sets
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A Successive Underestimation Method for Concave Minimization Problems
