A finite cutting plane method for solving linear programs with an additional reverse convex constraint
DOI10.1016/0377-2217(90)90250-FzbMATH Open0695.90082OpenAlexW1971867305MaRDI QIDQ910336FDOQ910336
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
Recommendations
nonconvex programmingset coveringlinear constraintsdisjunctive cutscomputational experienceadditional reverse convex constraintconvexity cutsfinite cutting plane method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- A fast approximation algorithm for the multicovering problem
- Disjunctive Programming
- Reverse convex programming
- Title not available (Why is that?)
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
- Title not available (Why is that?)
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Optimization with disjunctive constraints
- Complementary Geometric Programming
- Title not available (Why is that?)
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Quasi-concave minimization subject to linear constraints
- Polyhedral convexity cuts and negative edge extensions
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- The Generalized Lattice-Point Problem
- Convex programs with an additional reverse convex constraint
- Linear programs with an additional reverse convex constraint
- Title not available (Why is that?)
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- Convexity Cuts and Cut Search
- Theorems on the dimensions of convex sets
- Convex programs with several additional reverse convex constraints
- Title not available (Why is that?)
Cited In (13)
- DC programming: overview.
- A cutting plane algorithm for linear reverse convex programs
- A new necessary and sufficient global optimality condition for canonical DC problems
- Title not available (Why is that?)
- Beyond canonical dc-optimization: the single reverse polar problem
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- Canonical DC programming problem: Outer approximation methods revisited
- A finite algorithm for solving the generalized lattice point problem
- Title not available (Why is that?)
- Outer approximation algorithms for canonical DC problems
- On the use of cuts in reverse convex programs
- Intersection Disjunctions for Reverse Convex Sets
This page was built for publication: A finite cutting plane method for solving linear programs with an additional reverse convex constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910336)
