In this paper, three criteria scheduling problem of n jobs on a single machine is considered. Each these to be processed without interruption and becomes available for processing at time zero. The minimize objectives simultaneously, which are the completion time, maximum tardiness, earliness. Here, we develop fuzzy multi-objective linear programming (FMOLP) model solving in environment by using...

convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

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...

data envelopment analysis (dea) is a nonparametric approach to estimate relative efficiency of decision making units (dmus). dea and is one of the best quantitative approach and balanced scorecard (bsc) is one of the best qualitative method to measure efficiency of an organization. since simultaneous evaluation of network performance of the quad areas of bsc model is considered as a necessity a...

In this article, an effective method to control a power system during emergency conditions is presented. Based on Fuzzy Linear Programming (FLP), a new technique is developed to solve the Load Shedding and Generation Reallocation (LSGR) optimization Problem. The objective function consists of terms of load curtailments and deviations in generation schedules. The constraints are power system var...

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...