Fluxo de Custo Mínimo (MCF) é um conceito fundamental problema de otimização in pesquisa operacional and fluxo de rede theory. It involves finding the most cost-effective way to transport goods through a network, where nodes represent locations (such as warehouses or destinations) and edges represent the paths along which goods can be transported. Each edge has a capacity, which is the maximum amount of flow that can pass through it, and a cost per unit of flow.
O objetivo do problema de Fluxo de Custo Mínimo é determinar quanto fluxo deve ser enviado por cada aresta na rede de modo que:
- O fluxo do origem ao destino (destino final) atenda à demanda.
- O custo total de transporte do fluxo seja minimizado.
- O fluxo não ultrapasse a capacidade de nenhuma aresta.
To solve this problem, various algorithms can be employed, including the Simplex method, the Network Simplex algorithm, and the Successive Shortest Path algorithm. These methods efficiently navigate the feasible region defined by flow conservation constraints and edge capacities to arrive at an solução ótima.
Minimum Cost Flow problems have practical applications in logistics, transportation, telecommunications, and gestão da cadeia de suprimentos, where businesses seek to optimize their distribution networks while minimizing costs. Understanding MCF can also provide insights into more complex problems, such as those involving dynamic flows or multi-commodity scenarios.