scholarly journals Higher-order symmetric duality in nondifferentiable multiobjective optimization over cones

Filomat ◽  
2019 ◽  
Vol 33 (3) ◽  
pp. 711-724
Author(s):  
N. Kailey ◽  
S Sonali
Keyword(s):  
Convex Set ◽  
Compact Convex ◽  
Higher Order ◽  
Objective Functions ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Self Duality ◽  
Special Cases ◽  
Compact Convex Set ◽  
Convexity Assumptions

In this paper, a new pair of higher-order nondifferentiable multiobjective symmetric dual programs over arbitrary cones is formulated, where each of the objective functions contains a support function of a compact convex set. We identify a function lying exclusively in the class of higher-order K-?-convex and not in the class of K-?-bonvex function already existing in literature. Weak, strong and converse duality theorems are then established under higher-order K-?-convexity assumptions. Self duality is obtained by assuming the functions involved to be skew-symmetric. Several known results are also discussed as special cases.

scholarly journals Nondifferentiable higher order symmetric duality under invexity/generalized invexity

Filomat ◽  
2014 ◽  
Vol 28 (8) ◽  
pp. 1661-1674 ◽  
Author(s):  
T.R. Gulati ◽  
Khushboo Verma
Keyword(s):  
Higher Order ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Converse Duality ◽  
Generalized Invexity ◽  
Self Duality ◽  
Special Cases ◽  
Dual Models

In this paper, we introduce a pair of nondifferentiable higher-order symmetric dual models. Weak, strong and converse duality theorems for this pair are established under the assumption of higher order invexity/generalized invexity. Self duality has been discussed assuming the function involved to be skew-symmetric. Several known results are obtained as special cases.

scholarly journals Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 274 ◽  
Author(s):  
Izhar Ahmad ◽  
Khushboo Verma ◽  
Suliman Al-Homidan
Keyword(s):  
Mixed Type ◽  
Higher Order ◽  
Dual Model ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Converse Duality ◽  
Self Duality ◽  
Pseudoconvex Functions

A new mixed type nondifferentiable higher-order symmetric dual programs over cones is formulated. As of now, in the literature, either Wolfe-type or Mond–Weir-type nondifferentiable symmetric duals have been studied. However, we present a unified dual model and discuss weak, strong, and converse duality theorems for such programs under higher-order F - convexity/higher-order F - pseudoconvexity. Self-duality is also discussed. Our dual programs and results generalize some dual formulations and results appeared in the literature. Two non-trivial examples are given to show the uniqueness of higher-order F - convex/higher-order F - pseudoconvex functions and existence of higher-order symmetric dual programs.

scholarly journals Some results on symmetric duality of mathematical fractional programming with generalized $F$-convexity complex spaces

2005 ◽  
Vol 36 (2) ◽  
pp. 159-165
Author(s):  
Deo Brat Ojha
Keyword(s):  
Fractional Programming ◽  
General Type ◽  
Strong Duality ◽  
Objective Functions ◽  
Symmetric Duality ◽  
Support Functions ◽  
Complex Spaces ◽  
Duality Results ◽  
Special Cases ◽  
Convexity Assumptions

In this present article we have given some mathematical fractional programming problems with their symmetric duals and have derived weak and strong duality results with respect to such programs. Moreover, we have also used most general type of convexity assumptions involved with the functions which are related to the programming problems. It is to be pointed out that the objective functions in such programs contain terms like support functions which in turn are able to give results on particular classes of programs involving quadratic terms. Our results in particular give as of special cases some eariler results symmetric duals given in the current literature. All discussion goes to complex spaces.

scholarly journals Second order symmetric duality in fractional variational problems over cone constraints

2018 ◽  
Vol 28 (1) ◽  
pp. 39-57
Author(s):  
Anurag Jayswal ◽  
Shalini Jha
Keyword(s):  
Duality Theorem ◽  
Variational Problems ◽  
Second Order ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Self Duality ◽  
Cone Constraints ◽  
Fractional Variational Problems ◽  
Second Order Symmetric Duality ◽  
Convexity Assumptions

In the present paper, we introduce a pair of second order fractional symmetric variational programs over cone constraints and derive weak, strong, and converse duality theorems under second order F-convexity assumptions. Moreover, self duality theorem is also discussed. Our results give natural unification and extension of some previously known results in the literature.

