A finite cutting plane method for solving linear programs with an additional reverse convex constraint
From MaRDI portal
(Redirected from Publication:910336)
Recommendations
Cites work
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- scientific article; zbMATH DE number 4011808 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3350057 (Why is no real title available?)
- scientific article; zbMATH DE number 3422216 (Why is no real title available?)
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A fast approximation algorithm for the multicovering problem
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- Complementary Geometric Programming
- Convex programs with an additional reverse convex constraint
- Convex programs with several additional reverse convex constraints
- Convexity Cuts and Cut Search
- Disjunctive Programming
- Iterative Solution of Nonlinear Optimal Control Problems
- Linear programs with an additional reverse convex constraint
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Optimization with disjunctive constraints
- Polyhedral convexity cuts and negative edge extensions
- Quasi-concave minimization subject to linear constraints
- Reverse convex programming
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- The Generalized Lattice-Point Problem
- The Validity of a Family of Optimization Methods
- Theorems on the dimensions of convex sets
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
- scientific article; zbMATH DE number 4174658 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3943567 (Why is no real title available?)
- 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)
