ABSTRACT The phenomenon consisting in all the feasible region of a multiple objective linear programming problem being weakly efficient, may be less unlikely than has been believed, particularly for problems whose feasible regions have no interior. To deal with such possibility of complete weak efficiency, we would want to have at our disposal proficient methods to check this situation. So, in ...

This paper gives a brief introduction into multiple objective linear programming and discusses its possibilities in the area of forest management. We overview basic concepts, formulations, and principles of solving multiple objective linear programming problems. As such problems s always require the intervention of a decision-maker behavioral aspectsare also considered. We use an application by...

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multiple objective linear program is by one higher than the dimension of the projected polyhedron. The r...

this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...

In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...

i This paper describes a solution technique mr Linear Programming problems with multiple objective functions. In this type of problem it is often necessary to replace the concept of "optimgm" with that of "best compromise". In contrast with methods dealing with a priori weighted sums of the objective functions, the method described here involves a sequential exploration of solutions. This explo...