Reformulation of the modified goal programming for logarithmic piecewise linear function

Ching Ter Chang*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

Abstract

The purpose of this paper is to present a reformulation of the model presented by Chang [A modified goal programming model for piecewise linear function, European Journal of Operational Research 139 (2002) 62-67]. The modified goal programming (MGP) model of Chang has been accepted as an efficient method published for solving polynomial/posynomial (P/P) programming problems. However, it still cannot be used to fully practical applications because the problem with negative variable is undefined in logarithmic piecewise linear function (LPLF). This paper presents some appropriate strategies to overcome this undefined problem. The reformulation MGP model can be used to solve P/P programming problems with negative/positive variables. In addition, an illustrative example is included for demonstrating the correctness of the proposed method.

Original languageEnglish
Pages (from-to)13-23
Number of pages11
JournalApplied Mathematics and Computation
Volume174
Issue number1
DOIs
StatePublished - 01 03 2006
Externally publishedYes

Keywords

  • Goal programming
  • Piecewise linear function

Fingerprint

Dive into the research topics of 'Reformulation of the modified goal programming for logarithmic piecewise linear function'. Together they form a unique fingerprint.

Cite this