In the paper, we describe various applications of closedness and duality theorems from previous works of the author. First, the strong separability of a polyhedron and a linear image of a convex set is characterized. Then, it is shown how stability conditions (known from the generalized Fenchel-Rockafellar duality theory) can be reformulated as closedness conditions. Finally, we present a generalized Lagrangian duality theorem for Lagrangian programs described with cone-convex/cone-polyhedral mappings
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
Linear separation theorems, besides being important results in Convex Ananysis, play a central role ...
AbstractIn this article we provide weak sufficient strong duality conditions for a convex optimizati...
This paper addresses the study and applications of polyhedral duality in locally convex topological ...
In this note we show that the strong duality theorem of an unconstrained (generalized) geometricprog...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
By means of a conjugation scheme based on generalized convex conjugation theory instead of Fenchel c...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractWe give some necessary and sufficient conditions which completely characterize the strong an...
textabstractIn this paper we will show that the closely K-convexlike vector-valued functions with K ...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
AbstractA closedness criterion for the image of a convex closed locally compact set under a convex m...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
Linear separation theorems, besides being important results in Convex Ananysis, play a central role ...
AbstractIn this article we provide weak sufficient strong duality conditions for a convex optimizati...
This paper addresses the study and applications of polyhedral duality in locally convex topological ...
In this note we show that the strong duality theorem of an unconstrained (generalized) geometricprog...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
By means of a conjugation scheme based on generalized convex conjugation theory instead of Fenchel c...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractWe give some necessary and sufficient conditions which completely characterize the strong an...
textabstractIn this paper we will show that the closely K-convexlike vector-valued functions with K ...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
AbstractA closedness criterion for the image of a convex closed locally compact set under a convex m...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
Linear separation theorems, besides being important results in Convex Ananysis, play a central role ...