Hi,

I have modeled the problem I need to solve with GAMS. I first chose

nlp to solve the problem, but the compiler suggested me to use dnlp.

However, the compiler then said that “Endogenous $-control operations

not allowed”. So I have been wondering if my problem is out of the

scope of GAMS?

I need to solve the following problem:

M is THE MATRIX I want to solve. None of its entries is known.

I have a lot of vectors. What I do is to use M to project them into a

new space, and try to keep their relative distance sequences.

Let a, b, c denote the vectors.

The test condition is:

If distance(a, b) > distance(a, c) AND distance(Ma, Mb)

sum(o2, power(face_vectors(f1, o2) - face_vectors(f3,

o2), 2)) and

sum(n1, power(projected_face_vectors(f1, n1) -

projected_face_vectors(f2, n1), 2)) <

sum(n2,power(projected_face_vectors(f1, n2) -

projected_face_vectors(f3, n2), 2))),

sum(n3, power(projected_face_vectors(f1, n3) -

projected_face_vectors(f3, n3), 2)) -

sum(n4, power(projected_face_vectors(f1, n4) -

projected_face_vectors(f2, n4), 2)));

Model new_projection_space /all/ ;

Solve new_projection_space using dnlp minimizing cost ;

display M.l, M.m;

I guess that trouble comes from that fact that it is a iterative

optimization problem; if I want to know the pairs in my vectors that

satisfy the test condition, I need to know M, but M is precisely the

variable I want to solve!

So is my problem something that can be solved by GAMS?

Or is there other softwares that I might use?

Any help is greatly appreciated!

–~–~---------~–~----~------------~-------~–~----~

To post to this group, send email to gamsworld@googlegroups.com

To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com

For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en

-~----------~----~----~----~------~----~------~–~—

\