PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

Jeffrey L. Arthur, A. Ravindran

Research output: Contribution to journalArticlepeer-review

39 Scopus citations

Abstract

An algorithm Is presented for solving the hnear goal programming problem It is shown how the ordmal priomty factors m the goal programmmg objective function can be used to partmon the goal constraints of the problem, allowing a sequence of smaller subproblems to be solved in order to fred a solution to the original problem. Also discussed is the additional efficiency of the algorithm achieved by the use of variable elnninatmn and special terminatmn rules. Prehminary computatmnal results demonstrate the efficiency of the new algorithm.

Original languageEnglish (US)
Pages (from-to)378-386
Number of pages9
JournalACM Transactions on Mathematical Software (TOMS)
Volume6
Issue number3
DOIs
StatePublished - Sep 1 1980

All Science Journal Classification (ASJC) codes

  • Software
  • Applied Mathematics

Fingerprint Dive into the research topics of 'PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems'. Together they form a unique fingerprint.

Cite this