In the paper we present a new iterative method for solving multiobjective linear programming problems with an arbitrary number of decision makers. The method is based on the principles of game theory. Each step of the method yields a unique solution which respects the aspirations of decision makers within the frame of given possibilities. Each decision maker is assigned an objective indicator w...

In this paper, based on bifuzzy theory, we study the multiobjective programming problem under bifuzzy environment and present the expected value model to the problem. Furthermore, to the proposed model, the concepts of non-inferior solution are defined, and their relations are also discussed. According to practical decision-making process, a solution method, called the method of main objective ...

Most of the real-life decision-making problems have more than one conflicting and incommensurable objective functions. In this paper, we present a multiobjective two-stage stochastic linear programming problem considering some parameters of the linear constraints as interval type discrete random variables with known probability distribution. Randomness of the discrete intervals are considered f...

In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...

This paper deals with multiobjective optimization techniques for a class of hybrid optimal control problems in mechanical systems. We deal with general nonlinear hybrid control systems described by boundary-value problems associated with hybrid-type Euler-Lagrange or Hamilton equations. The variational structure of the corresponding solutions makes it possible to reduce the original “mechanical...

We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qu...

In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...

The paper considers the stochastic multiobjective allocation problem. An assumption is made that a particular resource should be allocated to T projects. The specified level of each goal (along with the known probabilities) can be obtained based on the amount of the resources allocated. We will propose an identification strategy procedure that the decision maker can implement. Our technique com...