# AMPL file for the Texas shortest-path problem 

set NODES := 1 2 3 4 5 6;
set ARCS := (1, 2) (1, 3) (2,3) (2, 4) (2, 5)
            (3, 4) (3, 5) (4, 5) (4, 6) (5, 6);


param b := 
1 1
2 0
3 0
4 0
5 0
6 -1;

#           cost      lower      upper bound
param:    	c           	l	u :=
1 2		8         	0	1
1 3		10	    	0	1
2 3		4	 	0	1
2 4		9		0	1
2 5		5		0	1
3 5		2		0	1
3 4		6		0	1
4 5		3		0	1
4 6         	4		0	1	
5 6	  	5 		0	1;