Optimization Problem Types and Categories

Authored by: Richard C. Peralta , Ineke M. Kalwij

Groundwater Optimization Handbook

Print publication date:  April  2012
Online publication date:  April  2012

Print ISBN: 9781439838068
eBook ISBN: 9781439838075
Adobe ISBN:




Many professionals are well experienced in evaluating groundwater systems, in describing the present system condition, and in predicting its future condition, if expected events occur. Our intent is to help cause better futures. This book shows how to determine the best events (best management strategies).

 Add to shortlist  Cite

Optimization Problem Types and Categories

3.1  Introduction

Many professionals are well experienced in evaluating groundwater systems, in describing the present system condition, and in predicting its future condition, if expected events occur. Our intent is to help cause better futures. This book shows how to determine the best events (best management strategies).

To practicably improve future water situations, it is helpful to view groundwater management situations as optimization problems. Optimization problems include representations of the system being managed, and management goals and constraints. A coupled simulation representation and optimization algorithm is termed an S-O model. Chapters 7 through 9 discuss ways of coupling simulators and optimizers within an S-O model. Chapters 4 through 6 provide more detail about the optimizer algorithms or methods used for different S-O couples.

In laying the groundwork for subsequent chapters, we distinguish between types and categories of optimization problems. Optimization problem types include linear, integer, mixed integer, nonlinear, and mixed integer nonlinear problems.

Designation as a particular optimization problem type depends significantly on the linearity and nonlinearity of both the physical system and the management problem. It is especially important to identify nonlinearities, because nonlinear problems generally require more effort to solve than linear problems. Later we show how to convert nonlinear problems into linear problems for optimization.

In addition to being of a particular type, an optimization problem belongs to several descriptive optimization problem categories. Example categories are single objective, multiobjective, deterministic, stochastic, single-model, multimodel, single-area, multiarea, and hierarchical. These encompass a wide range of situations. Sample situations exist when there are multiple competing management goals, uncertainty or differing perspectives concerning the physical system, or the necessity of simultaneously managing several interacting physical systems, possibly using a prioritization scheme.

This chapter will:

  • Provide the ability to identify different optimization problem types and categories
  • Show that addressing nonlinear physical systems does not always require solving nonlinear optimization problems
  • Expose the reader to multiobjective, stochastic, and other optimization categories
  • Prepare the reader for subsequent chapters

3.2  Common Optimization Problem Types (LP, QP, IP, MIP, NLP, MINLP)

3.2.1  Introduction

Table 3.1 summarizes characteristics of optimization problem types and whether computed optimality is global or local. As mentioned elsewhere, a globally optimal solution is truly the best solution of the entire feasible solution space. A locally optimal solution is the best solution for part of the feasible solution space.

Below, we assume Xn is a real variable being optimized, In is an integer variable being optimized, and cn , c n I P

, an , and bn are constant known values. We use those terms to define optimization problem type objective functions and constraints. We also describe sample objective functions or problems.

3.2.2  Linear Optimization Problem

A linear programming (LP) optimization problem has only linear equations—variables exist only to the first power and there are no products of two or more variables. Equations 3.1 through 3.3 show a sample LP problem representation:

Table 3.1   Optimization Problem Types and Optimality Achievable Using Classical Optimizers

Objective Function


Optimization Problem

Achievable Optimality



Linear (LP)


Some quadratic


Quadratic (QP)

Often global

Linear and integer

Linear and integer

Mixed integer (MIP)

Sometimes only local

Linear or nonlinear


Nonlinear (NLP)

Sometimes only local

Linear, integer, and nonlinear

Linear, integer, or nonlinear

Mixed integer nonlinear (MINLP)

Sometimes only local

  • Variables X 1 and X 2 are real numbers
  • Linear objective function
    3.1 maximize  a 1 X 1 + a 2 X 2
  • Linear constraints
    3.2 c 1 , 1 X 1 + c 1 , 2 X 2 5 c 2 , 1 X 1 + c 2 , 2 X 2 = 3
  • Bounds
    3.3 X 1 b 1 , X 2 b 2

A sample linear objective function is the total sum of pumping. If pumping is positive in sign, this objective function is commonly maximized for water supply problems, and minimized for environmental or remediation problems.

3.2.3  Quadratic Optimization Problem

A quadratic programming (QP) optimization problem has all linear equations except for a quadratic objective function. The objective function includes one or more terms having a variable raised to the second power, or a product of two variables each to the first power. Equation 3.4 shows a sample QP problem representation:

  • Variables X 1 and X 2 are real numbers
  • Quadratic objective function
    3.4 maximize  a 1 X 1 + a 2 X 1 X 2 + a 3 X 2
  • Linear constraints (as in linear model)
  • Bounds (as in linear model)

