Generalized goal programming: polynomial methods and applications
From MaRDI portal
Recommendations
Cited in
(15)- A survey of generalized goal programming (1970-1982)
- Generalized goal programming and variational inequalities
- 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
- Combining Minsum And Minmax: A Goal Programming Approach
- On a robustness property in single-facility location in continuous space
- scientific article; zbMATH DE number 6025299 (Why is no real title available?)
- scientific article; zbMATH DE number 970028 (Why is no real title available?)
- Mathematical optimization modelling for group counterfactual explanations
- On contextual inverse multiobjective problems
- Goal programming becomes most useful using \(L_ 1\)-smoothing functions
- 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
This page was built for publication: Generalized goal programming: polynomial methods and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396216)