A Maximum Achievement Model for a Interdependent Multi-location Investment Problem Using Goal Programming and Piecewise - Linear Approximation
Authors
Cheng-Chang Chang 0, Chung Yung 1, Wang 2
Corresponding Author
Cheng-Chang Chang
0Graduate School of Decision Science, National Defense Management College, National Defense
1Graduate School of Decision Science, National Defense Management College, National Defense
2Graduate School of Decision Science, National Defense Management College, National Defense
Available Online October 2006.
- DOI
- https://doi.org/10.2991/jcis_2006.342How to use a DOI?
- Keywords
- multi-location investment, goal programming, piecewise-linear
- Abstract
- Consider an enterprise that wants to expand its business to multiple cities in global and to be one of well-known multinational enterprises (MNEs). Suppose the MNE hopes each planning investment subsidiary gleans a specific target return within a constant time horizon. Under this premise, this paper proposes two optimization models to find the optimal allocation policy of capital investment, which maximize the degree of realization of the MNE’s concerned objective. Due to the nonlinear characteristics of the proposed models, a solution procedure developed upon the piecewise-linear approximation and goal programming techniques is used for resolving the models.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Cheng-Chang Chang AU - Chung Yung AU - Wang PY - 2006/10 DA - 2006/10 TI - A Maximum Achievement Model for a Interdependent Multi-location Investment Problem Using Goal Programming and Piecewise - Linear Approximation PB - Atlantis Press SN - 1951-6851 UR - https://doi.org/10.2991/jcis_2006.342 DO - https://doi.org/10.2991/jcis_2006.342 ID - Chang2006/10 ER -