Sufficient conditions and duality for multiobjective variational problems with generalized B-invexity
B. Aghezzaf, K. Khazafi (2004)
Control and Cybernetics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Multiobjective variational programming under generalized (V,ρ)-B-type I functions”
Sufficient conditions and duality for multiobjective variational problems with generalized B-invexity
Optimality Conditions and Duality in Multiobjective Programming With -Invexity
Massimiliano Ferrara, Maria Viorica Stefanescu (2008)
The Yugoslav Journal of Operations Research
Similarity:
Optimality and Duality for a Class of Nondifferentiable Minimax Fractional Programming Problems
Antoan Bătătorescu, Miruna Beldiman, Iulian Antonescu, Roxana Ciumara (2009)
The Yugoslav Journal of Operations Research
Similarity:
Duality for Multiobjective Fractional Programming Problems Involving -Type-I -Set -Functions
I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)
The Yugoslav Journal of Operations Research
Similarity:
Efficiency and Duality for Multiobjective Fractional Variational Problems With -Quasiinvexity
Ştefan Mititelu, I. M. Stancu-Minasian (2009)
The Yugoslav Journal of Operations Research
Similarity:
News
(1999)
Kybernetika
Similarity:
On the implicit programming approach in a class of mathematical programs with equilibrium constraints
Jiří Outrata, Michal Červinka (2009)
Control and Cybernetics
Similarity:
Efficiency and Duality in Nonsmooth Multiobjective Fractional Programming Involving η-pseudolinear Functions
S.K. Mishra, B.B. Upadhyay (2012)
The Yugoslav Journal of Operations Research
Similarity:
Duality theorems for a class of non-linear programming problems.
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.