On solving linear programs with the ordered weighted averaging objective

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.148, Iss.1, 2003-07, pp. : 80-91

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

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

A heuristic to minimax absolute regret for linear programs with interval objective function coefficients

By Mausser H.E. Laguna M.

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 157-174

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

An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

By Joseph A. Gass S.I. Bryson N.

European Journal of Operational Research, Vol. 104, Iss. 3, 1998-02 ,pp. : 601-614

Elsevier

Access to resources Recommend Favorite

Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory

By Fromen B.

European Journal of Operational Research, Vol. 98, Iss. 3, 1997-05 ,pp. : 626-636

Elsevier

Access to resources Recommend Favorite