In the generalized balanced optimization problem (GBaOP) the objective value <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\max_{e \in S}{|c(e)-k\max(S)|}}$$</EquationSource> </InlineEquation> is minimized over all feasible subsets S of E = {1, . . . , m}. We show that the algorithm proposed in Punnen and Aneja (Oper Res Lett 32:27–30, <CitationRef CitationID="CR14">2004</CitationRef>) can be modified to...</citationref></equationsource></inlineequation>

In the generalized balanced optimization problem (GBaOP) the objective value $${\max_{e \in 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 (Oper Res Lett 32:27–30, 2004 ) can be modified to ensure...