1. Andronov, V.G., Belousov, E.G., Shironin, V.M.: On solvability of the problem of polynomial programming, Izvestija Akadem. Nauk SSSR, Tekhnicheskaja Kibernetika, no. 4, 194–197 (1982) (in Russian). Translation Appeared in News of the Academy of Science of USSR, Department of Technical Sciences, Technical. Cybernetics no. 4, 194–197 (1982)
2. Auslender, A.: How to deal with the unbounded in optimization: theory and algorithms. Math. Program. Ser. B 79, 3–8 (1997)
3. Bank, B., Mandel, R.: Parametric Integer Optimization, Mathematical Research, vol. 39, edn. Academie-Verlag, Berlin (1988)
4. Belousov, E.G.: Introduction to Convex Analysis and Integer Programming. Moscow University Publ, Moscow (1977). (in Russian)
5. Belousov, E.G., Klatte, D.: A Frank–Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22(1), 37–48 (2002)