EFFICIENT STRUCTURES OF ACHIEVEMENT FUNCTIONS FOR GOAL PROGRAMMING MODELS
From MaRDI portal
Publication:3502859
DOI10.1142/S0217595907001516zbMath1200.90146OpenAlexW2009157835MaRDI QIDQ3502859
Publication date: 20 May 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595907001516
Related Items (6)
A multi-stage multi criteria model for portfolio management ⋮ An efficient approach for the S‐shaped penalty function ⋮ Solving multi-period project selection problems with fuzzy goal programming based on TOPSIS and a fuzzy preference relation ⋮ A new approach of Romero's extended lexicographic goal programming: fuzzy extended lexicographic goal programming ⋮ Interval goal programming for S-shaped penalty function ⋮ Selecting the best supply chain by goal programming and network data envelopment analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general structure of achievement function for a goal programming model.
- An efficient method for solving linear goal programming problems
- Optimal Estimation of Executive Compensation by Linear Programming
- Extended interval goal programming
- Goal programming, compromise programming and reference point method formulations: linkages and utility interpretations
- Mixed binary interval goal programming
This page was built for publication: EFFICIENT STRUCTURES OF ACHIEVEMENT FUNCTIONS FOR GOAL PROGRAMMING MODELS