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

Author： Mausser H.E.   Laguna M.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

Minimax regret solution to linear programming problems with an interval objective function

By Inuiguchi M.   Sakawa M.  

European Journal of Operational Research, Vol. 86, Iss. 3, 1995-11 ,pp. : 526-536

Elsevier

Access to resources Recommend Favorite

On solving linear programs with the ordered weighted averaging objective

By Ogryczak W.   Sliwinski T.  

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

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

On computing objective function values in multiple objective quadratic-linear programming

By Korhonen P.   Yu G.Y.  

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 184-190

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