Uncertain Multiobjective Programming and Uncertain Goal Programming
نویسندگان
چکیده
منابع مشابه
Efficient Solutions for Uncertain Random Multiobjective Programming Problem
Based on the chance theory, which is founded for modeling complex systems with not only uncertainty but also randomness, this paper is devoted to studying a new kind of multiobjective programming problem where randomness and uncertainty exist simultaneously, called uncertain random multiobjective programming (URMOP) problem. Since an uncertain random variable does not admit an order relationshi...
متن کاملUncertain goal programming models for bicriteria solid transportation problem
This paper investigates an uncertain bicriteria solid transportation problem. The supplies, demands, conveyance capacities, transportation cost and transportation time are regarded as uncertain variables. According to two types of methods to rank the uncertain variables, expected value goal programming model and chance-constrained goal programming model for the bicriteria solid transportation p...
متن کاملAn uncertain goal programming model for machine scheduling problem
Machine scheduling is to assign a group of jobs to a set of machines in an efficient strategy, such that some objectives such as minimizing the makespan time are satisfied under some constraints. Considering the human uncertainty in operations, this paper assumes the processing times of the jobs are uncertain variables, and proposes an uncertain goal programming model for the machine scheduling...
متن کاملUncertain random programming with applications
Uncertain random variable is a tool to deal with a mixture of uncertainty and randomness. This paper presents an operational law of uncertain random variables, and shows an expected value formula by using probability and uncertainty distributions. This paper also provides a framework of uncertain random programming that is a type of mathematical programming involving uncertain random variables....
متن کاملA goal programming approach for multiobjective linear bilevel programming problems
ABSTRACT: Feasible solutions of Bilevel programming (BLP) problem have to satisfy the optimality conditions of a lower level optimization problem which is defined as part of its constraints. Multiobjective BLP (MOBLP) problems are the special case of BLP problems with multiple objectives at the upper level which require every feasible solution to satisfy the Pareto optimality conditions of a lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Uncertainty Analysis and Applications
سال: 2015
ISSN: 2195-5468
DOI: 10.1186/s40467-015-0036-6