Big Chemical Encyclopedia

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

Articles Figures Tables About

Objective functions

The objective function can assume different representation with regards to the system under study. A commonly used objective of an industrial process is to maximize profit or to minimize the overall costs. The former is adopted in this work. In this model, the whole refinery is considered to be one process, where the process uses a given petroleum crude to produce various products in order to achieve specific economic objectives. Thus, the objective of the optimization at hand is to achieve maximum profitability given the type of crude oil and the refinery facilities. No major hardware change in the current facilities is considered in this problem. The [Pg.47]

GREGPLUS treats full or block-rectangular data structures, using the objective function S 6) = —2 np 6 y). This gives [Pg.148]

Having set the model and chosen the training data, the objective is to fit the model predictions to the targets. The simplest and most widely used numerical approach is to formulate a single objective function, h, usually in the form of the least squares. [Pg.245]

The statistical weight represents the degree of confidence we have in the measurement. Rigorously, Wg can be set inversely proportional to the uncertainty of the experimental measurement, e.g., 1 / t, with [Pg.245]

Considering the different nature and magnitude of observed properties, it is often more appropriate to minimize the relative deviations, with the objective function taking the form [Pg.246]

variables y in equation (2) may be set equal to the logarithms of the observed properties examples of such may include species concentrations and induction times. [Pg.246]

The objective function may take the form of the likelihood or posterior distribution functions [5]. It is pertinent to mention that maximization of the likelihood function in case of independent normally distributed errors leads to the sum-of-squares (SOS) of the residuals, such as given by equation (1). Another approach to fitting multiple training targets is to use multi-objective optimization, which is concerned with simultaneous optimization of a set of objectives. [Pg.246]

In addition to their ability to capture the multidimensionality of batch operations, another advantage of mathematical programming techniques is the flexibility and adaptability of the performance index, i.e. the objective function. In a design problem, the objective function can take a form of a capital cost investment function. In a scheduling problem it can be minimization of makespan, maximization of throughput, maximization of revenue, etc. In this chapter, the objective function will either [Pg.84]

The objective of the formulation is to minimize the amount of freshwater required, hence the amount of wastewater generated, over the 1.5 h time horizon as shown [Pg.85]

All the results presented in this section were obtained using different GAMS solvers in a 1.82 GHz Pentium 4 processor. The results presented in this chapter were not compared with those obtained by Wang and Smith (1995), since the latter method [Pg.85]

4 Wastewater Minimisation in Multiproduct Batch Plants Single Contaminants [Pg.86]

Scenario 1 Formulation for fixed outlet concentration without reusable water storage [Pg.86]

27 The reader interested in a detailed discussion of inventory management is referred to Tempelmeier (2006) and to Graves and Willems (2003) for a discussion of how to spread safety stocks across the supply chain. [Pg.67]

28 For an overview of investment appraisal calculation methods see for example Gotze and Bloech (2002) or Perridon and Steiner (2006). [Pg.67]

The principle of the NPV method is to forecast over time all cash flows associated with an investment. Each period s net cash flows are then discounted to the present.29 As discount rate usually the company s cost of capital is used because in this case a positive NPV indicates that the investment increases the company s value (cf. Rappaport 1998, p. 37 see Appendix 1 for a detailed discussion of how to derive the appropriate discount rate). The calculation of the NPV is based on the following formula  [Pg.68]

