The present article continues a series of papers devoted to the numerical solution of practical mixed optimization problems. Previously the partitioning theorem of the indicated mixed maximization problem was formulated and proved. In this article some methods for solving problems by partitioning, including the graphical method, a three-step procedure, and the iterative procedures 1 and 2, are shown by a specific example of the solution of the simplest mixed maximization problem. A feasible set of the problem and the convex hull of this set are graphically presented within the framework of solving the problem.