Solving multiple objective quasi-convex goal programming problems by linear programming

Han-Lin Li, C. S. Yu

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi-convex linear penalty functions. The proposed method initially expresses a quasi-convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero-one variables; nor does it require dividing the multi-objective quasi-convex GP problem into large sub-problems as in conventional methods. Some illustrative examples are provided.

Original languageEnglish
Pages (from-to)265-284
Number of pages20
JournalInternational Transactions in Operational Research
Volume7
Issue number3
DOIs
StatePublished - 1 Jan 2000

Keywords

  • Multi-objective programming
  • Quasi-convex
  • Separable linear function

Fingerprint Dive into the research topics of 'Solving multiple objective quasi-convex goal programming problems by linear programming'. Together they form a unique fingerprint.

  • Cite this