C( = Net cash flow at the end of period t TVs = Terminal value at the end of period N rt = Discount rate in period t [Pg.68]

The objective function of a supply network design model can either minimize costs or maximize profits. In practice the production function is often required to assume that all forecasted demands have to be met. In this constellation cost minimization and profit maximization lead to identical results and consequently cost minimization models are used. From an economic perspective this simplification can be justified in cases where a high share of fixed costs allows the assumption that any product sale con- [Pg.68]


As indicated in Chapter 6, and discussed in detail by Anderson et al. (1978), optimum parameters, based on the maximum-likelihood principle, are those which minimize the objective function... [Pg.67]

For binary vapor-liquid equilibrium measurements, the parameters sought are those that minimize the objective function... [Pg.98]

The equation systems representing equilibrium separation calculations can be considered multidimensional, nonlinear objective functions... [Pg.115]

For liquid-liquid systems, the separations are isothermal and the objective function is one-dimensional, consisting of Equation (7-17). However, the composition dependence of the... [Pg.117]

For bubble and dew-point calculations we have, respectively, the objective functions... [Pg.118]

The Newton-Raphson approach, being essentially a point-slope method, converges most rapidly for near linear objective functions. Thus it is helpful to note that tends to vary as 1/P and as exp(l/T). For bubble-point-temperature calculation, we can define an objective function... [Pg.118]

In application of the Newton-Raphson iteration to these objective functions [Equations (7-23) through (7-26)], the near linear nature of the functions makes the use of step-limiting unnecessary. [Pg.119]

Equations (7-8) and (7-9) are then used to calculate the compositions, which are normalized and used in the thermodynamic subroutines to find new equilibrium ratios,. These values are then used in the next Newton-Raphson iteration. The iterative process continues until the magnitude of the objective function 1g is less than a convergence criterion, e. If initial estimates of x, y, and a are not provided externally (for instance from previous calculations of the same separation under slightly different conditions), they are taken to be... [Pg.121]

In the case of the adiabatic flash, application of a two-dimensional Newton-Raphson iteration to the objective functions represented by Equations (7-13) and (7-14), with Q/F = 0, is used to provide new estimates of a and T simultaneously. The derivatives with respect to a in the Jacobian matrix are found analytically while those with respect to T are found by finite-difference approximation... [Pg.121]

Liquid-liquid equilibrium separation calculations are superficially similar to isothermal vapor-liquid flash calculations. They also use the objective function. Equation (7-13), in a step-limited Newton-Raphson iteration for a, which is here E/F. However, because of the very strong dependence of equilibrium ratios on phase compositions, a computation as described for isothermal flash processes can converge very slowly, especially near the plait point. (Sometimes 50 or more iterations are required. )... [Pg.124]

Subroutine FUNDR. This subroutine calculates the required derivatives for REGRES by central difference, using EVAL to calculate the objective functions. [Pg.218]

A step-limited Newton-Raphson iteration, applied to the Rachford-Rice objective function, is used to solve for A, the vapor to feed mole ratio, for an isothermal flash. For an adiabatic flash, an enthalpy balance is included in a two-dimensional Newton-Raphson iteration to yield both A and T. Details are given in Chapter 7. [Pg.319]

DFA Partial derivative of the Rachford-Rice objective function (7-13) with respect to the vapor-feed ratio. [Pg.321]

FIND EQUILIBRIUM OBJECTIVE FUNCTION F AND UNNORMALIZEO COMPOSITIONS... [Pg.324]

FIND ENTHALPY OBJECTIVE FUNCTION G lAOIABATICI 255 CALL ENTH(N lOfKEEfOtX TNyPfHLfER)... [Pg.325]

FIND NORM OF OBJECTIVE FUNCTION AND CHECK FOR DECREASE 260 FV ABS(F)... [Pg.325]

APPLY STEP-LIMITING PROCEDURE TO DECREASE OBJECTIVE FUNCTION 265 KD=l... [Pg.325]

Bubble-point temperature or dew-point temperatures are calculated iteratively by applying the Newton-Raphson iteration to the objective functions given by Equations (7-23) or (7-24) respectively. [Pg.326]

Change in extract-feed ratio from one iteration to the next. Partial derivative of Rachford-Rice objective function with respect to extract-feed ratio. [Pg.335]

F Rachford-Rice objective function for liquid-liquid separa-... [Pg.335]

Secondly, the linearized inverse problem is, as well as known, ill-posed because it involves the solution of a Fredholm integral equation of the first kind. The solution must be regularized to yield a stable and physically plausible solution. In this apphcation, the classical smoothness constraint on the solution [8], does not allow to recover the discontinuities of the original object function. In our case, we have considered notches at the smface of the half-space conductive media. So, notche shapes involve abrupt contours. This strong local correlation between pixels in each layer of the half conductive media suggests to represent the contrast function (the object function) by a piecewise continuous function. According to previous works that we have aheady presented [14], we 2584... [Pg.326]

The object function we have to estimate is the relative conductivity fi = ——... [Pg.331]

Unconstrained optimization methods [W. II. Press, et. ah, Numerical Recipes The An of Scieniific Compulime.. Cambridge University Press, 1 9H6. Chapter 101 can use values of only the objective function, or of first derivatives of the objective function. second derivatives of the objective function, etc. llyperChem uses first derivative information and, in the Block Diagonal Newton-Raphson case, second derivatives for one atom at a time. TlyperChem does not use optimizers that compute the full set of second derivatives (th e Hessian ) because it is im practical to store the Hessian for mac-romoleciiles with thousands of atoms. A future release may make explicit-Hessian meth oils available for smaller molecules but at this release only methods that store the first derivative information, or the second derivatives of a single atom, are used. [Pg.303]

We shall investigate the problem of controlling the external forces with an objective functional describing the crack opening... [Pg.130]

Here and below we emphasize the dependence of the objective functional on 5, because later we shall investigate the convergence of the solutions of problem (2.189) as 5 —> 0. [Pg.130]

We note that if the crack opening is zero on F,, i.e. [%] = 0, the value of the objective functional Js u) is zero. We also assume that near F, the punch does not interact with the shell. It turns out that in this case the solution X = (IF, w) of problem (2.188) is infinitely differentiable in a neighbourhood of points of the crack. This property is local, so that a zero opening of the crack near the fixed point guarantees infinite differentiability of the solution in some neighbourhood of this point. Here it is undoubtedly necessary to require appropriate regularity of the curvatures % and the external forces u. The aim of the following discussion is to justify this fact. At this point the external force u is taken to be fixed. [Pg.131]

Combinatorial. Combinatorial methods express the synthesis problem as a traditional optimization problem which can only be solved using powerful techniques that have been known for some time. These may use total network cost direcdy as an objective function but do not exploit the special characteristics of heat-exchange networks in obtaining a solution. Much of the early work in heat-exchange network synthesis was based on exhaustive search or combinatorial development of networks. This work has not proven useful because for only a typical ten-process-stream example problem the alternative sets of feasible matches are cal.55 x 10 without stream spHtting. [Pg.523]


See other pages where Objective functions is mentioned: [Pg.117]    [Pg.120]    [Pg.139]    [Pg.321]    [Pg.321]    [Pg.323]    [Pg.339]    [Pg.326]    [Pg.326]    [Pg.330]    [Pg.332]    [Pg.217]    [Pg.469]    [Pg.628]    [Pg.524]    [Pg.303]    [Pg.128]    [Pg.526]   
See also in sourсe #XX -- [ Pg.469 ]

See also in sourсe #XX -- [ Pg.205 ]

See also in sourсe #XX -- [ Pg.391 ]

See also in sourсe #XX -- [ Pg.21 ]

See also in sourсe #XX -- [ Pg.82 , Pg.172 ]

See also in sourсe #XX -- [ Pg.352 , Pg.368 ]

See also in sourсe #XX -- [ Pg.353 ]

See also in sourсe #XX -- [ Pg.199 ]

See also in sourсe #XX -- [ Pg.46 ]

See also in sourсe #XX -- [ Pg.30 , Pg.31 , Pg.32 , Pg.125 ]

See also in sourсe #XX -- [ Pg.242 ]

See also in sourсe #XX -- [ Pg.205 ]

See also in sourсe #XX -- [ Pg.27 , Pg.116 , Pg.117 , Pg.121 , Pg.136 , Pg.137 , Pg.138 , Pg.141 , Pg.160 , Pg.164 , Pg.165 , Pg.193 , Pg.204 , Pg.205 , Pg.206 , Pg.208 , Pg.220 , Pg.222 , Pg.223 , Pg.224 , Pg.236 , Pg.252 , Pg.276 , Pg.377 , Pg.386 , Pg.388 ]

See also in sourсe #XX -- [ Pg.2 , Pg.36 , Pg.43 , Pg.51 , Pg.115 ]

See also in sourсe #XX -- [ Pg.59 ]

See also in sourсe #XX -- [ Pg.183 ]

See also in sourсe #XX -- [ Pg.14 , Pg.16 ]

See also in sourсe #XX -- [ Pg.20 ]

See also in sourсe #XX -- [ Pg.264 , Pg.290 ]

See also in sourсe #XX -- [ Pg.861 ]

See also in sourсe #XX -- [ Pg.155 ]

See also in sourсe #XX -- [ Pg.177 ]

See also in sourсe #XX -- [ Pg.46 ]

See also in sourсe #XX -- [ Pg.188 , Pg.189 ]

See also in sourсe #XX -- [ Pg.94 ]

See also in sourсe #XX -- [ Pg.68 , Pg.69 , Pg.70 ]

See also in sourсe #XX -- [ Pg.41 , Pg.42 ]

See also in sourсe #XX -- [ Pg.220 ]

See also in sourсe #XX -- [ Pg.432 ]

See also in sourсe #XX -- [ Pg.391 ]

See also in sourсe #XX -- [ Pg.7 ]

See also in sourсe #XX -- [ Pg.71 , Pg.76 , Pg.167 , Pg.169 , Pg.244 , Pg.245 , Pg.264 ]

See also in sourсe #XX -- [ Pg.93 , Pg.94 , Pg.95 , Pg.96 , Pg.97 , Pg.98 , Pg.99 , Pg.100 , Pg.101 , Pg.259 , Pg.261 , Pg.312 , Pg.333 , Pg.335 , Pg.337 , Pg.339 , Pg.340 ]

See also in sourсe #XX -- [ Pg.24 , Pg.36 , Pg.45 , Pg.64 , Pg.71 , Pg.108 , Pg.109 , Pg.114 , Pg.173 , Pg.174 , Pg.198 , Pg.199 , Pg.201 , Pg.257 , Pg.258 ]

See also in sourсe #XX -- [ Pg.108 , Pg.109 , Pg.110 , Pg.115 , Pg.203 , Pg.237 , Pg.238 , Pg.239 , Pg.303 , Pg.330 , Pg.349 , Pg.354 ]

See also in sourсe #XX -- [ Pg.13 , Pg.110 , Pg.275 , Pg.276 , Pg.277 ]

See also in sourсe #XX -- [ Pg.358 , Pg.359 , Pg.360 ]

See also in sourсe #XX -- [ Pg.340 , Pg.343 ]

See also in sourсe #XX -- [ Pg.124 ]

See also in sourсe #XX -- [ Pg.245 , Pg.246 , Pg.247 , Pg.248 , Pg.256 , Pg.257 , Pg.268 , Pg.271 , Pg.280 ]

See also in sourсe #XX -- [ Pg.187 , Pg.189 , Pg.191 , Pg.355 , Pg.359 ]

See also in sourсe #XX -- [ Pg.262 , Pg.265 ]

See also in sourсe #XX -- [ Pg.171 ]

See also in sourсe #XX -- [ Pg.3 , Pg.2177 ]

See also in sourсe #XX -- [ Pg.689 , Pg.697 ]

See also in sourсe #XX -- [ Pg.15 ]

See also in sourсe #XX -- [ Pg.432 ]




SEARCH



Alternative objective function

Autonomous objective functional

Biological objective functions

Biological objective functions and optimization

Bound quadratic objective function

Chemical reactors objective functions

Choice of objective functions

Classifying objective functions

Components for modelling the objective function

Defining the Objective Function

Design process objective function

Economic-Based Performance Objective Functions

Eigen symmetrical and antisymmetric functions of non-localized objects

Empirical objective functions

Equality objective function

Evaluation objective function

Formulation of the Economic Objective Function

Formulation of the Objective Function

Function shared object

Functional hazard analysis objectives

Functional persons/objects

Generic objective function

Lagrange Multiplier and Objective Functional

Lagrange objective function

Laplace object function

Linear objective function

Mathematical model objective function

Modified objective function

Molecular function objective functional derivative

Multisite objective function

Non-linear objective functions

Object function

Object function

Objective Function Using a Valuation Method

Objective Function and Decision Variables

Objective Functions and Factors

Objective calibration function

Objective function algebraic

Objective function conflicting

Objective function contours

Objective function integration

Objective function material

Objective function methods, optimization

Objective function of the optimization

Objective function simplification

Objective function stoichiometric

Objective function value

Objective function weighted

Objective function with operating costs

Objective function, aggregate planning

Objective function, definition

Objective function, least-squares

Objective functional

Objective functional concept, optimal control

Optimal objective function

Optimisation: problem objective function

Optimization formulation objective function

Optimization objective function

Overlay objective function

Parameter Estimation The Objective Function

Performance Function for Objective Forms

Process optimization nonlinear objective function problems

Quadratic objective function

Resolution objective function

Schwarzschild objective function

Search objective function constant

Selectivity optimization objective functions

Simplification Linearization Objective function

Single objective function

Stochastic objective function

Stochastic objective function constraints

Synthesis multiple objective function

The Linear Least Squares Objective Function

The Objective Function

Variation of an Integral Objective Functional

Various objective functions used in optimal control of crystallization

© 2024 chempedia.info