Maximum Capacity Path Problem with constraints
It can be solved in polynomial time. For instance, you can use binary search over the weight.  Given a candidate weight, delete all edges with lower weight, then find the lowest-cost path and test whether its cost is below the lower bound; that tells you whether the weight was too high or too low.  Repeat until binary search converges.