| |||||||||||
Transportation problem with piecewise linear cost expressions Description Formulating piecewise linear cost functions via pwlin constraints.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
Data Files transpl2.dat ! Data file for transpl2.mos SUPPLY:[(GARY) 1400 (CLEV) 2600 (PITT) 2900] DEMAND:[(FRA) 900 (DET) 1200 (LAN) 600 (WIN) 400 (STL) 1700 (FRE) 1100 (LAF) 1000] RATE:[ (GARY FRA) [39 50 70] (GARY DET) [14 17 33] (GARY LAN) [11 12 23] (GARY WIN) [14 17] (GARY STL) [16 23 40] (GARY FRE) [82 98] (GARY LAF) [ 8 16 24] (CLEV FRA) [27 37 47] (CLEV DET) [ 9 19 24] (CLEV LAN) [12 32 39] (CLEV WIN) [ 9 14 21] (CLEV STL) [26 36 47] (CLEV FRE) [95 105 129] (CLEV LAF) [ 8 16 24] (PITT FRA) [24 34] (PITT DET) [14 24] (PITT LAN) [17 27] (PITT WIN) [13 23] (PITT STL) [28] (PITT FRE) [99 140] (PITT LAF) [20] ] LIMIT:[ (GARY FRA) [500 1000] (GARY DET) [500 1000] (GARY LAN) [500 1000] (GARY WIN) [1000] (GARY STL) [500 1000] (GARY FRE) [1000] (GARY LAF) [500 1000] (CLEV FRA) [500 1000] (CLEV DET) [500 1000] (CLEV LAN) [500 1000] (CLEV WIN) [500 1000] (CLEV STL) [500 1000] (CLEV FRE) [500 1000] (CLEV LAF) [500 1000] (PITT FRA) [1000] (PITT DET) [1000] (PITT LAN) [1000] (PITT WIN) [1000] (PITT FRE) [1000] ] | |||||||||||
© Copyright 2024 Fair Isaac Corporation. |