Introductory example
|
|
Type: | Production planning |
Rating: | 1 (simple) |
Description: | Modeling a small LP problem (chess0.mos), completing the model with solving and solution output (chess.mos) |
File(s): | chess0.mos, chess.mos |
|
chess0.mos |
(!****************************************************** Mosel User Guide Example Problems ================================= file chess0.mos ``````````````` Modeling a small LP problem. (c) 2008 Fair Isaac Corporation author: Bob Daniel, 2001 *******************************************************!) model "Chess" declarations small: mpvar ! Number of small chess sets to make large: mpvar ! Number of large chess sets to make end-declarations Profit:= 5*small + 20*large ! Objective function Lathe:= 3*small + 2*large <= 160 ! Lathe-hours Boxwood:= small + 3*large <= 200 ! kg of boxwood end-model |
chess.mos |
(!****************************************************** Mosel User Guide Example Problems ================================= file chess.mos `````````````` Solving and solution output. (c) 2008 Fair Isaac Corporation author: Bob Daniel, 2001 *******************************************************!) model "Chess" uses "mmxprs" ! We shall use Xpress Optimizer declarations small,large: mpvar ! Decision variables: produced quantities end-declarations Profit:= 5*small + 20*large ! Objective function Lathe:= 3*small + 2*large <= 160 ! Lathe-hours Boxwood:= small + 3*large <= 200 ! kg of boxwood maximize(Profit) ! Solve the problem writeln("Make ", getsol(small), " small sets") writeln("Make ", getsol(large), " large sets") writeln("Best profit is ", getobjval) end-model |