A new method is proposed to find an optimal intuitionistic fuzzy solution to fully intuitionistic fuzzy linear fractional programming (IFLFP) problem, in which ranking functions are not used. Here, the IFLFP problem is transformed into an equivalent crisp linear fractional programming problem which is then solved by linear programming (LP) technique and / or linear fractional programming techni...

This article addresses a special class of non-linear programming problems, viz., linear fractional problems having multiple objectives. In solving the real-life optimization ambiguity and hesitation in decision are inherent ever-present, therefore, it is perfectly viable to formulate solve these models using intuitionistic fuzzy environment. The purpose this study propose simple computationally...

Structural redundancies in mathematical programming models are nothing uncommon and nonlinear programming problems are no exception. Over the past few decades numerous papers have been written on redundancy. Redundancy in constraints and variables are usually studied in a class of mathematical programming problems. However, main emphasis has so far been given only to linear programming problems...

The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...

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

This paper deals with linear fractional bilevel programming problem. The goals of objective functions are determined by optimizing individual objective function subject to the system constraints. Then the fractional objective functions are transformed into equivalent linear functions at the optimal solution point by using first order Taylor polynomial series. Since the objectives of the decisio...

In an earlier work [Pop and Stancu Minasian, 2008], we proposed a method of solving the fully fuzzified linear fractional programming (FFLFP) problem. In this paper, we propose another method of solving the FFLFP problem. First, analogically using the Charnes-Cooper method, we transform the linear fractional programming problem into a linear one. Next, problem of maximizing a function with tria...

We derive conditions on the functions ', , v and w such that the 0–1 fractional programming problem max x2f0I1gn 'ıv.x/ ıw.x/ can be solved in polynomial time by enumerating the breakpoints of the piecewise linear functionˆ. / D max x2f0I1gn v.x/ w.x/ on Œ0IC1/. In particular we show that when ' is convex and increasing, is concave, increasing and strictly positive, v and w are supermodular and...