An example quadratic objective function computes the total cost of pumping (if cost includes pumping volume or rate times dynamic lift that is affected by pumping). Normally optimization minimizes this value.

3.2.4  Integer Optimization Problem

Integer programming (IP) problems involve integer variables. Sample integer variables are 0, 1, 2, 3, and so forth. Problems in which integer variables must be either 0 or 1 are termed binary integer or 0-1 programming problems. Binary (0 and 1) variables are often used to indicate that an action will not be performed, or will be performed, respectively.

Equations 3.5 through 3.7 show a sample IP problem:

  • Variables I 1 and I 2 are nonnegative integers
  • Objective function (Equation 3.5)
    3.5 Maximize  a 1 I 1 + a 2 I 2
  • Constraints
    3.6 c 1 I 1 c 2 I 2 < 10
  • Bounds
    3.7 I 1 > 0 ( automatic ) , I 2 < 5

A sample binary objective function represents the sum of the products of respective well installation cost times 0 (for a well that will not be installed) or 1 (for a well that will be installed). A sample nonbinary objective function includes the numbers of wells of each different type times the respective cost of each type.

3.2.5  Mixed Integer Optimization Problem

In mixed integer programming (MIP) problems, some variables are integers and some are real numbers.

Equations 3.8 and 3.9 and attendant bounds describe a sample MIP formulation:

  • Variables include both real and integer numbers
    • X 1, X 2 are real numbers
    • I 1, I 2 are nonnegative integers
  • Objective function
    3.8 Minimize  a 1 X 1 + a 2 X 2 + a 3 I 1 + a 4 I 2
  • Constraints can be real, integer, and mixed
  • As in LP for real variables
  • As in IP for integer variables
  • Mixture of real and integer variables as shown in Equation 3.9
    3.9 c 3 , 1 X 1 +   c 3 , 3 I 1 > 12 c 4 , 2 X 2 +   c 4 , 4 I 2 >   8
  • Bounds
    • As in LP for real variables
    • As in IP for integer variables

A sample MIP objective function represents the total sum of the costs of groundwater pumping plus the costs of installing pumped wells. Optimization usually minimizes this sum.

3.2.6  Nonlinear Optimization Problem

Equations 3.10 and 3.11 and related bounds describe a nonlinear programming (NLP) optimization problem. An NLP problem has at least one nonlinear constraint, or an objective function of a power different than one or quadratic.

  • Objective function
    • If only linear or quadratic, there must be a nonlinear constraint
    • Nonlinear
      3.10 Maximize  a 1 X 1 0.33 + a 2 X 1 X 2 4
  • Constraints
    • Linear (optional)
    • Nonlinear (OF or at least one constraint must be nonlinear)
      3.11 c 1 X 1 X 2 2 c 2 X 2 3 = 10
  • Bounds (as in linear model)

A sample NLP optimization problem is to minimize the extraction pumping needed to achieve target nonlinear groundwater contaminant concentrations by a certain time. Optimizable concentrations can also exist within an objective function. They are more nonlinear than quadratic.

3.2.7  Mixed Integer Nonlinear Optimization Problem

A mixed integer nonlinear programming (MINLP) combines MIP and NLP features. Commonly it has a MIP objective function and nonlinear constraints. A sample MINLP problem is to minimize cost of installing and operating wells to achieve groundwater contamination remediation goals by extraction pumping or pump-and-treat. Groundwater contaminant concentrations are nonlinear functions of pumping extraction.

3.3  Linearity and Nonlinearity in S-O Modeling

3.3.1  Introduction

An S-O model includes representations of a physical system and an optimization problem. The physical system, optimization problem, and their representations can be either linear or nonlinear. Degrees of nonlinearity also exist for physical systems and optimization problems. For example, a quadratic programming optimization problem is only slightly nonlinear and is solved more easily than a more nonlinear problem, and sometimes yields a globally optimal solution (Chapter 4 discusses convergence of optimization methods).

Different S-O models have been developed and reported to solve all of the above optimization problem types for linear or nonlinear systems and representations. Generally, the different S-O procedures have been developed to improve computational performance for particular system-problem combinations. Some techniques require more computational, technical, or computer programming resources than others. This reference emphasizes methods practicably useful to most individuals developing pumping strategies and designs.

