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...

In this paper we consider a single product multi-period inventory problem for which the penalty cost consists of two parts, a lump-sum portion which is independent of the size of the shortage and a portion which is linear in the size of the shortage. We show that for all nonincreasing demand...