Multi‐objective linear programming with interval coefficients
نویسندگان
چکیده
منابع مشابه
A Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملInverse linear programming with interval coefficients
The paper deals with the inverse linear programming problem over intervals. More precisely, given interval domains for the objective function coefficients and constraint coefficients of a linear program, we ask for which scenario a prescribed optimal value is attained. Using continuity of the optimal value function (under some assumptions), we propose a method based on parametric linear program...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملSolving Multiobjective Linear Programming Problem Using Interval Arithmetic
Abstract In the real world, we often encounter cases where the information / data items can’t be determined with certainty. Hence the value of the datum in the data is assessed using an interval. Meanwhile multiobjective linear programming model is more adequate to describe the problem in the real world. Thus, the multiobjective linear programming problem will be developed into a multiobjective...
متن کاملComplexity of necessary efficiency in interval linear programming and multiobjective linear programming
We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetes
سال: 2013
ISSN: 0368-492X
DOI: 10.1108/03684921311323707