A modified version of Tuy's method for solving d.c. programing problem
From MaRDI portal
Publication:3813618
Recommendations
- An algorithm for solving general D. C. programming problems
- A modification of a method for a class of problems in integer programming
- A branch and bound algorithm for solving a class of D-C programming
- On solving a d.c. programming problem by a sequence of linear programs
- A modification of the dynamic programming method for the travelling-salesman problem
- Modified branch-and-bound method for solving a series of problems
- scientific article; zbMATH DE number 7267266
- Modification of the recursive solution procedure for a linear programming problem
- A modified algorithm for the strict feasibility problem
- Solving DC programs using the cutting angle method
Cites work
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On outer approximation methods for solving concave minimization problems
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(18)- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- scientific article; zbMATH DE number 4064775 (Why is no real title available?)
- Outer approximation algorithms for canonical DC problems
- On global optimality conditions and cutting plane algorithms
- DC programming: overview.
- Canonical DC programming problem: Outer approximation methods revisited
- Successive search methods for solving a canonical DC programming problem
- On solving a d.c. programming problem by a sequence of linear programs
- Outer approximation algorithms for DC programs and beyond
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- 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
- Computing a global optimal solution to a design centering problem
- On global unconstrained minimization of the difference of polyhedral functions
- Mathematical programs with a two-dimensional reverse convex constraint
- On an outer approximation concept in global optimization
- A finite algorithm for a particular D.C. quadratic programming problem
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
This page was built for publication: A modified version of Tuy's method for solving d.c. programing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813618)
