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

Han-Lin Li, C. S. Yu

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)265-284
頁數20
期刊International Transactions in Operational Research
7
發行號3
DOIs
出版狀態Published - 5月 2000

指紋

深入研究「Solving multiple objective quasi-convex goal programming problems by linear programming」主題。共同形成了獨特的指紋。

引用此