FICO
FICO Xpress Optimization Examples Repository
FICO Optimization Community FICO Xpress Optimization Home
Back to examples browserPrevious example

Local authorities and public services

Description
Problem name and type, featuresDifficultyRelated examples
J‑1 Water conveyance / water supply management: Maximum flow problem ** j1water_graph.mos, g1rely.mos
encoding of arcs, selection with `|', record data structure
J‑2 CCTV surveillance: Maximum vertex cover problem ** j2bigbro_graph.mos, g6transmit.mos, d5cutsh.mos
encoding of network, exists
J‑3 Rigging elections: Partitioning problem **** j3elect_graph.mos, partitioning_graph.mos
algorithm for data preprocessing; file inclusion, 3 nested/recursive procedures, working with sets, if-then, forall-do, exists, finalize
J‑4 Gritting roads: Directed Chinese postman problem **** j4grit_graph.mos
algorithm for finding Eulerian path/graph for printing; encoding of arcs, dynamic array, exists, 2 functions implementing Eulerian circuit algorithm, round, getsize, break, while-do, if-then-else, list handling
J‑5 Location of income tax offices: p-median problem ****
modeling an implication, all-pairs shortest path algorithm (Floyd-Warshall); dynamic array, exists, procedure for shortest path algorithm, forall-do, if-then, selection with `|'
J‑6 Efficiency of hospitals: Data Envelopment Analysis (DEA) ***
description of DEA method; loop over problem solving with complete re-definition of problem every time, naming and declaring constraints


Further explanation of this example: 'Applications of optimization with Xpress-MP', Chapter 15: Local authorities and public services

mosel_app_10.zip[download all files]

Source Files

Data Files





j1water.dat

! Data file for `j1water.mos'

PIPE: [(1 1) 1 3
       (2 1) 1 5
       (3 1) 1 6
       (4 1) 2 5
       (5 1) 2 6
       (6 1) 3 4
       (7 1) 3 5
       (8 1) 4 8
       (9 1) 4 9
      (10 1) 5 8
      (11 1) 5 9
      (12 1) 5 10
      (13 1) 6 7
      (14 1) 7 9
      (15 1) 7 10
      (16 1) 8 12
      (17 1) 9 12
      (18 1) 10 12
      (19 1) 11 1
      (20 1) 11 2]

CAP: [(1) 20 15 12  6 22 15 10  7 10 10 15 15 22 10 10 18 15 20 35 25]

SOURCE: 11
SINK:   12

POS: [[30 35]
[30 15]
[53 41]
[70 41]
[62 23]
[53 7]
[70 7]
[95 41]
[95 23]
[95 7]
[6 23]
[119 23]]
Back to examples browserPrevious example