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

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

2008
M. A. Jafarizadeh

We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the KarushKuhn-Tucker optimization method, the minimum relative entropy of entanglement of Bell decomposable states has been evaluated and it is shown that the same separable Bell decomposable state lying at the boundary of convex set of sep...

Journal: :International Journal of Applied Mathematical Research 2013

Journal: :iranian journal of fuzzy systems 2013
farhad hamidi hassan mishmast nehi

bilevel linear programming  is a decision making problem with a two-level decentralized organization. the textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. making a decision at one level affects that at the other one. in this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

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

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