E-mail this page
Our Webinars
Description
An example that is based on a game called 'Sudoku'. The objective of the game is to fill every blocks, rows and columns with numbers 1 - 9 without any duplicates.
In this example, the problem is solved by mixed integer programming and the Baron solver.
Keywords
Multiple Solutions, GMP Functions, Pivot Table
Model Types
Download AIMMS Example
You can download an AIMMS example dealing with this problem via the link below, and run it after installing the AIMMS software. If you don't have an AIMMS license yet, you can download a free license of AIMMS.
ftp://ftp.aimms.com/pub/Download/Examples/Sudoku.aimmspack
Please make sure to save this file including the .aimmspack extension so that it can be opened by AIMMS.
This example application is a simplification of reality. Please do not hesitate to contact us to discuss how AIMMS enables you to build a complete optimization application that captures the full complexity of your problem.
Screenshot AIMMS Example
