The article deals with certain nonconvex optimization problem which have features analogous to those of the linear optimization problems. We can find their absolute extrema and the set all optimal points of such nonconvex optimization problem represents the closure of a face of a spherical polyhedron which is its feasible set.
@article{104396, author = {Libu\v se Grygarov\'a}, title = {About a special class of nonconvex optimization problems}, journal = {Applications of Mathematics}, volume = {35}, year = {1990}, pages = {147-157}, zbl = {0718.90074}, mrnumber = {1042850}, language = {en}, url = {http://dml.mathdoc.fr/item/104396} }
Grygarová, Libuše. About a special class of nonconvex optimization problems. Applications of Mathematics, Tome 35 (1990) pp. 147-157. http://gdmltest.u-ga.fr/item/104396/
Geometrie konvexer Mengen und konvexe Analysis, Akademie-Verlag, Berlin. 1988. (1988) | MR 0966885
Theorie der linearen parametrischen Optimierung, Akademie-Verlag, Berlin. 1974. (1974)