Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have