Generalized goal programming: polynomial methods and applications
From MaRDI portal
Publication:1396216
DOI10.1007/s10107-002-0303-4zbMath1065.90066MaRDI QIDQ1396216
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/44835
90C60: Abstract computational complexity for mathematical programming problems
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
90C51: Interior-point methods
Related Items
On a robustness property in single-facility location in continuous space, Deriving weights in multiple-criteria decision making with support vector machines, An interior-point method for the single-facility location problem with mixed norms using a conic formulation, A biobjective approach to recoverable robustness based on location planning, Planar multifacility location problems with tree structure and finite dominating sets, A general approach for studying duality in multiobjective optimization, Duality for vector optimization problems via a general scalarization