This paper addresses the problem of optimally modifying the edge lengths such that a prespecified vertex becomes the furthest vertex from a given fixed vertex in the perturbed network. We call this problem the inverse eccentric vertex problem. We show that the problem is NP-complete even on cactus graphs. However, if the underlying graph is a cycle or a tree, we develop efficient algorithms with linear time complexity.