This paper gives a new dual problem for nondifferentiable convex programming and provesthe properties of weak duality and strong duality and offers a necessary and sufficient condition ofstrong duality.
文摘This paper gives a new dual problem for nondifferentiable convex programming and provesthe properties of weak duality and strong duality and offers a necessary and sufficient condition ofstrong duality.
