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

Author： Inuiguchi M.   Sakawa M.  

Publisher： Elsevier

ISSN： 0377-2217

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

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 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

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 note on programming problems with linear-plus-linear-fractional objective functions

By Hirche J.  

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 212-214

Elsevier

Access to resources Recommend Favorite

KKT transformation approach for multi-objective multi-level linear programming problems

By Sinha S.   Sinha S.B.  

European Journal of Operational Research, Vol. 143, Iss. 1, 2002-11 ,pp. : 19-31

Elsevier

Access to resources Recommend Favorite

An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function

By Crema A.  

European Journal of Operational Research, Vol. 125, Iss. 1, 2000-08 ,pp. : 18-24

Elsevier

Access to resources Recommend Favorite