Message Boards Message Boards

0
|
1828 Views
|
1 Reply
|
2 Total Likes
View groups...
Share
Share this post:

Using FindMinimum on permutation sets?

Posted 1 year ago

I have function like f(x) = 4x₁+3x₂ and constraints like 3x₁+5x₂<=20, x₁+6x₂>=30. The problem is to find maximum of the target funtion on permutation set A₃². I've seen topic in documentation named "Combinatorial Optimization", but I don't know if FindMinimum can solve problems on permutation sets and if so, which algorithm is used. Also is there a possibility to use someting like genetic algorithms in Matematica?

Attachment

POSTED BY: Denys P

ResourceFunction[“MaximizeOverPermutations”] is well suited for this task. It uses a simulated annealing method if memory serves.

POSTED BY: Daniel Lichtblau
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract