Summary: In this paper, quadratic programming models are constructed to obtain the optimal compromise values of balance games based on optimistic complaints and pessimistic complaints. Quadratic programming model and its method of solution are easier to operate than that of lexicographic order. In addition, we give an algorithm to solve the optimal optimistic compromise value which satisfies both individual rationality and group effectiveness. Finally, numerical examples are given to illustrate the rationality and effectiveness of the model and method proposed in this paper.