3.3.2  Linearity and Nonlinearity in Physical System and Simulators  Groundwater Flow

To reiterate, in equations describing linear processes, no variable can exist as a power other than one, and no products of two or more variables exist. Head response to pumping in a confined aquifer is linear. For a confined aquifer, Figure 3.1 illustrates Theis equation terms.

Note that if the potentiometric head remains in the semiconfining or confining layer, saturated thickness (and transmissivity), and storativity do not change in response to pumping. For a particular location, distance, and time, u and W(u) are independent of pumping Q. Thus drawdown s equals a linear product of Q and W(u)/4πkb—the head response to pumping is linearly proportional to pumping rate. This multiplicative property is a commonly employed characteristic of a linear system.

Theis equation and applicable physical setting.

Figure 3.1   Theis equation and applicable physical setting.

Equation 3.12 illustrates use of the multiplicative property to compute groundwater head. Here, assume that the initial water table is horizontal and at equilibrium. Groundwater is extracted at a single well, index number ê.

3.12 Δ h o ^ = δ o ^ , e ^ h p e ^ p e ^ u t
where Δhô is a change in steady-state aquifer potentiometric surface elevation at observation location ô (L), δ ô , ê h is the influence coefficient describing effect of steady groundwater pumping at location ê on steady-state potentiometric surface elevation at location ô (L), pê is the pumping rate at location ê (L3/T), and p ê u t is the magnitude of steady “unit” pumping stimulus in location ê used to generate the influence coefficient (L3/T). This does not necessarily equal 1.

Assume that a unit steady pumping extraction rate of 1 m3/min at well ê causes a drawdown of 1 m at observation point ô. In that case, δ ô , ê h

equals (−1) and p ê u t = 1 . Equation 3.12 shows that, δ ô , ê h if p ê u t and are known, the change in head caused by any pumping rate can be easily computed. If pumping pê equals 2 m3/min, head change will equal (−1)(2)/(1) or −2. This linear response is typical of confined aquifers (or approximates behavior of unconfined aquifers where the change in transmissivity due to pumping is small by comparison with the original transmissivity).

Another characteristic of linear systems is the additive property, commonly taught as superposition and image well theory in groundwater texts (multiplicative and additive properties are employed more fully in Chapter 8). The additive property sums the effects of pumping at Mp locations on head at location ô. Equation 3.13 shows that this cumulative effect is the result of adding the individual effects of Mp pumping rates.

3.13 Δ h o ^ = e ^ = 1 M p δ o ^ , e ^ h p e ^ p e ^ u t
where Mp is the total number of locations at which water is being pumped from the aquifer.

The additive property can be used to make composite influence coefficients. For example, it can describe the effect of pumping at Mp locations on the difference in head between two locations. The resulting Equation 3.14 is used in a later example.

3.14 Δ Ω u ^ = e ^ = 1 M p δ u ^ , e ^ h p e ^ p e ^ u t
where Ω û is the difference in potentiometric surface elevation between locations 1 and 2 of pair û, (L). Here, since the initial steady-state potentiometric surface is horizontal, Ω û also equals ΔΩ(û), the change in the head difference due to pumping.

Head response to stimuli in an unconfined aquifer is nonlinear because saturated thickness and transmissivity change in response to pumping. If the change is insignificant, the aquifer can be considered to be approximately linear. Historically, a general rule of thumb was that a system could be considered linear if the transmissivity change due to pumping was less than 10 percent. The smaller the initial transmissivity, the greater the head decline response to extraction.

Flow and head responses to stimuli in a river–aquifer system are represented in most numerical S models as piecewise linear functions. Figure 3.2 paraphrases how MODFLOW represents this and other head-dependent boundary flows using piecewise linear functions.

Different pieces of the functions can have different slopes. Figures 3.2a, b, and c have two, and three pieces, respectively. These functions are reasonable simplifications. At the beginning of a simulation iteration, MODFLOW evaluates head(s) in each cell and determines transmissivity and the piece of each flow equation to use for that cell. MODFLOW iterates until newly computed values match assumed values closely enough to satisfy convergence criteria. In other words, MODFLOW treats a nonlinear physical system as if it is linear, and iterates until convergence. Some S-O techniques also use an iterative procedure to address nonlinear system-problem combinations. Such methods assume linearity and iterate until they converge to a solution for a nonlinear situation. Other names for this iteration are cycling and successive linear optimization.

