Skip to main navigation Skip to search Skip to main content

Nonlinear goal programming with -ni, -pi and -(n i+pi) goals

  • Zhiyong Zhang
  • , Shanlin Yang
  • , Xinbao Liu
  • , Jen S. Shang
  • , Jianbo Yang
  • Hefei University of Technology
  • Beijing Wuzi University
  • University of Pittsburgh
  • University of Manchester

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

The (minimizing) achievement function of the traditional Goal Programming (GP) model has five basic forms: ni, pi, (n i+pi), (n1-pi), and (p i-ni), where ni and pi are nonnegative under and over achievement variables in the ith goal-constraint. Zhang and Shang (2001) proposed the theory of Goal Programs with -ni, -pi, and -(ni+pi) goals, which has many interesting and practical applications. This paper extends the theory further into the nonlinear situation and proposes a new algorithm for solving the ensuing nonconvex nonlinear program. Results obtained in this paper shows that the basic conclusions for the linear GP model still hold for the nonlinear case.

Original languageEnglish
Title of host publicationIE and EM 2009 - Proceedings 2009 IEEE 16th International Conference on Industrial Engineering and Engineering Management
Pages894-898
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE 16th International Conference on Industrial Engineering and Engineering Management, IE and EM 2009 - Beijing, China
Duration: 21 Oct 2009 → 23 Oct 2009

Publication series

NameIE and EM 2009 - Proceedings 2009 IEEE 16th International Conference on Industrial Engineering and Engineering Management

Conference

Conference2009 IEEE 16th International Conference on Industrial Engineering and Engineering Management, IE and EM 2009
Country/TerritoryChina
CityBeijing
Period21/10/09 → 23/10/09

Keywords

  • Multiobjective algorithm
  • Nonconvex goal programming
  • Nonlinear goal programming

Fingerprint

Dive into the research topics of 'Nonlinear goal programming with -ni, -pi and -(n i+pi) goals'. Together they form a unique fingerprint.

Cite this