A modified version of Tuy's method for solving d.c. programing problem

1 January 1988

journal article
research article
Published by Taylor & Francis in Optimization

Vol. 19 (5) , 665-674
https://doi.org/10.1080/02331938808843381

Abstract

We present a modified version of Tuy's method for solving d.c. programming problems described in canonical form and some results of computational experiments.

Keywords

PRIMARY: 90 C 30
SECONDARY: 65 K 05
D.C.PROGRAMMING PROBLEM
CANONICAL FORM
CUTTING METHOD

This publication has 3 references indexed in Scilit:

On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
Operations Research Letters, 1988
Minimization Methods for Non-Differentiable Functions
Published by Springer Nature ,1985
The Cutting-Plane Method for Solving Convex Programs
Journal of the Society for Industrial and Applied Mathematics, 1960