C. Romero. Handbook of Critical Issues in Goal Programming. Pergamon Press, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Solving Multi-Objective Models With GAMS - Kalvelagen (2002) (Correct)
....is called Sequential Linear Goal Programming (SGLP) somehow the order is mixed up in the acronym) An example of a preemptive goal programming formulation of a budget al..location problem is described in section 5. For more information on goal programming see the following references: 3] 4] [10], 11] 3. The Capital Budgeting problem The Capital Budgeting problem is related to the knapsack problem [13] The goal is to select projects to invest in, such that benefits are maximized. A project i will need a capital expenditure C i . The benefits of investing in project i are realized ....
C. Romero, Handbook of critical issues in goal programming, Pergamon Press, 1991.
Approximation Techniques for the Set of Efficient Points - Fliege (2001) (Correct)
....was proposed to estimate executive compensation. Since then, and thanks to its versatility and ease of use, it has become the by far most popular technique for tackling (linear) multiple objective problems, as evidenced by the bulk of literature on theory and applications of the field. See, e.g. [79, 84, 90, 89] and the categorized bibliography of applications therein. By a Non Preemptive Goal Programming problem one usually means some particular instance of the following model: a polyhedron P IR m is given as the set of decisions; there exist N criteria matrices, C 1 ; CN , with C j in IR ....
....: dN (x) where is a norm in IR N assumed to be (IR N ; IR ) monotone on IR N , see [6, 57] Then, the solution(s) minimizing the overall deviation are sought. In other words, one solves the convex program inf x2P (d 1 (x) dN (x) 4. 1) As pointed out e.g. in [19, 78, 79], Non Preemptive Goal Programming and related models can be rephrased as minimum distance problems. This follows from the previous formulation, since (4.1) is equivalent to minimize ( 1 (C 1 x z 1 ) N (C N x z N ) subject to x 2 P; z j 2 T j (j = 1; N) 4.2) ....
[Article contains additional citation context not shown here]
C. Romero. Handbook of Critical Issues in Goal Programming. Pergamon Press, Oxford, 1991.
Regional Model For Rural Land Use Planning: An Application .. - Nhantumbo Dent Kowero (Correct)
.... allowed the evaluation of the tradeoffs amongst the objectives according to associated weights (see results) Weighted Goal Programming (WGP) simultaneously considers all goals in a composite objective function minimizing the deviations between goals and aspiration levels (Romero and Rehman 1989; Romero 1991). The objective function of a WGP model is meaningless when it aggregates incommensurable deviational variables (Romero 1991) Therefore, a normalisation method which scales the deviational variables using relative percentages was used. Besides reducing significantly the range of units which can ....
.... Programming (WGP) simultaneously considers all goals in a composite objective function minimizing the deviations between goals and aspiration levels (Romero and Rehman 1989; Romero 1991) The objective function of a WGP model is meaningless when it aggregates incommensurable deviational variables (Romero 1991). Therefore, a normalisation method which scales the deviational variables using relative percentages was used. Besides reducing significantly the range of units which can affect results of models run in the simplex algorithm, it provides meaningful results because the objective function is a sum ....
ROMERO, C.1991. Handbook of critical issues in goal programming. Oxford: Pergamon..
Tabu Search for Multiobjective Optimization: MOTS - Hansen (1997) (10 citations) (Correct)
....the l weighted objective function whenever the step size is exceeded. 11 This is also a critique on e.g. the traditional Goal Programming (GP) approach, raised by for instance Zeleny (1981) and Rosenthal (1985) Ironically, GP has been one of the most used techniques in practical applications (Romero, 1991), also in combinatorial optimization (Ulungu and Teghem, 1994) This author has applied an GP alike approach to a special and very large practical assignment problem containing no less than 12 One problem in a full generation of the non dominated set with non iterative solution generation ....
Romero, C. (1991), Handbook of critical issues in goal programming, Pergamon Press.
Database-Inspired Search - David Konopnicki And (2005) (Correct)
No context found.
C. Romero. Handbook of Critical Issues in Goal Programming. Pergamon Press, 1991.
Non-linear Goal Programming Using Multi-Objective Genetic.. - Kalyanmoy Deb Kanpur (1998) (6 citations) (Correct)
No context found.
Romero, C. (1991). Handbook of critical issues in goal programming. Oxford: Pergamon Press.
Non-linear Goal Programming Using Multi-Objective Genetic Algorithms - Deb (1998) (6 citations) (Correct)
No context found.
Romero, C. (1991). Handbook of critical issues in goal programming. Oxford: Pergamon Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC