Goal programming duality revisited: Formulation of a set of variant duals
本文为加权、切比雪夫、扩展和扩展网络目标规划模型构建了对偶问题，通过分析对偶揭示多目标间的相互作用，并展示对偶序列与原问题序列的对应关系。
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.