bilevel - Bilevel optimization function
This function solves usign the algorithm desing by algho the optimal network pricing problem given by: Max_y f(x(y),y)=y'x(y), subject to x being solution of the parametric (with parameter y) traffic assignment problem over the traffic network describe in the global variable %net.
The meaning of the input and output parameters depends on the choseen algorithm:
algho='biGls', then d1:if it is true a diagonal search direction is used in the first step of the algorithm. d2:initial prices, d3:precision, s1: sequence of profit function values, s2: sequence of prices.
algho'=biterGrid', then d1:grid's size, d2:precision, d3:number of grid subdivision, s1: sequence of profit function values, s2: sequence of prices
algho='biGraphic', then d1:grid's size, s1:matrix of the the profit function's values, s2 and s3: price's vectors.
%net=TrafficExample("Steenbrink"); // uses the example net Steenbrink [prix,opfV,s1,s2,s3]=bilevel([10,21],0,30,'biGls',1,[0,0],1e-10);