نتایج جستجو برای: inerval biobjective linear programming problem

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

Journal: :Gazi university journal of science 2022

As we are faced with more uncertainty problems in the real world, it is necessary to ‎provide ‎models that can provide appropriate solutions for dealing these issues. In this ‎study, ‎ proposed a new approach solving linear programming problem fuzzy ‎environment ‎based on ‎a related multi-objective model. This kind of be ‎reduced ‎fuzzy semi-infinite problem. way, present ‎mixed ‎Multi-Objectiv...

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

Journal: :international journal of industrial mathematics 2015
sh. razavyan

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

2015
Lucie Galand Thibaut Lust

This paper deals with biobjective combinatorial optimization problems where both objectives are required to be well-balanced. Lorenz dominance is a refinement of the Pareto dominance that has been proposed in economics to measure the inequalities in income distributions. We consider in this work the problem of computing the Lorenz optimal solutions to combinatorial optimization problems where s...

2014
Carolina Lagos Broderick Crawford Enrique Cabrera Ricardo Soto José-Miguel Rubio Fernando Paredes

Evolutionary algorithms have been widely used to solve large and complex optimisation problems. Cultural algorithms (CAs) are evolutionary algorithms that have been used to solve both single and, to a less extent, multiobjective optimisation problems. In order to solve these optimisation problems, CAs make use of different strategies such as normative knowledge, historical knowledge, circumstan...

G.R. Jahanshahloo M.R Mozaffari Z. Sobhan,

In this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. For finding the efficient points in purposed MOLP problem, some various methods like Lexicography & the weighted sum can be used. So by introducing the MOLP problem the cost & income efficiencies will be achieved. In the present study, the MOLP problem is conve...

Journal: :IEEE Transactions on Geoscience and Remote Sensing 2016

In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...

Journal: :journal of optimization in industrial engineering 0
arghavan sharafi department of industrial engineering, faculty of engineering shahed university, tehran, iran mahdi bashiri ie department, shahed university, qom highway, tehran

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...

Journal: :journal of industrial engineering, international 2009
a.r rashidi komijan b aryanezhad a makui

product mix problem (pmp) is one of the most important and complicated problems in production systems. different approaches have been applied to solve this problem, among them, theory of constraints (toc) has been widely considered since 1990s. this paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. at first, t...

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

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