WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

Authors

  • A. V. Kamyad Department of Mathematics, Ferdowsi University of Mashhad, Iran,
  • B. Farhadinia Department of Mathematics, Quchan Institute of Engineering and Technology, Iran,
Abstract:

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality theorems are extended from crisp conic optimization problems to fuzzy ones.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

weak and strong duality theorems for fuzzy conic optimization problems

the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...

full text

Weak and Strong Duality Theorems for Fuzzy Conic Optimization Problems

The objective of this paper is to deal with the fuzzy conic programming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a specific ordering cone is established based on the parameterized representation of fuzzy numbers. Under this setting, duality theo...

full text

Unifying duality theorems for width parameters in graphs and matroids I. Weak and strong duality

We prove a general duality theorem for width parameters in combinatorial structures such as graphs and matroids. It implies the classical such theorems for path-width, tree-width, branch-width and rank-width, and gives rise to new width parameters with associated duality theorems. The dense substructures witnessing large width are presented in a unified way akin to tangles, as orientations of s...

full text

Duality of linear conic problems

It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least one of these problems is feasible. It is also well known that for linear conic problems this property of “no duality gap” may not hold. It is then natural to ask whether there exist some other convex closed cones, apart from polyhedral, for which the “no duality gap” propert...

full text

Weak and strong convergence theorems for a finite family of generalized asymptotically quasinonexpansive nonself-mappings

In this paper, we introduce and study a new iterative scheme toapproximate a common xed point for a nite family of generalized asymptoticallyquasi-nonexpansive nonself-mappings in Banach spaces. Several strong and weakconvergence theorems of the proposed iteration are established. The main resultsobtained in this paper generalize and rene some known results in the currentliterature.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue 1

pages  143- 152

publication date 2013-02-06

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023