A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

Author： Benson H.P. Sun E.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.139, Iss.1, 2002-05, pp. : 26-41

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimization over the efficient set of a parametric multiple objective linear programming problem

By Tu T.V.

European Journal of Operational Research, Vol. 122, Iss. 3, 2000-05 ,pp. : 570-583

Elsevier

Access to resources Recommend Favorite

A reduction algorithm for integer multiple objective linear programs

By Schweigert D. Neumayer P.

European Journal of Operational Research, Vol. 99, Iss. 2, 1997-06 ,pp. : 459-462

Elsevier

Access to resources Recommend Favorite

Multi Objective Path Finding Based on Adding-Weight A* Algorithm

Advanced Materials Research, Vol. 2014, Iss. 1079, 2015-02 ,pp. : 711-715

Trans Tech Publications

Access to resources Recommend Favorite

A branch and bound algorithm for mixed zero-one multiple objective linear programming

By Mavrotas G. Diakoulaki D.

European Journal of Operational Research, Vol. 107, Iss. 3, 1998-06 ,pp. : 530-541

Elsevier

Access to resources Recommend Favorite

A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs

By Dauer J.P. Gallagher R.J.

European Journal of Operational Research, Vol. 88, Iss. 2, 1996-01 ,pp. : 368-381

Elsevier

Access to resources Recommend Favorite