Current location - Plastic Surgery and Aesthetics Network - Plastic surgery and medical aesthetics - Lingo solves discrete variable constraint problems in nonlinear programming
Lingo solves discrete variable constraint problems in nonlinear programming
This is more complicated. You can use polynomial or @if function or define a set to express it flexibly, depending on your problem.

For example, (x-x 1)(x-x2)=0 or define a variable of 0- 1 or an integer variable less than n.

Then it is represented by nested @if.

There seems to be no unified and good solution to this problem, and there is inherent flexibility.