AMPL offers superior support by our development and technical support teams.
Contact us for general queries, partnerships, and more.
We can help you find the license and offering that works best for your situation.
SUPPORT
AMPL is now on Discourse! 🎉
This is your NEW best place to talk about optimization problems, and get support for AMPL and AMPL Community Edition from our dev team and the community.
Join the conversation at discuss.ampl.com
SUPPORT
AMPL is now on Discourse! 🎉
This is your NEW best place to talk about optimization problems, and get support for AMPL and AMPL Community Edition from our dev team and the community.
Join the conversation at discuss.ampl.com
SOLVER UPDATES
All-new Gurobi 10 solver driver for AMPL!
Featuring a new network simplex algorithm, significant performance gains on MIPs, and more!
Our enhanced Gurobi driver (previously x-gurobi) is now the default gurobi driver.
AMPL offers superior support by our development and technical support teams.
Contact us for general queries, partnerships, and more.
We can help you find the license and offering that works best for your situation.
Example file from the AMPL book
set NUTR;
set FOOD;
param cost {FOOD} > 0;
param f_min {FOOD} >= 0;
param f_max {j in FOOD} >= f_min[j];
param n_min {NUTR} >= 0;
param n_max {i in NUTR} >= n_min[i];
param amt {NUTR,FOOD} >= 0;
var Buy {j in FOOD} >= f_min[j], <= f_max[j];
minimize Total_Cost: sum {j in FOOD} cost[j] * Buy[j];
subject to Diet {i in NUTR}:
n_min[i] <= sum {j in FOOD} amt[i,j] * Buy[j] <= n_max[i];