Sufficient conditions and duality for multiobjective variational problems with generalized B-invexity
B. Aghezzaf, K. Khazafi (2004)
Control and Cybernetics
Similarity:
B. Aghezzaf, K. Khazafi (2004)
Control and Cybernetics
Similarity:
Massimiliano Ferrara, Maria Viorica Stefanescu (2008)
The Yugoslav Journal of Operations Research
Similarity:
Antoan Bătătorescu, Miruna Beldiman, Iulian Antonescu, Roxana Ciumara (2009)
The Yugoslav Journal of Operations Research
Similarity:
I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)
The Yugoslav Journal of Operations Research
Similarity:
Ştefan Mititelu, I. M. Stancu-Minasian (2009)
The Yugoslav Journal of Operations Research
Similarity:
(1999)
Kybernetika
Similarity:
Jiří Outrata, Michal Červinka (2009)
Control and Cybernetics
Similarity:
S.K. Mishra, B.B. Upadhyay (2012)
The Yugoslav Journal of Operations Research
Similarity:
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.