Location

Portland State University

Start Date

2-5-2018 11:00 AM

End Date

2-5-2018 1:00 PM

Subjects

Mathematical optimization -- Data processing, Cluster analysis, Smoothing (Numerical analysis)

Abstract

This 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 multi- facility location in which the centers to be found must lie in some given set constraints. We also provide numerical examples to test our method.

Description

Research of this author was supported by the Vietnam National Foundation for Science and Technology Development under grant #101.01-2017.325.

Persistent Identifier

http://archives.pdx.edu/ds/psu/25069

Share

COinS
 
May 2nd, 11:00 AM May 2nd, 1:00 PM

Clustering and Multifacility Location with Constraints via Distance Function Penalty Methods and DC Programming

Portland State University

This 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 multi- facility location in which the centers to be found must lie in some given set constraints. We also provide numerical examples to test our method.