Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Table 1

Updated process of the Lagrangian multiplier, bound, and gap with respect to the iterations (,).

1	100.0	100.0	100.0	60.00	0.00	60.00	100.0
2	61.31	61.48	62.47	52.26	27.20	25.06	47.95
3	63.49	68.23	61.10	48.20	31.12	17.08	35.43
4	53.49	66.15	51.29	47.40	35.49	11.91	25.12
5	51.43	59.30	53.20	43.26	35.98	7.28	16.82
6	30.20	35.36	50.20	42.16	38.32	3.84	9.10
7	34.23	0.00	50.20	40.00	39.13	0.87	2.17
8	32.45	0.00	50.20	40.00	40.00	0.00	0.00