A modified version of Tuy's method for solving d.c. programing problem
From MaRDI portal
Publication:3813618
DOI10.1080/02331938808843381zbMATH Open0662.90069OpenAlexW2567978439MaRDI QIDQ3813618FDOQ3813618
Authors: Nguyen Van Thoai 
Publication date: 1988
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938808843381
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
Cited In (18)
- Title not available (Why is that?)
- DC programming: overview.
- A new necessary and sufficient global optimality condition for canonical DC problems
- Mathematical programs with a two-dimensional reverse convex constraint
- On solving a d.c. programming problem by a sequence of linear programs
- A finite algorithm for a particular D.C. quadratic programming problem
- Outer approximation algorithms for DC programs and beyond
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- On global optimality conditions and cutting plane algorithms
- Canonical DC programming problem: Outer approximation methods revisited
- Successive search methods for solving a canonical DC programming problem
- On an outer approximation concept in global optimization
- On global unconstrained minimization of the difference of polyhedral functions
- Outer approximation algorithms for canonical DC problems
- Computing a global optimal solution to a design centering problem
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
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)
