A method for solving reverse convex programming problems
From MaRDI portal
Recommendations
- Methods for solving some classes of reverse convex programs
- A branch-and-bound method for a reverse convex programming problem
- Reverse convex problems: an approach based on optimality conditions
- Publication:4019864
- Inner approximation method for a reverse convex programming problem
- Decomposition algorithm for reverse convex programs
- A nonisolated optimal solution for special reverse convex programming problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Comments on a reverse convex programming algorithm
- An approximate method for solving the convex programming problem
Cited in
(15)- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- scientific article; zbMATH DE number 5989987 (Why is no real title available?)
- Outer approximation algorithms for canonical DC problems
- Inner approximation method for a reverse convex programming problem
- A nonisolated optimal solution for special reverse convex programming problems
- Methods for solving some classes of reverse convex programs
- A forward convex-simplex method
- Letter to the editor: Remarks on an algorithm for reverse convex programs
- Beyond canonical dc-optimization: the single reverse polar problem
- scientific article; zbMATH DE number 5666849 (Why is no real title available?)
- Construction of test problems for a class of reverse convex programs
- A new necessary and sufficient global optimality condition for canonical DC problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Decomposition algorithm for reverse convex programs
- Feasibility in reverse convex mixed-integer programming
This page was built for publication: A method for solving reverse convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091943)