A cutting plane algorithm for linear reverse convex programs
From MaRDI portal
Recommendations
Cited in
(13)- Cutting plane algorithms and approximate lower subdifferentiability
- Necessary and sufficient optimality conditions for reverse quasiconvex programs
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- scientific article; zbMATH DE number 4174658 (Why is no real title available?)
- scientific article; zbMATH DE number 1778406 (Why is no real title available?)
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- scientific article; zbMATH DE number 3943567 (Why is no real title available?)
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- On the redundancy of cutting planes for linear complementarity problems
- On the use of cuts in reverse convex programs
- A conical branch-and-bound algorithm for a class of reverse convex programs
- scientific article; zbMATH DE number 3984967 (Why is no real title available?)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
This page was built for publication: A cutting plane algorithm for linear reverse convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959333)