نتایج جستجو برای: multi period programming

تعداد نتایج: 1230598  

Journal: :journal of computer and robotics 0
ali molaali faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran mohammad jafar tarokh department of industrial engineering, k.n. toosi university of technology, tehran, iran

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

Journal: :International Journal of Parallel Programming 2016

Journal: :international journal of industrial engineering and productional research- 0
m karbasian industrial engineering department, malek ashtar university of technology, esfahan, iran m bashiri industrial engineering department, shahed university, tehran, iran m safaei production engineering department, university of bremen, germany

strategic programming, complex supply chain, lean, production programming, suppliers selection,   electre this paper represents a model of strategic programming with limited resources in a complex supply chain. the main goal of the proposed model is to increase efficiency and effectiveness of the supply chain with respect to income increases and cost decreases. using special objective functions...

Journal: :international journal of supply and operations management 2016
masoud rabbani mohammad-javad ramezankhani amir farshbaf-geranmayeh hamed farrokhi-asl

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

Journal: :journal of linear and topological algebra (jlta) 2015
saber saati n. nayebi

data envelopment analysis (dea) is a method to evaluate the relative efficiency of decision making units (dmus). in this method, the issue has always been to determine a set of weights for each dmu which often caused many problems. since the dea models also have the multi-objective linear programming (molp) problems nature, a rational relationship can be established between molp and dea problem...

Journal: :journal of industrial engineering, international 2011
s razavyan gh tohidi

this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...

Journal: :Fuzzy Sets and Systems 2014
Wei-Guo Zhang Yong-Jun Liu Weijun Xu

This paper considers a multi-period portfolio selection problem imposed by return demand and risk control in a fuzzy investment environment, in which the returns of assets are characterized by fuzzy numbers. A fuzzy lower semi-deviation is originally defined as the risk control of portfolio. A proportion entropy constraint is added as the divergence measure of portfolio. Based on the theories o...

2010
Alejandro Toriello George Nemhauser Martin Savelsbergh Daniel J. Epstein

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single-period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory’s value, and solving the multi-period problem as a ...

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

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید