In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...

jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

‎we consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎we present a class of problems that are easily solved by reduction to the classi...

Linear Programming deals with the problem of optimizing a linear objective function subject to linear equality and inequality constraints on the decision variables. Linear programming has many practical applications (in transportation, production planning, ...). It is also the building block for combinatorial optimization. One aspect of linear programming which is often forgotten is the fact th...

In the today’s world wherein every routine is based on economic factors, there is no doubt that theoretical sciences are driven by their capabilities and affordances in terms of economy. As a mathematical tool, data envelopment analysis (DEA) is provided to economics, so that one can investigate associated costs, prices and revenues of economic units. Data Envelopment Analysis (DEA) is a linear...

a new retrofit targeting procedure, based on pinch technology has been developed. the new procedure considers existing structure of a given network and finds the most compatible configuration with the network. to achieve this aim, the procedure uses a linear programming technique that maximize the compatibility. good compatibility between old and new networks helps to make the best use of capit...

Given a 0-1 integer programming problem, several authors have introduced sequential relaxation techniques — based on linear and/or semidefinite programming — that generate the convex hull of integer points in at most n steps. In this paper, we introduce a sequential relaxation technique, which is based on p-order cone programming (1 ≤ p ≤ ∞). We prove that our technique generates the convex hul...

the planning of production and control of inventory problem is one of most important problems that companies are face with them. some times inattention to uncertainty in these problems causes to increase of costs of inventory control systems. one of the important ways encountering to uncertainty is the widespread of fuzzy sets instead of crisp numbers because in this approach, we can determine ...