Summary: We study the shortest \(k\)-violation path problem in a simple polygon. Let \(P\) be a simple polygon in \(\mathbb{R}^2\) with \(n\) vertices and let \(s,t\) be a pair of points in \(P\). Let \(\operatorname{int}(P)\) represent the interior of \(P\). Let \(\widetilde{P}= \mathbb{R}^2\setminus\operatorname{int}(P)\) represent the exterior of \(P\). For an integer \(k\geq 0\), the shortest \(k\)-violation path problem in \(P\) is the problem of computing the shortest path from \(s\) to \(t\) in \(P\), such that at most \(k\) path segments are allowed to be in \(\widetilde{P}\). The subpaths of a \(k\)-violation path are not allowed to bend in \(\widetilde{P}\). For any \(k\), we present a \((1+2\epsilon)\) factor approximation algorithm for the problem that runs in \(O( n^2 \sigma^2k\log n^2 \sigma^2+ n^2 \sigma^2k)\) time. Here \(\sigma=O( \log_\delta(\frac{ L}{ r}))\) and \(\delta\), \(L\), \(r\) are geometric parameters.