Document Type

Post-Print

Publication Date

2018

Subjects

Mathematical optimization, Cluster analysis -- Algorithms, Smoothing (Statistics), Programming (Mathematics)

Abstract

This paper is a continuation of our effort in using mathematical optimization involving DC programming in clustering and multifacility location. We study a penalty method based on distance functions and apply it particularly to a number of problems in clustering and multifacility location in which the centers to be found must lie in some given set constraints. We also provide different numerical examples to test our method.

Description

This is the author’s version of a work that was accepted for publication in Optimization. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Optimization, 67:11, 1869-1894. Article is available inline at: 10.1080/02331934.2018.1510498

DOI

10.1080/02331934.2018.1510498

Persistent Identifier

https://archives.pdx.edu/ds/psu/28045

Available for download on Sunday, September 29, 2019

Included in

Mathematics Commons

Share

COinS