Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Preemptive Goal Programming

For the three criteria supplier order allocation problem (Section 6.4.2), the preemptive GP formulation will be as follows  [Pg.336]

Method for solving preemptive goal program is given in Arthur and Ravindran (1980) and Masud and Ravindran (2008,2009). [Pg.337]


A.6 Partitioning Algorithm for Preemptive Goal Programs A.6.1 Linear Goal Programs... [Pg.502]

Because the multiple objectives stated by supply chain managers are formulated as goal constraints with allowable deviations in the tactical submodel, the objective function is formulated to minimize some function of the deviations. Here, two different goal programming techniques are considered preemptive and non-preemptive goal programming. With non-preemptive... [Pg.114]

The objectives considered in the multi-criteria model conflicted with one another. Non-preemptive goal programming with ideal values as targets was used to obtain the best possible solution that represented the decision makers preferences. Because the criteria were conflicting, it was not possible to achieve any of the ideal values. Table 5.6 shows how much of each criterion was achieved and the percent difference from the ideal values for Scenarios 6 and 8. As can be observed, in both scenarios, the power objective was almost fully met but the credit performance was not met very much at all. This happened because very few customers had low ratings (two customers had power ratings below 5 out of 10 and two had credit performance ratings below 5 as well) and two of them were selected. [Pg.156]

This section discusses the solution techniques for solving the proposed multicriteria optimization model. To solve the multiple and conflicting objectives model, we use preemptive goal programming (P-GP), non-preemptive goal programming (NP-GP), and the interactive method. [Pg.210]

Incorporating Disruption Risk in a Supply Chain Network Design Model 211 7A.3.1 Preemptive Goal Programming Model... [Pg.211]

In our model, it is assumed that the decision maker ranks the priorities (from high to low) as PI profit, P2 delivery time, P3 facility disruption risk, P4 transportation link disruption risk, and P5 unfulfilled demand. Hence, the objective function for the goal programming model is to minimize the deviations from the target values defined for each objective. For instance, minimize the negative deviation of the profit (dr)/ minimize the positive deviation of the delivery lead time (d ), minimize the positive deviation of the facility disruption risk (d ), minimize the positive deviation of the transportation disruption risk (d ), and minimize the positive deviation of the unfulfilled demand (d ). The preemptive goal programming formulation would be as follows. [Pg.211]

Krikke et al. (2003) Minimize cost, nunimize energy use, nimimize waste MILP, solved using non-preemptive goal programming Tactical... [Pg.231]


See other pages where Preemptive Goal Programming is mentioned: [Pg.336]    [Pg.336]    [Pg.336]    [Pg.337]    [Pg.342]    [Pg.342]    [Pg.342]    [Pg.342]    [Pg.343]    [Pg.357]    [Pg.469]    [Pg.474]    [Pg.500]    [Pg.501]    [Pg.44]    [Pg.44]    [Pg.45]    [Pg.115]    [Pg.115]    [Pg.124]    [Pg.131]    [Pg.145]    [Pg.145]    [Pg.147]    [Pg.147]    [Pg.158]    [Pg.189]    [Pg.189]    [Pg.211]    [Pg.267]    [Pg.267]    [Pg.267]    [Pg.267]    [Pg.278]    [Pg.279]    [Pg.283]    [Pg.283]    [Pg.283]   


SEARCH



Non-Preemptive Goal Programming

Preemptive Goal Programming Solution

Program goals

© 2024 chempedia.info