zbMATH — the first resource for mathematics

About a special class of nonconvex optimization problems. (English) Zbl 0718.90074
The paper deals with nonconvex optimization problems, the set of feasible solutions of which is the intersection of a polyhedral cone with a hypersphere. Such a set is called spherical polyhedron and it is obviously a nonconvex set. The objective function of the problem is such a nonconvex function whose set of optimal solutions is a closure of a face of the spherical polyhedron. Such problems have similar properties as the classical linear programming problems. An optimality criterion is derived and an idea how to solve such problems is suggested. Some applications are briefly mentioned.
90C26 Nonconvex programming, global optimization
90C30 Nonlinear programming
Full Text: EuDML
[1] F. Nožička L. Grygarová K. Lommatzsch: Geometrie konvexer Mengen und konvexe Analysis. Akademie-Verlag, Berlin. 1988.
[2] F. Nožička J. Guddat H. Hollatz B. Bank: Theorie der linearen parametrischen Optimierung. Akademie-Verlag, Berlin. 1974. · Zbl 0284.90053
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.