FICO Xpress Optimization Examples Repository: Basic embedding tasks

FICO Xpress Optimization Examples Repository

FICO Optimization Community

FICO Xpress Optimization Home

Basic embedding tasks

Description

ugcomp.c: Compiling a model into a BIM file (requires burglar2.mos, burglar.dat)
ugcomptmp.c: Compiling a model into a BIM file saved in Mosel's temporary directory (requires burglar2.mos, burglar.dat)
ugexec.c: Execute (compile/load/run) a model (requires burglar2.mos, burglar.dat)
ugrun.c: Executing a BIM file (requires burglar2.bim, burglar.dat)
ugdefstream.c: Redirecting the model output (requires burglar2.mos, burglar.dat)
ugarray1.c, ugarray2.c: Accessing modeling objects: sparse arrays (requires transport.mos, transprt.dat)
ugcb.c: Retrieve model output via a callback (requires burglar2.mos, burglar.dat)
ugparam1.c, ugparam2.c: Passing parameters to a Mosel model (requires prime2.mos)
ugsol1.c, ugsol2.c: Accessing modeling objects and solution information (requires burglar3.mos, burglar.dat)

ugc.zip

[download all files]

Source Files

By clicking on a file name, a preview is opened at the bottom of this page.

ugcomp.c	[download]
ugcomptmp.c	[download]
ugexec.c	[download]
ugrun.c	[download]
ugdefstream.c	[download]
ugarray1.c	[download]
ugarray2.c	[download]
ugcb.c	[download]
ugsol1.c	[download]
ugsol2.c	[download]
ugparam1.c	[download]
ugparam2.c	[download]
burglar2.mos	[download]
transport.mos	[download]
prime2.mos	[download]
burglar3.mos	[download]

Data Files

burglar.dat	[download]
transprt.dat	[download]

prime2.mos

(!******************************************************
   Mosel User Guide Example Problems
   ================================= 

   file prime2.mos 
   ```````````````
   Version of prime.mos without output printing.
 
   (c) 2008 Fair Isaac Corporation
       author: S. Heipcke, 2001, rev. June 2018
*******************************************************!)

model Prime 

parameters
 LIMIT=100                     ! Search for prime numbers in 2..LIMIT
end-parameters

public declarations
 SNumbers: set of integer      ! Set of numbers to be checked
 SPrime: set of integer        ! Set of prime numbers
end-declarations

 SNumbers:={2..LIMIT} 
 
 n:=2
 repeat
   while (not(n in SNumbers)) n+=1
   SPrime += {n}               ! n is a prime number
   i:=n
   while (i<=LIMIT) do         ! Remove n and all its multiples
     SNumbers-= {i}
     i+=n
   end-do
 until SNumbers={}    
 
end-model