On the achievement stability set for parametric linear goal programming problems
| Autor: | F. A. Farahat, M. S. Osman, M. A. Maaty |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
Linear goal programming Stability (learning theory) 010103 numerical & computational mathematics 02 engineering and technology Management Science and Operations Research 01 natural sciences Measure (mathematics) Intelligent modeling Computer Science Applications Management Information Systems Set (abstract data type) Conflicting objectives Goal programming 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0101 mathematics Information Systems Mathematics Parametric statistics |
| Zdroj: | OPSEARCH. 54:181-200 |
| ISSN: | 0975-0320 0030-3887 |
| DOI: | 10.1007/s12597-016-0275-4 |
| Popis: | Goal Programming (GP) has many significant advances in recent years, particularly in the area of intelligent modeling and solution analysis as it is a powerful and effective methodology for the modeling, solution, and analysis of problems having multiple and conflicting objectives. This paper presents an algorithm for investigating the achievement stability set for parametric linear goal programming problems when parameters exist in the objective function. To avoid the complexity of this problem, the iterative approach in Dauer and Krueger (Oper Res Quart 28(3 Part 2):671–681, 1977) will be used to solve it. This model has been handled because it is very easy for the decision maker to put the weights for goals but, for the sub-goals it will be difficult as they have the same measure. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink