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

Abstract This paper presents an optimization method to solve a multi-objective model of bi-level linear programming problem with intuitionistic fuzzy coefficients. The idea is based on TOPSIS (technique for order preference by similarity ideal solution) method. multiple criteria that identifies satisfactory solution from given set alternatives the minimization distance point and maximization na...

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...

Portfolio selection is an important issue for researchers and practitioners. Compared with the conventional probabilistic mean-variance method, fuzzy number can better describe an uncertain environment with vagueness and ambiguity. In this paper, the portfolio selection model with transaction costs and lending is proposed by means of possibilistic mean and possibilistic variance under the assum...

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

one of the most fundamental components of healthcare system on each country is blood supply chain management. this chain is comprised of two significant components including collecting donor’ bloods and supplying blood’s products. the main purpose of this paper is to concentrate on supplying blood products and present a novel constrained bi-objective mathematical model for a two-echelon blood s...

This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively used in single objective multidimensional knapsack problems. The main idea of the core concept is based on the “divide and conquer” principle. Namely, instead of solving one problem with n variables we solve several sub-problems with a fraction of n variab...

In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with subset T?V of terminals. Arcs are labeled travel time and cost. The goal to find complete set efficient paths between every pair nodes in T. motivation behind stems from data preprocessing for vehicle routing problems. We propose solution method based labeling ap...