scholarly journals Diameter-preserving linear bijections of function spaces

2001 ◽  
Vol 70 (3) ◽  
pp. 323-336 ◽  
Author(s):  
T. S. S. R. K. Rao ◽  
A. K. Roy
Keyword(s):  
Maximal Ideal ◽  
Convex Set ◽  
Compact Convex ◽  
Extreme Points ◽  
Continuous Functions ◽  
Ideal Space ◽  
Function Algebras ◽  
Compact Convex Set ◽  
Vector Valued Functions ◽  
Vector Valued

AbstractIn this paper we give a complete description of diameter-preserving linear bijections on the space of affine continuous functions on a compact convex set whose extreme points are split faces. We also give a description of such maps on function algebras considered on their maximal ideal space. We formulate and prove similar results for spaces of vector-valued functions.

Densities for stationary random sets and point processes

1984 ◽  
Vol 16 (02) ◽  
pp. 324-346 ◽  
Author(s):  
Wolfgang Weil ◽  
John A. Wieacker
Keyword(s):  
Poisson Process ◽  
Point Processes ◽  
Convex Set ◽  
Compact Convex ◽  
Random Sets ◽  
Intensity Measure ◽  
Additive Functionals ◽  
Compact Convex Set ◽  
Classical Integral

For certain stationary random setsX, densitiesDφ(X) of additive functionalsφare defined and formulas forare derived whenKis a compact convex set in. In particular, for the quermassintegrals and motioninvariantX, these formulas are in analogy with classical integral geometric formulas. The case whereXis the union set of a Poisson processYof convex particles is considered separately. Here, formulas involving the intensity measure ofYare obtained.

Densities for stationary random sets and point processes

1984 ◽  
Vol 16 (2) ◽  
pp. 324-346 ◽  
Author(s):  
Wolfgang Weil ◽  
John A. Wieacker
Keyword(s):  
Poisson Process ◽  
Point Processes ◽  
Convex Set ◽  
Compact Convex ◽  
Random Sets ◽  
Intensity Measure ◽  
Additive Functionals ◽  
Compact Convex Set ◽  
Classical Integral

For certain stationary random sets X, densities Dφ (X) of additive functionals φ are defined and formulas for are derived when K is a compact convex set in . In particular, for the quermassintegrals and motioninvariant X, these formulas are in analogy with classical integral geometric formulas. The case where X is the union set of a Poisson process Y of convex particles is considered separately. Here, formulas involving the intensity measure of Y are obtained.

Hyperplans poissoniens et compacts de Steiner

1974 ◽  
Vol 6 (03) ◽  
pp. 563-579 ◽  
Author(s):  
G. Matheron
Keyword(s):  
Stationary Process ◽  
Convex Set ◽  
Compact Convex ◽  
Minkowski Sum ◽  
Isotropic Case ◽  
Geometrical Properties ◽  
Steiner Formula ◽  
Compact Convex Set ◽  
Finite Sums ◽  
Linear Variety

A compact convex set in RN is Steiner if it is a finite Minkowski sum of line segments, or a limit of such finite sums, and then satisfies an extension of the Steiner formula. With each Poisson hyperplane stationary process A is uniquely associated a Steiner set M, and for any linear variety V, the Steiner set associated with is the projection of M on V. The density of the order k network Ak (i.e., the set of the intersections of k hyperplanes belonging to A) is linked with simple geometrical properties of M. In the isotropic case, the expression of the covariance measures associated with Ak is derived and compared with the analogous results obtained for (N — k)-dimensional Poisson flats.

Some Remarks on Translative Coverings of Convex Domains by Strips

1984 ◽  
Vol 27 (2) ◽  
pp. 233-237 ◽  
Author(s):  
H. Groemer
Keyword(s):  
Euclidean Plane ◽  
Convex Set ◽  
Compact Convex ◽  
Convex Domains ◽  
Minimal Width ◽  
Compact Convex Set

AbstractIn the euclidean plane let K be a compact convex set and Sl, S2,… strips of respective widths wl, w2,… Some conditions on Σ wi are given that imply that K can be covered by translates of the strips Si. These conditions involve the perimeter, the diameter, or the minimal width of K and yield improvements of previously known results.

Sign in / Sign up

Export Citation Format

Share Document