Sample piecewise linear head-dependent boundary flows in MODFLOW. (a) Seepage to drain, (b) river–aquifer seepage, (c) evapotranspiration. (Modified from McDonald, M.G., and A.W. Harbaugh, MODFLOW: A modular three-dimensional finite-difference ground-water flow model, USGS Techniques of Water-Resources Investigations, Washington, D.C., Book 6, Chapter A1, 1988.)

Figure 3.2   Sample piecewise linear head-dependent boundary flows in MODFLOW. (a) Seepage to drain, (b) river–aquifer seepage, (c) evapotranspiration. (Modified from McDonald, M.G., and A.W. Harbaugh, MODFLOW: A modular three-dimensional finite-difference ground-water flow model, USGS Techniques of Water-Resources Investigations, Washington, D.C., Book 6, Chapter A1, 1988.)  Groundwater Contamination Concentration

Groundwater concentration response to extraction stimuli is usually nonlinear, as illustrated in this groundwater contamination remediation. During the effort, we also empirically prove that S-O modeling can identify globally optimal solutions for nonlinear concentration response surfaces. The empirical proof required that we first determine what the response surfaces look like, and where the globally optimal solutions lie.

Figure 3.3 shows a plan view of initial trichloroethylene (TCE) contamination existing about 150 feet (46 m) beneath the ground surface. The management intent is to determine the optimal 4-year steady extraction rates from wells 1–3, which will cause the highest remaining concentration anywhere in the field (cmax) to be as low as possible. In Figure 3.3, the greatest initial concentration exceeds 125 ppb. The employed simulator is MT3DMS.

Initial TCE concentrations for three-well effort minimizing

Figure 3.3   Initial TCE concentrations for three-well effort minimizing cmax after 4 years. (From Aly, A.H., and R.C. Peralta, Water Resour. Res., 35(8):2415–2425, 1999.)

Because the total pumping rate is fixed at 2,000 gpm, all possible strategies can be shown on a two-dimensional plane with axes for pumping at wells 1 and 2 (shaded plane in Figure 3.4). Pumping from well 3 is automatically known for any point (strategy) on the plane because it equals 2,000 −p 1p 2. The feasible solution space for this optimization problem has two dimensions.

Figure 3.5 shows the cmax response surface that results from simulating all feasible pumping strategies. Note that the cmax surface is the same surface that an S-O model will navigate in searching for a globally optimal solution. The S-O model and the exhaustive simulations both yielded a globally optimal steady pumping strategy. This strategy will reduce contamination such that after 4 years, the highest concentration will be less than 1 ppb. Figure 3.5 contours show only one locality having the lowest concentrations. The contours do not reveal any other depressed areas that could contain locally optimal solutions.

Minimizing a state-variable cmax within even a single realization is a nonlinear optimization problem because cmax is a nonlinear function of pumping rates. Figure 3.5 problem is relatively straightforward because there are few choices concerning which wells will pump, and total pumping is constant.

Feasible solution space (shaded) for (P(1) + P(2) + P(3)) = 2,000 gpm.

Figure 3.4   Feasible solution space (shaded) for (P(1) + P(2) + P(3)) = 2,000 gpm.

Figure 3.5   cmax response surface after three years of pumping from three wells. (From Aly, A.H., and R.C. Peralta, Water Resour. Res., 35(8):2415–2425, 1999.)

3.3.3  Nonlinearity in Optimization Problem

A quadratic optimization problem is a special case of nonlinear optimization problem and is relatively easily solved. Nonlinear optimization problems are more challenging if the optimizer must select wells from among many candidate wells, and must add an extra significant cost to the objective function value if a well is pumped at all. The extra cost might be for construction, installation, special surcharge, or administration. Including the decision whether to construct is usually an integer or mixed integer optimization problem. Combining constrained nonlinear or objective function variables and MIP components produces MINLP problems—which are among the most challenging problems for optimizing pumping strategies.

3.3.4  Summary

The combined representations of the physical system and optimization problem determine how nonlinear and complex an optimization problem is. For large, complex optimization problems, especially MINLP and stochastic problems, reaching the globally optimal solution cannot be guaranteed. Except by testing solutions in all somewhat different parts of the feasible solution space, empirical certainty of global optimality cannot be achieved. In practice, that is acceptable. For complicated problems, getting close to global optimality using an S-O model will yield a better strategy than trial and error using an S model.

3.4  Single-Objective and Multiobjective Optimization

The optimization problem solved in Figures 2.5 and 3.5 represents single-objective problems. There is no ambiguity about the goals of maximizing pumping and minimizing cmax, respectively. Performing the optimization yields a single optimal solution.

