Generalized goal programming: polynomial methods and applications
From MaRDI portal
Publication:1396216
DOI10.1007/s10107-002-0303-4zbMath1065.90066OpenAlexW2080988355MaRDI 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
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (7)
On a robustness property in single-facility location in continuous space ⋮ A general approach for studying duality in multiobjective optimization ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ 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 ⋮ Duality for vector optimization problems via a general scalarization
This page was built for publication: Generalized goal programming: polynomial methods and applications
