Hi guys! I'm looking for a "meeting planner" software which works like this: 1- You

of the 2 vectors). For other vector rotating problems have a look at my webpage (in german) at http://www.tu-chemnitz.de/~luta/drawlat/drawmath.html Hope this helps, Lutz Tautenhahn

-0.85065 -0.447212 0.723606 0.525732 0.447212 -0.276394 0.85065 0.447212 -0.894432 0 0.447212 -0.276394 -0.85065 0.447212 0.723606 -0.525732 0.447212 0 0 1 Regards, Lutz Tautenhahn

which has the same total cost as the solution with alpha=1 and take this as your optimum solution. I hope this suggestion works (I didn't try it out). Regards, Lutz Tautenhahn.

Hi folks, i'm looking for a good implementation in order to solve the assignment problem with

I did some research on the capacitated single level lotsizing problem (more specific the one without

home/lutz.tautenhahn/plt/lgrthm/layout.html or go to the root of my homepage at www.tu-chemnitz.de/~luta/ and use the links PLT->Algorithms->Layout. Regards Lutz Tautenhahn

Hi there, Could some one suggest me a good algorithm to generate a permutaion of numbers some of

Regards, Lutz "Uffe Kousgaard" schrieb im Newsbeitrag news:3c0e9876$0$25412$edfadb0f@dspool01.news.tele.dk... > Hi, > > It is much better now. The only

Regards, Lutz Tautenhahn "walker" schrieb im Newsbeitrag news:727fd76d.0111240427.ff40244@posting.google.com... > Hello,everyone.I have to handl some dynamic

Regards, Lutz Tautenhahn "SPaquin" schrieb im Newsbeitrag news:fdd7874.0108140930.17939992@posting.google.com... > Hi > I am a process control engineer

This looks better: sum(i=1,m,j=1,n(i)) (a(i,j)-d(i))x(i,j) <= b-sum(i=1,m) d(i) Lutz.

] "Lutz Tautenhahn" wrote in news:9khucn$q2b$1@narses.hrz.tu-chemnitz.de: > > I was really surprised that we even used the same symbols (dummy and > M), in

Consider a simple network flow problem with one layer of supply nodes, one layer of receiving nodes,

Hi Suppose we have a set of rays (R) and a set of hyperplane half spaces (H) [ie sets defined by sum_

Hi I have a list of 3774 linear inequalities: sum_{1<= k<=21} a_{ik} xk >=0 1<=i<=3774

Hi, What is the complexity of obtaining a descent direction of a nondifferentiable optimization

Hi, I'm trying to solve a combinatorial optimization problem that arises from the "feature

Hi everybody, I'm new to operational research, I just attended a course this semester. I have to

Hi Pramod, it seems to me you have the following problem: You have a set of data points {x_1, ..., x_n}, which are normal distributed and want them to

First, my conjecture is that only one or two nonintegers will crop up >needing rounding. is probably right (supposed you use the simplex method to solve the LP). Regards, Lutz Tautenhahn

Hi, Suppose you have n tasks, each requiring a certain amount of a resource, while there isn't

.html is too sophisticated for you , then take this one from the JavaScript in http://www.tu-chemnitz.de/~luta/plt/PermRank.html which is of O(n), too. Regards, Lutz.

LP's remind me of Knapsack which is NP hard, so I probably couldn't achieve the optimum solution for large problems, or am I wrong in this point? Lutz (the double poster).