Connection theorems in non-convex programming

From MaRDI portal





Consider the problem of maximizing a real scalar function subject to the vector equality and inequality constraints \(g(x)\ge 0\), \(h(x) = 0\). The following results are established: (1) If \(f(x)\) is concave and \(h\) is linear affine, a pseudo-maximum point is also a local maximum point. (2) A local maximum point is also a pseudo-maximum point.











This page was built for publication: Connection theorems in non-convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5571497)