Tour/opt1 - Help

Online Help

All Products    Maple    MapleSim

Home : Support : Online Help : Tour/opt1

Optimization: Linear Programming


Maple is able to solve linear optimization problems with hundreds of variables and constraints. Problem types that are covered include continuous, integer, mixed-integer, and binary linear programs.


This example illustrates the functionality on a simple linear system:


obj 4 x  5 y


constraints x0, y0,  x+2 y 6,  5 x+4 y 20


OptimizationLPSolveobj, constraints



This is a very small example, but Maple is able to deal with very large systems, specified either in equation notation or in matrix form.