Similar Search Results

CONE CONVEX AND RELATED FUNCTIONS IN OPTIMIZATION OVER TOPOLOGICAL VECTOR SPACES

SUNEJA, S. K.; BHATIA, MEETU - In: Asia-Pacific Journal of Operational Research (APJOR) 24 (2007) 06, pp. 741-754

. Assuming the functions to be cone subconvex, sufficient optimality conditions are proved for a vector valued minimization … duality results are proved. …

Persistent link: https://www.econbiz.de/10004977552

Unified duality for vector optimization problem over cones involving support functions

Suneja, Surjeet Kaur; Louhan, Pooja - In: RAIRO / Operations research 48 (2014) 3, pp. 271-302

Persistent link: https://www.econbiz.de/10010530200

Optimality and duality in vector optimization problems involving arcwise connected d-type-I functions over cones

Suneja, Surjeet Kaur; Sharma, Megha - In: Opsearch : journal of the Operational Research Society … 52 (2015) 4, pp. 884-902

Persistent link: https://www.econbiz.de/10011446166

Optimality and duality for vector optimization problem with non-convex feasible set

Suneja, S. K.; Sharma, Sunila; Yadav, Priyanka - In: Opsearch : journal of the Operational Research Society … 57 (2020) 1, pp. 1-12

Persistent link: https://www.econbiz.de/10012229915

Sufficiency and duality for optimization problems involving interval-valued invex functions in parametric form

Jayswal, Anurag; Stancu-Minasian, Ioan; Banerjee, Jonaki; … - In: Operational research : an international journal 15 (2015) 1, pp. 137-161

Persistent link: https://www.econbiz.de/10011388364

Duality and saddle-points for convex-like vector optimization problems on real linear spaces

Adán, Miguel; Novo, Vicente - In: TOP: An Official Journal of the Spanish Society of … 13 (2005) 2, pp. 343-357

Persistent link: https://www.econbiz.de/10005371453

Primal and dual approximation algorithms for convex vector optimization problems

Löhne, Andreas; Rudloff, Birgit; Ulus, Firdevs - In: Journal of Global Optimization 60 (2014) 4, pp. 713-736

and constraint functions that are not necessarily differentiable, allow solid pointed polyhedral ordering cones, and …

Persistent link: https://www.econbiz.de/10011151248

A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming

Ehrgott, Matthias; Löhne, Andreas; Shao, Lizhen - In: Journal of Global Optimization 52 (2012) 4, pp. 757-778

Persistent link: https://www.econbiz.de/10010994025

Benson type algorithms for linear vector optimization and applications

Hamel, Andreas; Löhne, Andreas; Rudloff, Birgit - In: Journal of Global Optimization 59 (2014) 4, pp. 811-836

polyhedral ordering cones. Numerical examples are provided, one of them involving a new set-valued risk measure for multivariate …

Persistent link: https://www.econbiz.de/10010994156

Multiobjective DC programs with infinite convex constraints

Qu, Shaojian; Goh, Mark; Wu, Soon-Yi; Souza, Robert - In: Journal of Global Optimization 59 (2014) 1, pp. 41-58

optimality conditions for the weak Pareto efficiency are introduced. Further, we seek a connection between multiobjective linear … converse duality theorems are derived for these two problems respectively. We also extend above results to multiobjective …

Persistent link: https://www.econbiz.de/10010845827