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.
AMS 1980 Subject Classifications:
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 19, 1988 - Issue 5
![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Some Methods for Minimizing of d.c. Functions
Source:
Springer International Publishing
D.C. Optimization: Theory, Methods and Algorithms
Source:
Springer US
Linking provided by
