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]

transport.mos

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

   file transport.mos
   ``````````````````
   Using dynamic arrays.
   
   (c) 2008 Fair Isaac Corporation
       author: S.Heipcke, 2001, rev. June 2018
*******************************************************!)

model Transport
 uses "mmxprs"

 public declarations
  REGION: set of string                 ! Set of customer regions
  PLANT: set of string                  ! Set of plants

  DEMAND: array(REGION) of real         ! Demand at regions
  PLANTCAP: array(PLANT) of real        ! Production capacity at plants
  PLANTCOST: array(PLANT) of real       ! Unit production cost at plants
  TRANSCAP: dynamic array(PLANT,REGION) of real
                                        ! Capacity on each route plant->region
  DISTANCE: dynamic array(PLANT,REGION) of real
                                        ! Distance of each route plant->region
  FUELCOST: real                        ! Fuel cost per unit distance

  flow: dynamic array(PLANT,REGION) of mpvar    ! Flow on each route
 end-declarations
 
 initializations from 'transprt.dat'
  DEMAND
  [PLANTCAP,PLANTCOST] as 'PLANTDATA'
  [DISTANCE,TRANSCAP] as 'ROUTES'
  FUELCOST
 end-initializations
 
! Create the flow variables that exist
 forall(p in PLANT, r in REGION | exists(TRANSCAP(p,r)) ) create(flow(p,r))
 
! Objective: minimize total cost
 MinCost:= sum(p in PLANT, r in REGION | exists(flow(p,r))) 
            (FUELCOST * DISTANCE(p,r) + PLANTCOST(p)) * flow(p,r)
 
! Limits on plant capacity
 forall(p in PLANT) sum(r in REGION) flow(p,r) <= PLANTCAP(p)

! Satisfy all demands
 forall(r in REGION) sum(p in PLANT) flow(p,r) = DEMAND(r)
 
! Bounds on flows
 forall(p in PLANT, r in REGION | exists(flow(p,r))) 
  flow(p,r) <= TRANSCAP(p,r)
 
 minimize(MinCost)                       ! Solve the problem
 
end-model