Figure 2.3 represents a different situation, for a region in which actual pumping already significantly exceeded a perennial (safe) yield. Pumping had to be reduced, and an acceptable perennial yield pumping strategy needed to be selected. Stakeholders agreed on optimization problem variables, bounds, and constraints, but disagreed on the major management objective—they preferred different objective functions. One group wanted to maximize the annual volume of perennial groundwater pumping. The other group wished to consider the different economic values of crops that would receive less water—they preferred to minimize the economic impact of reducing groundwater pumping. Figure 2.3 displays the strategies preferred by the two groups (at the ends of the curve). Axes employ the units of the two objective functions. The upper right point on the curve is the maximum perennial yield pumping strategy. The lower left point on the curve is the minimum economic impact strategy. The figure shows the values of both objective equations for each displayed strategy.

The optimal strategies preferred by the two groups conflict—a characteristic of multi-objective optimization problems. One cannot improve attainment of one of the objectives without harming attainment of the other. The trade-off curve connecting the two strategies shows how one objective is hurt to increase achievement of the other objective. Chapter 6 reports multiobjective optimization techniques for creating that curve, and for helping stakeholders identify a mutually agreeable compromise solution on the trade-off curve.

3.5  Deterministic and Stochastic Optimization

There is uncertainty in the validity of assumptions and parameters we use within simulation (S) and S-O models. That uncertainty can be addressed for both S and S-O modeling. The most theoretically rigorous approaches would use probability density functions (pdf) for uncertain parameters. However, because valid pdfs are rarely available, this text discusses more common practice and prerequisite definitions.

A deterministic S or S-O model deals with one reality (approximation of the real world) at a time. A reality, or realization, is a particular set of physical system parameters, boundary conditions, and assumptions. To predict the consequences of possible realization inaccuracy (uncertainty), normal practice is to subsequently perform sensitivity analysis.

Assume the situation in which one has developed a pumping strategy using either S or S-O modeling. Sensitivity analysis includes using that pumping strategy in multiple simulation runs, each of which employs a different physical system reality or realization. Commonly all values of a particular set of parameter values (such as a hydraulic conductivity array) are multiplied by the same real number. For example, multiplying all conductivities by 1.25 represents a global 25% increase. Multiplying all by 0.75 causes a 25% decrease. A simulation is run after each multiplication. Results are examined to determine how the real system might respond if it differed by this degree from the assumed system. The more systematic and numerous such simulations are, the better the idea gained concerning possible outcomes.

A stochastic S-O model addresses uncertainty directly during optimization. Most commonly, it either includes special probability-based constraints or deals with multiple realities simultaneously. Either approach increases complexity of both flow and contaminant transport optimization.

For example, for the same site as Figures 3.3 through 3.5, Figure 3.6 shows the maximum concentration objective function response surface resulting if optimizing while considering five realities simultaneously. Instead of one clear global optimum, Figure 3.6 shows four local optima and the global optimum. Contours indicate the maximum concentrations resulting from pumping from the three wells for 4 years. The maximum concentrations are those resulting from simultaneously applying pumping strategies to five different representations of reality (realizations), each having the same statistical likelihood of existence.

In effect, the cmax5 for one pumping strategy is a composite value. It represents the maximum concentration that will result anywhere in the flow domains of all five realizations. Optimization employed one of the stochastic optimization methods discussed in Chapter 5.

Figure 3.6   cmax5 response surface after three years of pumping from three wells in five realizations. (From Aly, A.H., and R.C. Peralta, Water Resour. Res., 35(8):2523–2532, 1999.)

3.6  Optimization of Multiple Physical Processes

3.6.1  Multiple Module Models

Effective groundwater management sometimes involves multiple physical and nonphysical processes. An example of multiple physical processes includes groundwater extraction, seepage from leaky conveyance system and water use with attendant deep percolation, recharge, and chemical transport and reactions, and effects on sustainability. Chapters 7 through 9 discuss common S-O model simulator types, and how they can be coupled with optimizers. They cover the flow and transport processes most commonly considered in groundwater management. Discussing more processes is beyond the book scope.

Figure 3.7 illustrates multiple flow processes optimizable in an S-O model that could optimize urban and agricultural conjunctive water management without unacceptably affecting water quality. Solving the nonlinear S-O model would involve cycling techniques discussed in Chapter 4. Developing response or trade-off curves (Figure 3.8) involves multiobjective methods discussed in Chapter 6. Preparing Figure 3.8a involves employing constraints derived from a surface water quality model, within a dynamic stream–aquifer conjunctive use model. Creating Figure 3.8b involves detailed vadose zone flow and transport simulation. The curves can be included within groundwater management S-O model constraints.

Sample flow processes in a multiple module S-O model.

Figure 3.7   Sample flow processes in a multiple module S-O model.

Sample objective response curves: (a) Maximum population supportable via conjunctive use, while protecting surface water quality, for alternative upstream inflow rates (After Ejaz, M.S., and R.C. Peralta,

Figure 3.8   Sample objective response curves: (a) Maximum population supportable via conjunctive use, while protecting surface water quality, for alternative upstream inflow rates (After Ejaz, M.S., and R.C. Peralta, Adv. Water Resour., 18(2):67–75, 1995.); (b) Minimum crop yield reduction necessary to protect groundwater quality, as affected by depth to groundwater and irrigation frequency. (After Peralta, R.C. et al., Water Resour. Res., 30(11): 3183–3193, 1994.)

3.6.2  Decomposition and Hierarchical Optimization

Sometimes a management situation is so complicated and nonlinear that one cannot be certain of computing globally optimal strategies. Accepting this inability can be liberating. Acceptance frees one to look at the problem differently. Rather than solving one large complicated problem, one seeks solutions to several simpler problems that are somehow related. The adage of eating an elephant one bite at a time applies by analogy to digesting large or complex optimization problems.

Decomposition means the breaking of a large problem into smaller problems. Presumably the smaller problems are more readily solvable. The order in which the problems should be solved constitutes a hierarchy. The first subproblems are at the lowest level of the hierarchy. The final optimization to be solved is at the highest level—the master decision level. Partial or full repetitive iteration through the hierarchy might be necessary.

Figure 3.9 shows a sequence of models of different sizes used to aid critical area planning. The central image is a finite difference model grid of the Arkansas Grand Prairie. A hierarchical solution involves multiple steps, and coordinated assumptions concerning boundary conditions and flows. Information concerning S-O modeling constraints can go in the direction of the arrows, and in the opposite direction.

In the illustrated top-down approach, large-scale regional sustained groundwater yield and conjunctive use strategy would drive a developing Grand Prairie optimal strategy, which would determine pumping at individual wells. In actuality, the Grand Prairie model was developed first. Information concerning how much saturated thickness needed to be maintained in a critical subsystem was derived through daily irrigation scheduling and groundwater simulation of all pumping wells in the subsystem (assuring adequate water throughout the year). Then, developing a regional groundwater model could aid in assigning Grand Prairie boundary assumptions and coordinating conjunctive use with river system navigation and ecosystem requirements.

Optimal sustained yield and conjunctive use planning strategies for the Grand Prairie attempted to satisfy irrigation water needs (Figure 3.10). Figure 3.11 illustrates trade-offs that might be involved in selecting a strategy. Implementing one strategy would eventually cause the evolution of an acceptable equilibrium target potentiometric surface (Figure 3.12).

Figure 3.13 shows sustainable groundwater pumping rates that would maintain adequate saturated thickness throughout the area. However, water needs and groundwater pumping at that time, far exceeded those rates. So, imported surface water would be needed. Mathematical optimization or water-law based allocation simulation aids developing a transient conjunctive use strategy for the irrigation season (Table 3.2). This would use groundwater in accordance with the annual sustainable strategy.

Hierarchical sustained groundwater yield and conjunctive water use.

Figure 3.9   Hierarchical sustained groundwater yield and conjunctive water use.

Upper bounds (q

Figure 3.10   Upper bounds (qU) on water to be delivered to Grand Prairie cells when developing optimal strategies for a climatically average season. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian, ICID Bulletin: Irrigation, Drainage and Flood Control, 39(1):1–12, 1990.)

Conceptual three-dimensional trade-off curve. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian,

Figure 3.11   Conceptual three-dimensional trade-off curve. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian, ICID Bulletin: Irrigation, Drainage and Flood Control, 39(1):1–12, 1990.)

Target sustainable potentiometric surface in

Figure 3.12   Target sustainable potentiometric surface in m above sea level. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian, ICID Bulletin: Irrigation, Drainage and Flood Control, 39(1):1–12, 1990.)

Proportion of crop water use that can sustainably come from groundwater. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian,

Figure 3.13   Proportion of crop water use that can sustainably come from groundwater. (From Ranjha, A.Y., Peralta, R.C. and A. Yazdanian, ICID Bulletin: Irrigation, Drainage and Flood Control, 39(1):1–12, 1990.)

Table 3.2   Monthly Conjunctive Use Strategy That Is in Agreement with the Annual Sustained Yield Strategy


Total Water Needs (Dam)3 (Monthly % of Annual Water Needs)

Surface Water Use (Dam)3 (Monthly % of Annual Surface Water)

Groundwater Use (Dam)3 (Monthly % of Annual Groundwater)

% of Monthly Water Needs Provided By

Surface Water



345,018 (32.4)

219,808 (24.0)

125,210 (83.4)




263,840 (24.8)

247,160 (27.0)

16,680 (11.1)




307,963 (28.9)

301,434 (33.0)

6,529 (4.3)




78,361 (7.4)

77,415 (8.5)

946 (0.6)




48,110 (4.5)

47,531 (5.2)

579 (0.4)




21,398 (2.0)

21,122 (2.3)

276 (0.2)



Total annual






Source: Ranjha, A.Y., Peralta, R.C. and A. Yazdanian, ICID Bulletin: Irrigation, Drainage and Flood Control, 39(1):1–12, 1990.

Note: Surface water will satisfy 85.9% of the total crop water needs and groundwater will satisfy 14.1% of the total crop water needs.

3.6.3  Multiple Study Area or Model Optimization

Figure 3.14 illustrates a setting for optimizing multiple groundwater simulation modeled study areas simultaneously. Because of the overlap in boundaries, the boundary conditions of both models must be interrelated and consistent. For example, one can maximize steady pumping from all wells in both areas, subject to normal constraints, plus constraints forcing both models to have the same variable head cell values and complementary flows in overlapping cells.

Plan view for matching boundary conditions when simultaneously optimizing two modeled groundwater areas.

Figure 3.14   Plan view for matching boundary conditions when simultaneously optimizing two modeled groundwater areas.

3.7  Variable, Constraint, and Objective Function Flexibility

Any variable described within a simulation model or describable via an equation, algorithm, or function can be constrained within an S-O model. An S-O model can attempt to maximize or minimize any defined variable, and can optimize achievement of any user-specified goals. Any variable that can physically be managed in the field can also be a variable for developing management strategies. Thus, one can utilize all variables, listed in this text, or combinations of those variables.


