Generalizations of the well-known simplex method for linear programming are available to solve the piecewise linear programming problem and the linear fractional programming problem. In this paper we consider a further generalization of the simplex method to solve piecewise linear fractional programming problems unifying the simplex method for linear programs, piecewise linear programs, and the...

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

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

In this paper, two approaches were introduced to obtain Stackelberg solutions for two-level linear fractional programming problems with interval coefficients in the objective functions. The approaches were based on the Kth best method and the method for solving linear fractional programming problems with interval coefficients in the objective function. In the first approach, linear fractional p...

This paper presents a dual of a general linear fractional functions programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.

The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We propo...

In this note we consider a linear-fractional programming problem with equality linear constraints. Following Rohn, we define a generalized relative sensitivity coefficient measuring the sensitivity of the optimal value for a linear program and a linear-fractional minimization problem with respect to the perturbations in the problem data. By using an extension of Rohn’s result for the linear pro...

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.  For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...

Traditional Data Envelopment Analysis (DEA) models evaluate the efficiency of decision making units (DMUs) with common crisp input and output data. However, the data in real applications are often imprecise or ambiguous. This paper transforms fuzzy fractional DEA model constructed using fuzzy arithmetic, into the conventional crisp model. This transformation is performed considering the goal pr...