Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

we present a new model and a new approach for solving fuzzylinear programming (flp) problems with various utilities for the satisfactionof the fuzzy constraints. the model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (dm), andallows for the assignment of distinct weights to the constraints and the objectivefunction. the desired solutio...

Multiplicative programming problems (MPPs) are global optimisation problems known to be NP-hard. In this paper, we employ algorithms developed to compute the entire set of nondominated points of multi-objective linear programming (MOLP) problems to solve linear MPPs. First, we improve our own objective space cut and bound algorithm for convex MPPs in the special case of linear MPPs by only solv...

In this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. For finding the efficient points in purposed MOLP problem, some various methods like Lexicography & the weighted sum can be used. So by introducing the MOLP problem the cost & income efficiencies will be achieved. In the present study, the MOLP problem is conve...

in this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. for finding the efficient points in purposed molp problem, some various methods like lexicography & the weighted sum can be used. so by introducing the molp problem the cost & income efficiencies will be achieved. in the present study, the molp problem ...

In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...

Classic linear assignment method is a multi-criteria decision-making approach in which criteria are weighted and each rank assigned to choice. In this study, abandon the requirement of calculating weight use decision attributes prioritizing also be able assign more than one choice, multi-objective programming (MOLP) suggested. The objective function MOLP defined for attribute solved based on ab...

in this paper, using the value efficiency in dea pattern by taking decisive obtain. generally, non-radial model of ve and use proper weight to reduce input and output gain are the appropriate pattern. this paper introduces a multi-objective linear programming problem and efficiency determines the value of inefficient units. use interactive methods to solve molp proposed and applied. in conclusi...

The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear programming (MOLP) problem whose objective is to simultaneously minimize cost and maximize profit in a supply chain where cost and profit coefficients, and related parameters such as av...