Generalized Polyhedral Convex Optimization Problems
classification
🧮 math.OC
keywords
convexconditionsdualitygeneralizedoptimizationpolyhedralproblemproblems
read the original abstract
Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We establish solution existence theorems, necessary and sufficient optimality conditions, weak and strong duality theorems. In particular, we show that the dual problem has the same structure as the primal problem, and the strong duality relation holds under three different sets of conditions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.