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

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

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

An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...

Journal: :Pacific Journal of Mathematics 1954

Journal: :Discrete Applied Mathematics 2014

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

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