|
|
||||||||
Department of Agricultural and Applied Economics, University of Wisconsin, Madison 53706
E-mail: josephburke{at}wisc.edu
| ABSTRACT |
|---|
|
|
|---|
Key Words: cheese optimization mathematical programming milk protein concentrate
| INTRODUCTION |
|---|
|
|
|---|
One of the earliest mathematical programming models of cheese making was a linear program (LP) developed by Kerrigan and Norback (1986). Their model had 4 essential constraints plus any optional resource availability constraints. The cheese milk could be standardized in the model by skimming cream or with the addition of any of 4 inputs: raw milk, NDM, skim milk, and condensed milk.
More recently, Papadatos et al. (2002) published a nonlinear programming (NLP) model of cheese manufacture. This model used 42 constraints to describe the cheese-making process. The Papadatos et al. (2002) model allowed for an arbitrary number of possible standardization methods, including the removal of cream or the addition of raw milk, ultra- or microfiltered milk, or NDM. This model was later extended by Papadatos et al. (2003) to evaluate the economic feasibility of microfiltration prior to cheese making. Their study used the same description of cheese manufacturing as the 2002 study, but the new model included an additional set of constraints to describe the microfiltration process, whereby some of the available milk is first microfiltered before it is added in the cheese milk.
In addition to the Kerrigan and Norback (1986) and the Papadatos et al. (2002, 2003) models, a third model of cheese manufacture was developed by Barcenas in her dissertation (Barcenas, 1999). The Barcenas model is a LP model, and it considers a large set of potential inputs, including ultrafiltered milk. Barcenas expressed the constraints on cheese manufacture on a component basis, and consequentially, her model is very similar to the model presented here, although not identical.
Although cheese manufacturers are assumed to maximize profit, their problem could be described as a net cost-minimization problem for a number of reasons. First, a manufacturer who maximizes profit automatically acts to minimize his production costs at the optimal production level, solving the problem described here as a subproblem within his profit-maximization problem. In the profit-maximization problem, the manufacturer chooses the level of inputs to be supplied and outputs produced to maximize his profit. This problem may be separated into 2 stages: the manufacturer first chooses his inputs to minimize his net costs for every possible production level and then chooses the production level that maximizes his profit. The net cost-minimization problem is, therefore, the first stage in this 2-stage profit-maximization problem. This is a standard result from the economic theory (Silberberg and Suen, 2001).
Second, if the solution to the net cost-minimization problem is scalable in the inputs and outputs, the profit-maximization problem can only be solved by assuming additional structure in the model. The models presented here possess this scaling property: increasing quantity of cheese to be produced by a factor increases the optimal quantity of cheese milk and input levels by that same factor. Net costs also increase by the same factor, as do profits under the ordinary assumption of a constant output price. If the cheese maker makes $1 on 10 lbs of cheese, he will make $100 on 1,000 lbs of cheese, and $1 million on 10 million lbs of cheese. The scale of production variable is unbounded, so the optimal quantity of cheese to produce is infinite. The net cost-minimization problem, however, has a solution at every possible scale of production, i.e., when the scale of production variable is held constant. Thus, the net cost problem may be solved even when the profit-maximization problem cannot.
Third, there are situations when the cost-minimal solution is more useful than a profit-maximization solution. Such situations occur when the price associated with the cheese produced may be difficult to derive or when the production level is fixed. The output price is difficult to derive, for instance, if a cheese maker wants to make a cheese for his personal consumption. The cheese is not sold, but he would still want to minimize the cost of producing the desired cheese. The cost-minimizing formulation of the problem may also be more useful when cheese is packaged jointly with other products, such as crackers. Here, there is no explicit price associated with the cheese, only the price of the cheese and crackers together. Cost-minimal solutions are also more useful than profit-maximal solutions when the production level is fixed by contract. In this case, the only flexibility the manufacturer has is in his cost decisions. In all of these examples, the formulation of the profit-maximization problem is either difficult to formulate or irrelevant, whereas the application of the net cost-minimization model to cheese production is still appropriate and straightforward.
In the next section, a conceptual model of dairy products is presented. The conceptual model is used to describe the inputs and outputs, but it may be used to describe any dairy product, including inputs not considered here. The third section develops a nonlinear model of the net cost minimization problem faced by the cheese manufacturer, as well as its linear approximation. This section also describes and gives justification for the constraints in the 2 models. The fourth section provides a solution algorithm for the nonlinear model. Two examples are given in the fifth section, one comparing results from the linear and nonlinear models and a second showing the yield implications of using ultrafiltered milk and milk protein concentrate in cheese production.
| MATERIALS AND METHODS |
|---|
|
|
|---|
Conceptual Model of Dairy Products
Throughout this paper, the letter k denotes a dairy product, and the set of dairy products is K. This set is arbitrary and varies from application to application. Dairy products considered here are cheese (che), whole milk (wm), skim milk (sm), cream (crm), NDM, milk protein concentrate (mpc), and on-site ultrafiltered milk (ufos). Thus, the set of dairy products is
![]() |
Therefore, the letter k is a generic element of K. On-site ultrafiltered milk and milk protein concentrate are together referred to as "ultrafiltered milk protein products."
The conceptual model of dairy products used here is to identify each product by 6 mutually exclusive and exhaustive components: fat (fat), casein (cas), whey protein (whe), lactose (lac), other solids (oth), and water (wat). In addition to these, I also make reference to the serum (ser), solids (sol), and serum solids (sersol) content of dairy products. The solids portion is defined as everything but the water, and the serum portion consists of the whey protein, lactose, other solids, and water. Serum solids are the solids portion of the serum: whey protein, lactose, and other solids. The set of all components is L, where l a generic element of L. From these definitions,
![]() |
The set of mutually exclusive and exhaustive components is
![]() |
Let
k,l be the percentage of l in product k, expressed as a ratio. Because the set
is exhaustive, it is true that
![]() |
This equation states that, for each product, the sum of the percentages of the exhaustive components for that product should account for 100% of the composition of the product. From the definition of the solids composition of dairy products, it is also true that
![]() |
The definition of the serum implies that
![]() |
Similarly, for serum solids it is true that
![]() |
Table 1
provides the composition assumptions used in the model. The cheese composition is similar to that of Cheddar cheese. The milk protein concentrate used in this model is MPC 70.
|
![]() |
[For legibility, Kx is written K(x) in subscripts.] For each k in K, the variable xk is the amount of that product used in cheese production. Additionally, let y be the amount of cream skimmed and z be the amount of cheese to be produced. Also note that cream is both an input and an output, as it may be either added to or skimmed from the cheese milk. Finally, the whey stream is also an output from the cheese-making process. This model does not consider the processing of the whey stream, but values the whey stream on a component basis. Accordingly, for each component l in L, the corresponding variable wl is the amount of component l in the whey stream.
Models of Cheese Manufacture
Let X be the mass of the cheese milk, calculated as the sum of the masses of the inputs less the mass of skimmed cream:
![]() | [1] |
For all l, Xl will denote the quantity of component l in the cheese milk. [For legibility, Xl is written X(l) in subscripts.] These are calculated as the sum, by component, of all inputs less skimmed cream (y):
![]() | [2] |
For l in the set {fat, cas}, let
l be the corresponding retention factor. Let
be the salt solids retention factor. The cheese yield is denoted in the same units as the Xl variables. Here, the units are assumed to be kilograms. The Van Slyke cheese yield formula is
![]() | [3] |
The numerator of this equation is the amount (in kg) of solids retained in the cheese from the cheese milk, and the denominator is the percent solids in each kg of cheese.
Of note is the salt solids retention factor,
, which enters the equation differently from the fat and casein retention factors. The salt solids retention factor reflects added salt plus the serum solids portion of the cheese milk. The Van Slyke formula incorporates the assumption that the amount of serum solids retained in the cheese is in fixed proportion to the fat and casein in the cheese milk.
When the amount of cheese produced is fixed at z, the assumptions underlying the Van Slyke formula imply an exact amount of fat and casein in the cheese milk. The fat retained from the cheese milk must be equal to the fat in the cheese:
![]() | [4] |
The left-hand side is the amount of fat in the cheese milk multiplied by the fat retention factor. The right-hand side of this equation is the amount of cheese to be manufactured multiplied by the amount of fat in each pound of cheese. Similarly, the casein retained from the cheese milk must equal the casein in the cheese:
![]() | [5] |
Equations 4 and 5 are the fat and casein requirements of the cheese milk, respectively. If these requirements are satisfied, a set of retention factors and a fixed ratio of
che,cas to
che,fat imply a fixed ratio of casein to fat in the cheese milk:
![]() | [6] |
Through this relationship, the levels of casein and fat required in the cheese milk are controlled through the cheese composition parameters and fat and casein retention factors. The composition of the cheese used in the model is determined by the type of cheese to be manufactured, and the retention factors are determined by the intended cheese, the method by which it is produced, and the skill of the manufacturer.
The common assumption used by cheese makers is that the serum solids composition of the cheese is identical to the serum solids composition of the cheese milk from which it was produced. This assumption means that the serum solids composition of the cheese varies depending on the method of standardization of the cheese milk. To distinguish the serum solids composition of the cheese from the other fixed compositions in the model, the variable compositions will be identified by
che,l. In each kilogram of cheese, the amount of each serum solid component per kilogram is
![]() | [7] |
Cheese makers face other constraints in addition to the fat and casein requirements of the cheese milk. The most fundamental of these is the set of mass balance constraints. These constraints occur in every production process and simply state that for each component, the amount of a component in the inputs must equal the amount of that same component in the outputs. Using the established notation, this set of constraints may be expressed as
![]() | [8] |
The equation for water is not included in Equation 8, as its inclusion makes the system of equations formed by Equations 2 and 8 linearly dependent. Substituting Equation 7 into 8 shows that the mass balance equations for the serum components are nonlinear, as Xsersol appears in the denominator. These equations are also not convex. The nonlinear equations, Equations 7 and 8, may be made linear and convex, however, by replacing the variable Xsersol with a parameter that approximates it, &Xcirc;sersol. The parameter z is already held constant in the problem. If &Xcirc;sersol is also constant, then all of the mass balance equations are linear, including those for the serum components. However, substituting the approximate &Xcirc;sersol for the exact Xsersol implies that the serum components in the whey stream will also be only approximations. Thus, for l in the set {whe, lac, oth}, wl is replaced with ŵl. The exact mass balance equations may now be approximated as
![]() | [9] |
Note that the Equations 8 and 9 are equal when Xsersol = &Xcirc;sersol.
Cheese makers also face a limit on the amount of lactose in the cheese. Ordinarily, this requirement is stated as a limit on the amount of lactose in the cheese milk. The common rule of thumb is that the lactose content of the cheese milk must be <5% of the cheese milk. Implicitly, this constraint assumes that the serum in the cheese milk is fixed. Under this assumption, a limit on the cheese milk results in a limit on the lactose in the cheese according to Equation 7. I suggest that this statement should be restated as a constraint on the lactose in the resulting cheese, instead of the cheese milk. Let µche,lac be the upper limit on the lactose in the cheese. From Equation 7, this implies
![]() | [10] |
which may be rearranged as a linear constraint,
![]() | [11] |
Cheese makers are also constrained by a limit on the viscosity of the cheese milk. Cheese milk is stirred by a machine in cheese manufacturing, but it cannot be stirred when the cheese milk is too thick with solids. This viscosity constraint is ordinarily expressed as an upper limit on the amount of solids in the cheese milk. Let µX,sol be the upper limit on the solids in the cheese milk. The constraint is
![]() | [12] |
which may be expressed as a linear constraint by multiplying through by X,
![]() | [13] |
The variable X is the mass of the cheese milk, and Xsol is the mass of solids in the cheese milk. This constraint could be replaced by similar limits on the amount of fat and casein in the cheese milk.
Cheese manufacturers may also be constrained by input availability. For all k in Kx, let µk be the amount of xk that is available for use in cheese manufacture. Any input availability constraints have the form
![]() | [14] |
This equation simply states that the amount of xk used in cheese manufacture cannot exceed what is available.
Cream may be added to or removed from the cheese milk, activities represented by the variables xcrm and y, respectively. The two variables have different associated costs in the objective function, ccrm and pcrm, also, respectively. If pcrm > ccrm, then the cheese maker may sell cream at a price higher than he purchases it and could potentially make an infinite amount of money by adding and removing an infinite amount of cream. The solution would also be unbounded if the cheese maker could acquire cream indirectly, such as by skimming it from whole milk, if the implicit price of cream in the whole milk was less than the price at which he could sell it, and if the supply of cream acquired in this manner is not bounded by other constraints. To prevent this, the amount of cream that may be removed is set to an arbitrary upper limit that is proportional to the amount of cheese to be produced. Let
be the upper limit on the cream that may be removed as a proportion of the cheese. The constraint is written as
![]() | [15] |
The objective function in the model is to minimize the net cost of producing the given quantity of cheese, z. The net cost is the net input cost plus any costs associated with processing the cheese milk. Let C be the net cost function, ck be the price associated with input xk, let pcrm be the price per pound of skimmed cream, and let rl be the value of whey stream component wl. The net input cost function is
![]() | [16] |
The net input cost is the cost per unit of the inputs, xk less any revenue generated by the skimmed cream, y, or from the whey stream, wl. For simplicity, this function is usually written as C0(x, y, w), where the dependence of costs on the constant price parameters c, p, and r is implicit. This particular formulation assumes the whey stream components are known exactly in the problem. If they are only known approximately, then ŵl substitutes for wl as appropriate.
The net input cost function is independent of cheese yield. To see this, assume two different methods of standardization may have the same net input cost but different cheese yields. Intuitively, one would expect a manufacturer faced with two such possibilities to choose the method with the higher cheese yield. This is a tradeoff between yields and costs not captured in the net input cost function. Let
be the yield, defined as the amount of cheese produced, z, per pound of cheese milk, X,
![]() | [17] |
Because X is a variable,
is a variable. This formula indicates that the trade-off between yield and costs can be captured through costs associated with the cheese milk variable X. I will here refer to costs associated with the quantity of cheese milk as vat costs, as the amount of cheese milk used to produce cheese is equal to the amount of vat capacity used. Let v be the vat costs. Vat costs are incorporated into the net input cost function to form the net cost function,
![]() | [18] |
Now 2 different methods of standardization may have the same net input cost C0, but if one method has a higher yield, then it will also have a lower net cost function C. Also, as before, if the whey stream components are only known approximately in the problem, then
l substitutes for wl as appropriate. The net cost function is the objective function to be minimized in the optimization problem.
Table 2
provides all of the parameter assumptions used in the model. The fat and casein retention factors are those for Cheddar cheese. The upper limit on the lactose to serum solids ratio, 0.80, corresponds roughly to a 5% upper limit on lactose in the cheese milk under ordinary standardization techniques. The limit on the amount of solids in the cheese milk is 0.15 or 15%. The vat cost is $0.037/kg of cheese milk, which is calibrated to the opportunity cost of unused capacity. This is approximately equal to the average yield per kilogram of cheese milk multiplied by the profit per kilogram of cheese. Assumptions used in calculating the vat cost are a yield of 0.10 and profits of $0.37/kg of cheese. The prices roughly correspond to 2002 prices from USDA. The milk protein price is the import price for 2002 reported by the U.S. International Trade Commission, and the on-site ultrafiltered milk price is an estimate.
|
![]() |
This set of equations constitutes the exact problem faced by the cheese maker, and it is nonlinear because of Equation 7. Thus, this is a NLP problem.
As stated earlier, the nonlinearity in the mass balance equations is removed if the cheese maker chooses to work with an approximate value of the serum solids,
sersol, and approximate values of the whey protein, lactose, and other solids in the whey stream, wl. By using these values, the cheese maker solves a problem that approximates the exact problem. Let
![]() | [19] |
Here, the variable w refers only to the whey stream components l in {fat, cas, wat}, and w refers to those components l in {whe, lac, oth}. The approximate cheese maker problem is expressed mathematically as
![]() |
This approximate problem is a LP problem. I refer to this problem as the approximate LP problem, and the constraints for this problem are the approximate LP constraints. The only difference between the approximate LP and the NLP is the use of Equation 9 instead of Equations 7 and 8. Once the approximate LP is solved, the exact whey stream composition may be calculated from the solution by using Equation 8 and the serum identity equations.
Solution Algorithm for the NLP
With one additional constraint, the approximate LP problem may be used to solve the NLP problem. In the LP problem, the actual serum solids, Xsersol, will not, in general, equal the approximate serum solids, Xsersol. This inconsistency is resolved with the addition of the consistency constraint:
![]() | [20] |
Incorporating this into the LP problem means that the serum solids in the cheese milk are now artificially constrained by the restriction that the assumption about the serum solids content of the cheese milk,
sersol, is always correct. The inclusion of the consistency constraint in the approximate LP forms the consistent LP problem, which is
![]() |
Solving the consistent LP guarantees a solution where the assumption is consistent with the actual serum solids content, but this solution is not necessarily optimal, i.e., the minimum net cost solution to the nonlinear model. However, the consistent LP may be used in an algorithm to solve the nonlinear problem.
The serum solids content is a one-dimensional variable (not a vector), and it can only take on a limited range of values. To determine the lower bound of this range, a LP problem is formed by taking the constraints from the approximate LP and using the objective function (and choice variables),
![]() | [21] |
The upper bound may be similarly determined using the same set of constraints and maximizing the objective function,
![]() | [22] |
Let µlowsersol and µ up sersol be the lower and upper bounds to the serum solids content of the cheese milk as determined from these 2 LP, respectively.
For each assumption on
sersol, there is an associated minimum net cost from the solution to the consistent LP problem. By letting the assumptions of
sersol vary over the range and solving the consistent LP problem at each different value, an algorithm can solve the nonlinear problem by calculating the minimum of all solutions to the consistent LP problems over the range of possible assumptions on
sersol.
Let C' (
sersol) be the minimum net cost of the consistent LP for a particular assumption of
sersol, and let C* be the minimum net cost solution to the nonlinear problem. The algorithm used to solve the nonlinear problem is
Initialize
sersol = µ low sersol
Solve the consistent LP for C' (
sersol).
Initialize X* sersol =
sersol and C* = C' (
sersol).
Choose an increment by which to increase the serum solids content of the cheese milk. Let this increment be
.
Increment
sersol =
sersol +
.
If
sersol> µ up sersol, then exit.
Solve the consistent LP for C' (Xsersol).
If C' (Xsersol) < C*, then set C* = C' (Xsersol) and X*sersol =
sersol.
Return to increment step. Upon exit, the minimal cost is C*, and the cost-minimizing serum solids content is X*sersol.
This algorithm works because all possible values for the serum solids variable, Xsersol, lie between its lower and upper bounds, and at each value of
sersol there is a solution to the consistent LP.
Implementation
The nonlinear model and its linear approximation may be implemented in any mathematical programming environment that allows for loop control. Here, the models were written and solved in Excel. Aside from the nonnegativity constraints, the constraints and the objective function are written out directly in the spreadsheet. A macro was written with Visual Basic (Micro-soft) to solve the approximate LP using the default add-in solver. The NLP is solved by iterating the consistent LP using the algorithm specified in the previous section. For both the approximate LP and the consistent LP, the default settings of the solver are used with the exception of the "Assume Linear Model" and "Assume Non-Negative" options, both of which are checked. The nonnegativity constraints do not need to be written out when the nonnegativity option is checked, and checking the linear model option means that the model is assumed to be linear and solved with the Simplex method. The NLP solution algorithm was implemented using a second Visual Basic macro. Both macros, for the approximate LP and the NLP, were associated with buttons on the spreadsheet.
| RESULTS AND DISCUSSION |
|---|
|
|
|---|
Example 1
In this example, I solve the model using, first, the approximate LP and then, using the NLP. The parameters are calibrated for Cheddar cheese, and the quantity of cheese to be produced, z, is 10 kg. The exact whey stream is recovered from both solutions using the cheese milk identities and Equation 8. Use of ultrafiltered milk protein products is set to zero in this example, limiting the available inputs to whole milk, skim milk, cream, and NDM. This restricted set of inputs implies a range of feasible serum solids, Xsersol, between 5.857 and 5.891 in the cheese milk. The midpoint of the range is the serum solids composition assumed for the approximate LP,
sersol = 5.874.
Table 3
provides the solution to the 2 models. The first column is the solution to the LP model using the approximate mass balance equations, The second column is the solution to the approximate LP model with the exact composition of the whey stream recovered from Equations 7 and 8, and the third column is the solution to the NLP model. A comparison between the first 2 columns shows there is little difference in the whey stream compositions from the approximate mass balance equations compared with the exact. This was expected given the limited range of feasible serum solids for the cheese milk. Comparing the second and third columns shows there is no difference at all between the NLP solution and the approximate LP solution with exact mass balance equations. This example suggests that the simplest approach to solving the cheese NLP model may be to assume a composition for the serum solids in the cheese milk, solve the approximate LP model, and then recover the exact whey stream composition from Equations 7 and 8. This approach is used in the next example.
|
|
The solutions in Table 4
also show where the cost reductions originate when ultrafiltered milk protein products are used: input costs actually rise under the use of either ultrafiltered milk or milk protein concentrate, but not enough to offset the reduced vat costs. The result is a reduction in the net cost for the 10 kg of Cheddar cheese from $24.14 to $24.10 with ultrafiltered milk and then to $24.01 with milk protein concentrate. Naturally, these solutions are particular to the prices and vat costs used in this example and would be expected to change under different pricing assumptions.
A sensitivity analysis may be used to evaluate the true value of inputs not used in the model. These analyses are generated upon request in Excel and are printed into new worksheets. Here, I will demonstrate the use of a sensitivity analysis to calculate the value of NDM for use in standardization. The relevant results from a sensitivity analysis of the solution with ultrafiltered milk and milk protein concentrate are provided in Table 5
.
|
| CONCLUSIONS |
|---|
|
|
|---|
, was the smallest set necessary to express the constraints considered relevant, but it is not meant to be authoritative. If, for instance, a cheese maker wanted to separate nonprotein nitrogen from the other solids component, then he could do so in a straightforward manner by adding an element, say npn, to the sets L and
. This would create a new whey stream variable, wl, but the constraints would remain essentially un-changed. The conceptual model of dairy products, thus, provides an adaptable framework for the nonlinear cheese-making model and its linear approximation.
In a similar manner, the set of inputs used in cheese manufacture, Kx, may be expanded without affecting the underlying problem. If a cheese maker wanted to consider using condensed skim milk in his process, then he would add an element to the set Kx, call it csm. He would then need to know the value of each component of the condensed skim milk,
csm,l, and these values would enter the equations exactly as the other inputs. Other than these trivial changes, the models would be unaffected. Although some may find the expression of the models initially cumbersome, the symbolic language used here gives these models a flexibility they would otherwise lack.
I suggested two different approaches to solving the nonlinear problem faced by the cheese maker. In the first approach, I specified an algorithm to vary the serum solids content of the cheese milk, solving the consistent LP model at each point. The solution to the nonlinear problem was equal to the minimum net cost choice of serum solids content plus the associated solution to the consistent LP model. The second approach was to simply solve the approximate LP and recover the exact whey stream composition from the solution using Equations 7 and 8. The results of Example 1 suggest that the 2 approaches may be equivalent in ordinary circumstances.
Example 2 shows the differences between standardization techniques with and without ultrafiltered milk protein products. The results show a significant increase in cheese yield with the use of ultrafiltered milk protein products. The yield without these products was 10.5 kg of cheese/hundredweight of cheese milk, and this increased to 13.9 and 13.8 with the use of ultrafiltered milk or milk protein concentrate, respectively. Ultrafiltered milk protein products also reduced the net cost per pound of cheese by $0.004/kg with the use of on-site ultrafiltered milk and by $0.013 with imported milk protein concentrate.
Example 2 also illustrates an important point: yield maximization is not the same as net cost minimization. In the third scenario, on-site ultrafiltered milk and imported milk protein concentrate are both permitted for use in standardization, meaning that the solution from the second scenario is feasible in the third. A comparison between the second and third scenarios shows that it is possible for the lowest cost to be at a point where the yield is not maximized. Yield would have been higher with the use of on-site ultrafiltered milk, but the cost savings from the use of imported milk protein concentrate as a source of protein were so great that they offset the increased vat costs associated with the lower yield.
A comparison of the second and third scenarios in Example 2 suggests that the majority of cost reductions from the use of imported milk protein concentrate compared with ultrafiltered milk do not come from differences in yield, as the yields with the use of either were nearly identical. That is to say, with respect to this model, milk protein concentrate does not hold any significant functional advantage relative to ultrafiltered milk in increasing yield. Rather, the cost reductions from the use of milk protein concentrate are largely due to the fact that imported milk proteins are generally less expensive than those in domestically sourced ultrafiltered milk. If ultrafiltered milk could be supplied at a price of $0.973/kg, as opposed to the $0.992 price used in the model, the sensitivity analysis from the second example indicates that domestically sourced ultrafiltered milk would have been preferred to imported milk protein concentrate.
In developing these models, I endeavored to capture the assumptions and constraints commonly used in cheese manufacture. Expressing these constraints on a component basis lends clarity and flexibility to the model, and the linear approximation provides for an easy implementation of the model in any standard spreadsheet software package. It is my hope that this model will be useful to industry professionals for their planning and procurement decisions as well as to dairy scientists as a framework for further research.
| ACKNOWLEDGEMENTS |
|---|
|
|
|---|
Received for publication September 14, 2005. Accepted for publication October 11, 2005.
| REFERENCES |
|---|
|
|
|---|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |