Goal programming duality revisited: Formulation of a set of variant duals

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The formulation of the duals of the original goal programming variants took place in the decades following its introduction, principally for computational purposes. However the development of more recent Goal Programming variants has not been matched by the formulation and analysis of their associated duals. This paper furthers the topic of goal programming duality by formulating the duals of a progressive sequence of up to the most recent Goal Programming models: Weighted, Chebyshev, Extended and Extended Network Goal Programming models. It interprets the results and shows the insights that the duals can provide, principally by providing an understanding of the interactions between the multiple objectives in each case. The paper concludes with a comparison of the results and shows how the sequence of duals mirrors the sequence of the associated primals.

Cite

CITATION STYLE

APA

Merchant, J., & Jones, D. F. (2023). Goal programming duality revisited: Formulation of a set of variant duals. Journal of the Operational Research Society, 74(11), 2350–2361. https://doi.org/10.1080/01605682.2022.2147031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free