**ABSTRACT**

The maximum flow problem is an optimization problem that aims to find the maximum flow value on a network. This problem can be solved by using Linear Programming. The obstacle that is often faced in determining the maximum flow is the magnitude of the capacity of each side of the network can often be changed due to certain factors. Therefore, we need one of the optimization fields that can calculate the uncertainty factor. The field of optimization carried out to overcome these uncertainties is Robust Optimization. This paper discusses the Optimization model for the maximum flow problem by calculating the uncertainties on parameters and adjustable variables using the Adjustable Robust Counterpart (ARC) Optimization model. In this ARC Optimization model it is assumed that there are indeterminate parameters in the form of side capacity in a network and an uncertain decision variable that is the amount of flow from the destination point (sink) to the source point (source). Calculation results from numerical simulations show that the ARC Optimization model provides the maximum number of flows in a network with a set of box uncertainty. Numerical simulations were obtained with Maple software.

## Support the magazine and subscribe to the content

This is premium stuff. Subscribe to read the entire article.