Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

<div>Updated process of the bound and gap with respect to the iterations (<span class="nowrap"><svg height="11.8369pt" id="M145" style="vertical-align:-0.2454996pt" version="1.1" viewbox="-0.0498162 -11.5914 45.1665 11.8369" width="45.1665pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M956 650H736V622C814 613 818 602 804 542C789 471 733 275 691 141H689C628 314 570 476 514 641H485C434 478 377 312 323 142H321C277 284 238 419 199 554C184 605 186 613 259 622V650H16V622C77 615 92 606 117 524C172 346 228 170 281 -11H312C363 151 419 312 475 488H477C528 343 597 150 652 -11H683C765 269 826 458 848 522C878 605 887 613 956 622V650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,12.623,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.201,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,32.464,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,38.704,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g></svg>,</span><svg height="11.8369pt" id="M146" style="vertical-align:-0.2454996pt" version="1.1" viewbox="-0.0498162 -11.5914 45.1665 11.8369" width="45.1665pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M956 650H736V622C814 613 818 602 804 542C789 471 733 275 691 141H689C628 314 570 476 514 641H485C434 478 377 312 323 142H321C277 284 238 419 199 554C184 605 186 613 259 622V650H16V622C77 615 92 606 117 524C172 346 228 170 281 -11H312C363 151 419 312 475 488H477C528 343 597 150 652 -11H683C765 269 826 458 848 522C878 605 887 613 956 622V650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,12.623,-5.741)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.201,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,32.464,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,38.704,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g></svg>).</div>

Mathematical Problems in Engineering

tab2

Table 2

Table 2: Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem 