In the generalized balanced optimization problem (GBaOP) the objective value maxe∈S|c(e) - k max (S) is minimized over all feasible subsets S of E = {1,…, m}. We show that the algorithm proposed in Punnen and Aneja (2004) can be modified to ensure that the resulting solution is indeed optimal. This modification is attained at the expense of increased worst‐case complexity, but still maintains polynomial solvability of various special cases that are of general interest. In particular, we show that GBaOP can be solved in polynomial time if an associated bottleneck problem can be solved in polynomial time. For the solution of this bottleneck problem, we propose two alternative approaches.
