A finite cutting plane method for solving linear programs with an additional reverse convex constraint
From MaRDI portal
Publication:910336
DOI10.1016/0377-2217(90)90250-FzbMath0695.90082OpenAlexW1971867305MaRDI QIDQ910336
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90250-f
nonconvex programminglinear constraintsset coveringcomputational experiencedisjunctive cutsadditional reverse convex constraintconvexity cutsfinite cutting plane method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05)
Related Items
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Intersection Disjunctions for Reverse Convex Sets, Canonical DC programming problem: Outer approximation methods revisited, Beyond canonical dc-optimization: the single reverse polar problem, A new necessary and sufficient global optimality condition for canonical DC problems, DC programming: overview., A finite algorithm for solving the generalized lattice point problem, Outer approximation algorithms for canonical DC problems, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex programs with an additional reverse convex constraint
- A fast approximation algorithm for the multicovering problem
- Convex programs with several additional reverse convex constraints
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- Linear programs with an additional reverse convex constraint
- Optimization with disjunctive constraints
- Reverse convex programming
- Quasi-concave minimization subject to linear constraints
- Theorems on the dimensions of convex sets
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Complementary Geometric Programming
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Disjunctive Programming
- Polyhedral convexity cuts and negative edge extensions
- The Generalized Lattice-Point Problem
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
- Convexity Cuts and Cut Search
