netoptim/network_oracle.hpp file

Oracle for Parametric Network Problems.

This module provides an oracle implementation for solving feasibility problems in network optimization. The oracle acts as a separation oracle that can determine if a given point x is feasible with respect to the network constraints, and if not, provides a cutting plane.

The feasibility problem formulation: find x, utx s.t. utx[j] - utx[i] ≤ h(edge, x) ∀ edge(i, j) ∈ E

where h is a function that depends on the decision variables x. This is commonly used in cutting-plane methods for network optimization.