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

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

Ghasem Tohidi Shabnam Razavyan

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

Journal: :Communications on Pure and Applied Mathematics 2013

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...

Journal: :iranian journal of optimization 2010
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 ...

Journal: :International Journal of Computer Applications 2015

Journal: :Czechoslovak Mathematical Journal 1957

Journal: :Discrete Applied Mathematics 1990

Journal: :Linear Algebra and its Applications 1976

Journal: :Pacific Journal of Mathematics 1954

Journal: :Discrete Applied Mathematics 2014

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

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