convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

The proposed theorem in this paper is indicative of a kind of duality in the propagation of waves in the dual media of and in the spherical structures. Independent of wave frequency, the number of layers, their thickness, and the type of polarization, this theorem holds true in case of any change in any of these conditions. Theorem: Consider a plane wave incident on a multilayered spheric...

Wei’s celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two Wei-type duality theorems for new combinatorial structures that are introduced and named demi-matroids. These generalize matroids and are the appropriate com...

We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets. Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversel...

Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min-max duality theorems for robust convex optimization problems. We give necessary and sufficient constraint qualifications for surrogate duality and surrogate min-max duality, and show some examples at which such duality result...

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...