Ahlfeld, D. P. , J. M. Mulvey , G. F. Pinder and E. F. Wood . 1988. Contaminated groundwater remediation design using simulation, optimization and sensitivity theory. 1. Model development. Water Resources Research. 24(3):431–441.
Aly, A. H. and R. C. Peralta . 1999a. Comparison of a genetic algorithm and mathematical programming to the design of groundwater cleanup systems. Water Resources Research. 35(8): 2415–2425.
Aly, A. H. and R. C. Peralta . 1999b. Optimal design of aquifer cleanup systems under uncertainty using a neural network and a genetic algorithm. Water Resources Research. 35(8): 2523–2532.
Avriel, M. 2003. Nonlinear programming. Analysis and Methods. Mineola: Dover Publications Inc.
Bronson, R. and G. Naadimuthu . 1997. Operations Research. Second Edition. New York: McGraw-Hill, Inc.
Brooke, A. , D. Kendrick and A. Meeraus . 1988. GAMS A User's Guide. Redwood City, CA: Scientific Press.
Chien, C. C. , M. A. Medina, Jr. , G. F. Pinder et al. 2002. Environmental Modeling and Management. Theory, Practice, and Future Directions. Wilmington, DE: Today Media.
Cohon, J. L. and D. H. Marks . 1975. A review and evaluation of multiobjective programming techniques. Water Resources Research. 11(2):208–220.
Dantzig, G. B. 1963. Linear Programming and Extensions. Santa Monica, CA: Princeton University Press and the RAND Corporation.
Datta, B. and R. C. Peralta . 1986. Interactive computer graphics-based multiobjective decision-making for regional groundwater management. Agricultural Water Management. 11(2):91–116.
Ejaz, M. S. and R. C. Peralta . 1995. Maximizing conjunctive use of surface and ground water under surface water quality constraints. Adv. Water Resour. 18(2):67–75.
Gharbi, A. and R. C. Peralta . 1994. Integrated embedding optimization applied to Salt Lake Valley aquifers. Water Resources Research. 30(4): 817–832.
Greenberg, H. J. 1995. Mathematical programming models for environment quality control. Operations Research. 43(4):578–622.
Kalwij, I. M. and R. C. Peralta . 2006. Simulation/optimization modeling for robust pumping strategy design. Ground Water. 44(4): 547–582.
Lefkoff, L. J. and S. M. Gorelick . 1986. Design and cost analysis of rapid aquifer restoration systems using flow simulation and quadratic programming. Ground Water. 24(6): 777–790.
Liefsson, T. , H. J. Morel-Seytoux and T. Jonch-Clausen . 1981. User's Manual for QPTHOR: A FORTRAN IV Quadratic Programming Routine. HYDROWAR Program, Colorado State University.
Major, D. C. 1977. Multiobjective Water Resource Planning. American Geophysical Union, Water Resources Monograph 4.
McDonald, M. G. and A. W. Harbaugh . 1988. MODFLOW: A modular three-dimensional finite-difference ground-water flow model. USGS Techniques of Water-Resources Investigations, Washington, DC (Book 6, Chapter A1).
Mulligan, A. E. and D. P. Ahlfeld . 2002. A new interior point boundary projection method for nonlinear optimization problems. Operations Research. 50(4): 636–644.
Murtagh, B. A. and M. A. Saunders . 1987. MINOS 5.1 User's Guide. Report SOL 83-20R. Stanford University.
Nowak, I. 2005. Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkhäuser Basel.
Peralta, R. C. 1999. Conjunctive Use of Ground Water and Surface Waters for Sustainable Agricultural Production. Food and Agriculture Organization of the United Nations Consultancy Report.
Peralta, R. C. , A. M. Bennett , A. W. Peralta , R. N. Shulstad , P. J. Killian and K. Asghari . 2006. Optimization modeling for sustainable groundwater and conjunctive use policy development. In Water Resources Sustainability, L. Mays (ed.). McGraw-Hill, pp. 99–116.
Peralta, R. C. , R. R. A. Cantiller and J. Terry . 1995. Optimal large-scale conjunctive water-use planning: Case study. Journal of Water Resources Planning and Management—ASCE. 121(6): 471–478.
Peralta, R. C. , P. W. Dutram , A. W. Peralta and A. Yazdanian . 1986. Saturated thickness for drought and litigation protection. Ground Water. 24(3): 357–364.
Peralta, R. C. , M. A. Hegazy and G. Musharrafieh . 1994. Preventing pesticide contamination of groundwater while maximizing irrigated crop yield. Water Resources Res. 30(11): 3183–3193.
Peralta, R. C. and P. J. Killian . 1987. Decision support for optimal regional groundwater management strategy modification. Transactions of the ASAE. 30(2):400–410.
Peralta, R. C. , P. J. Killian and K. Asghari . 1985. Effect of rules and laws on the sustained availability of groundwater. Phase I Project Completion Report for the Winthrop Rockefeller Foundation. Little Rock, AR.
Peralta, R. C. , A. W. Peralta and L. E. Mack . 1984. Water management by design. In Symposium Proceedings, Water for the 21st Century, Will it Be There? Presented at Southern Methodist University, Dallas, TX.
Peralta, R. C. , B. Timani and R. Das . 2011. Optimizing safe yield policy implementation. Water Resources Management. 25(2): 483–508.
Ranjha, A. Y. , R. C. Peralta and A. Yazdanian . 1990. Conjunctive water use/sustained groundwater yield planning: Case history. ICID Bulletin: Irrigation, Drainage and Flood Control. 39(1): 1–12.
SSOL. 2004. SOMOS Software User's Manual. Systems Simulation/Optimization Laboratory, Department of Biological and Irrigation Engineering, Utah State University.
Wagner, B. J. 1995. Recent advances in simulation–optimization groundwater management modeling. Reviews of Geophysics. 33(S1): 1021–1028.
Wagner, B. J. 1999. Evaluating data worth for ground-water management under uncertainty. Journal of Water Resources Planning and Management—ASCE. 125(5): 281–288.
Wagner, B. J. and S. M. Gorelick . 1987. Optimal groundwater quality management under parameter uncertainty. Water Resources Research. 23(7): 1162–1174.
Walker, R. C. 1999. Introduction to Mathematical Programming. Upper Saddle River, NJ: Prentice Hall, Inc.
Yazdanian, A. and R. C. Peralta . 1986. Sustained-yield groundwater planning by goal programming. Ground Water. 24(2):157–165.
Zheng, C. and P. P. Wang . 1999. MT3DMS: A modular three-dimensional multispecies transport model for simulation of advection, dispersion and chemical reactions of contaminants in groundwater systems: documentation and user's guide. Contract Report SERDP-99-1, US Army Engineer Research and Development Center, Vicksburg, MS.
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.