Big Chemical Encyclopedia

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

Articles Figures Tables About

Goal programming

In the following sections, we will discuss the MCMP methods—goal programming, compromise programming, and interactive methods, as examples of Category 1,2, and 3 type approaches, respectively. [Pg.42]

By assigning suitable weights wl and w on di and dt in the objective function, the model will try to achieve the sum x + X2 as close as possible to 3. If the goal were to satisfy Xi + X2 3, then only di is assigned a positive weight in the objective, while the weight on di is set to zero. [Pg.43]


Khuri and Conlon (19) utilized a noniterative ordering variation of goal programming to minimize a distance criterion between the optimum of individual responses of a conventional experimental... [Pg.66]

Ravi, V. and Reddy, P.J. (1998) Fuzzy linear fractional goal programming applied to refinery operations planning. Fuzzy Sets and Systems, 96, 173. [Pg.138]

Lee, S.M., "Goal Programming for Decision Analysis" Auer-vach Philadelphia, 1972. [Pg.325]

The classification in Figure 1.3 takes into account the recent developments and provides a good overview of available MOO methods. Relative merits and limitations of groups of methods are summarized in Table 1.1. A few of the MOO methods can be placed in another group. For example, weighting method in the a posteriori methods is a special case of value function methods in the a priori methods. The f-constraint method from the a posteriori methods and goal programming from... [Pg.10]

A Priori Methods (e.g., value function, lexicographic and goal programming methods) These have been studied and applied for a few decades. Their recent applications in chemical engineering are limited. These methods require preferences in advance from the DM, who may find it difficult to specify preferences with no/limited knowledge on the optimal objective values. They will provide one Pareto-optimal solution consistent with the given preferences, and so may be considered as efficient. [Pg.11]

Safety related decision making in chemical processes Simultaneous minimization of (1) total safety activity cost, (2) total accident consequence, (3) number of accident scenarios for unreasonable frequency, and (4) non-operating time. Goal programming Example considered has 30 accident scenarios. Kim et al. (2004)... [Pg.34]

Distillation Unit Simultaneous minimization of total annual cost and potential environmental impact Goal Programming Optimization was performed during design stage. Ramzan and Witt (2006)... [Pg.36]

Such spectrum can be obtained using goal programming, worst-case and best-case scenario maximization, and/or by a decomposition procedure based on the sampling average algorithm. [Pg.349]

In turn. Figure 12.21 shows the spectrum of solutions obtained using downside risk through goal programming. In this spectrum, several solutions that reduce risk even compared to the solution not using inventory can be found. Thus ... [Pg.356]

Computing Compromise Solutions and Goal Programming Solutions... [Pg.2602]

Interactive Methods of Compromise and Goal Programming Models 2612... [Pg.2602]

Definition 4.1. The compromise solution with respect to the / -norm is y 6 V, which minimizes r(y p) over Y, or is x 6 X, which minimizes r(f(x) p) over X. When the ideal point y is replaced by a specific goal or target point, the resulting compromise solution is called the goal programming solution with respect to the goal point. [Pg.2611]

Lee, S. M. (1972), Goal Programming for Decision Analysis, Auerback, Philadelphia. [Pg.2622]

Arunraj, N. S., Maiti, J. (2010). Risk-based maintenance policy selection using AHP and goal programming. Safety Science, 48, 238-247. [Pg.51]

Mission and goals Program educational objectives (Criterion 2)... [Pg.359]

Multi-objective goal programming (MOGoP) Multi-objective geometric programming (MOGeP)... [Pg.364]

The above bi-objective optimization problem can be transformed into a SOO problem by the -constraint method via making OFj as an additional constraint. Besides this method, goal programming and the weighted-sum method can also be used to convert the MOO problem into a SOO problem. Interested readers are referred to Chapter 4 for more details... [Pg.354]

Ramos, M.A., Boix, M., Montastruc, L. and Domenech, S. (2014) Multi-objective optimization using goal programming for industrial water network design. Industrial and Engineering Chemistry Research, 53 (45), 17722-17735. [Pg.373]

Bertolini, M. Bevilacqua, M. 2006. A combined goal programming - AHP approach to maintenance selection problem. Reliability Engineering System Safety 91 839-848. [Pg.571]


See other pages where Goal programming is mentioned: [Pg.290]    [Pg.117]    [Pg.308]    [Pg.9]    [Pg.10]    [Pg.31]    [Pg.68]    [Pg.183]    [Pg.339]    [Pg.344]    [Pg.345]    [Pg.538]    [Pg.2602]    [Pg.2602]    [Pg.2603]    [Pg.2608]    [Pg.2610]    [Pg.2612]    [Pg.2612]    [Pg.2614]    [Pg.2621]    [Pg.2622]    [Pg.2623]    [Pg.2754]    [Pg.186]    [Pg.349]    [Pg.429]    [Pg.211]   
See also in sourсe #XX -- [ Pg.9 ]




SEARCH



Program goals

© 2024 chempedia.info