scholarly journals Generalized(ℱ,b,ϕ,ρ,θ)-univexn-set functions and parametric duality models in minmax fractional subset programming

2005 ◽  
Vol 2005 (10) ◽  
pp. 1601-1620 ◽  
Author(s):  
G. J. Zalmai
Keyword(s):  
Programming Problem ◽  
Duality Results ◽  
Set Functions

We construct three parametric duality models and establish a fairly large number of duality results under a variety of generalized(ℱ,b,ϕ,ρ,θ)-univexity assumptions for a discrete minmax fractional subset programming problem.

scholarly journals Generalized(ℱ,b,ϕ,ρ,θ)-univexn-set functions and semiparametric duality models in multiobjective fractional subset programming

2005 ◽  
Vol 2005 (7) ◽  
pp. 1109-1133 ◽  
Author(s):  
G. J. Zalmai
Keyword(s):  
Programming Problem ◽  
Duality Results ◽  
Set Functions

We construct a number of semiparametric duality models and establish appropriate duality results under various generalized(ℱ,b,ϕ,ρ,θ)-univexity assumptions for a multiobjective fractional subset programming problem.

scholarly journals Duality for multiobjective fractional programming problems involving d -type-I n-set functions

2009 ◽  
Vol 19 (1) ◽  
pp. 63-73
Author(s):  
I.M. Stancu-Minasian ◽  
Gheorghe Dogaru ◽  
Mădălina Stancu
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Type I ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Duality Results ◽  
Set Functions ◽  
Convexity Assumptions ◽  
Nonlinear Fractional Programming

We establish duality results under generalized convexity assumptions for a multiobjective nonlinear fractional programming problem involving d -type-I n -set functions. Our results generalize the results obtained by Preda and Stancu-Minasian [24], [25].

scholarly journals Generalized(ℱ,b,φ,ρ,θ)-univexn-set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming

2005 ◽  
Vol 2005 (6) ◽  
pp. 949-973 ◽  
Author(s):  
G. J. Zalmai
Keyword(s):  
Programming Problem ◽  
Set Functions ◽  
Efficiency Conditions

A fairly large number of global semiparametric sufficient efficiency results are established under various generalized(ℱ,b,φ,ρ,θ)-univexity assumptions for a multiobjective fractional subset programming problem.

Duality relations for second-order programming problem under (G,αf)-bonvexity assumptions

2018 ◽  
Vol 13 (02) ◽  
pp. 2050044 ◽  
Author(s):  
Ramu Dubey ◽  
Vishnu Narayan Mishra ◽  
Puneet Tomar
Keyword(s):  
Programming Problem ◽  
Duality Theorem ◽  
Optimization Problem ◽  
Second Order ◽  
Dual Model ◽  
Weak Duality ◽  
Numerical Examples ◽  
Duality Results ◽  
Duality Relations ◽  
Definition Of

In this paper, we introduce the definition of [Formula: see text]-bonvex/[Formula: see text]-pseudobonvex functions and to show the existence of such functions, we construct nontrivial numerical examples. In the next section, we formulate a pair of second-order symmetric dual model in optimization problem and proved the duality results under [Formula: see text]-bonvexity/[Formula: see text]-pseudobonvexity assumptions. Further, we also construct nontrivial concrete examples which justifying definitions as well as the weak duality theorem presented in the paper.

Symmetric duality results for second-order nondifferentiable multiobjective programming problem

2019 ◽  
Vol 53 (2) ◽  
pp. 539-558 ◽  
Author(s):  
Ramu Dubey ◽  
Vishnu Narayan Mishra
Keyword(s):  
Programming Problem ◽  
Duality Theorem ◽  
Multiobjective Programming ◽  
Second Order ◽  
Weak Duality ◽  
Symmetric Duality ◽  
Numerical Examples ◽  
Duality Results ◽  
Duality Relations ◽  
Multiobjective Programming Problem

In this article, we study the existence of Gf-bonvex/Gf -pseudo-bonvex functions and construct various nontrivial numerical examples for the existence of such type of functions. Furthermore, we formulate Mond-Weir type second-order nondifferentiable multiobjective programming problem and give a nontrivial concrete example which justify weak duality theorem present in the paper. Next, we prove appropriate duality relations under aforesaid assumptions.

On second-order converse duality for a nondifferentiable programming problem

2005 ◽  
Vol 72 (2) ◽  
pp. 265-270 ◽  
Author(s):  
Xin Min Yang ◽  
Ping Zhang
Keyword(s):  
Programming Problem ◽  
Recent Work ◽  
Second Order ◽  
Nondifferentiable Programming ◽  
Converse Duality ◽  
Duality Results

Certain shortcomings are described in the second order converse duality results in the recent work of (J. Zhang and B. Mond, Bull. Austral. Math. Soc. 55(1997) 29–44). Appropriate modifications are suggested.

scholarly journals On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 302
Author(s):  
Koushik Das ◽  
Savin Treanţă
Keyword(s):  
Programming Problem ◽  
Kkt Conditions ◽  
Duality Results ◽  
Contingent Epiderivative ◽  
Arcwise Connectedness ◽  
Infinite Programming

In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types of the problem (SP) under ρ-cone arcwise connectedness assumptions.

Sign in / Sign up

Export Citation Format

Share Document