My WebLink
|
Help
|
About
|
Sign Out
Home
Browse
Search
WSP10809
CWCB
>
Water Supply Protection
>
Backfile
>
10001-10999
>
WSP10809
Metadata
Thumbnails
Annotations
Entry Properties
Last modified
1/26/2010 3:14:49 PM
Creation date
10/12/2006 4:32:48 AM
Metadata
Fields
Template:
Water Supply Protection
File Number
8273.500
Description
Colorado River Basin Salinity Control - Federal Agency Reports - EPA
Basin
Colorado Mainstem
Water Division
5
Date
4/1/1978
Title
Integrating Desalination and Agricultural Salinity Control Alternatives
Water Supply Pro - Doc Type
Report/Study
There are no annotations on this page.
Document management portal powered by Laserfiche WebLink 9 © 1998-2015
Laserfiche.
All rights reserved.
/
195
PDF
Print
Pages to print
Enter page numbers and/or page ranges separated by commas. For example, 1,3,5-12.
After downloading, print the document using a PDF reader (e.g. Adobe Reader).
Show annotations
View images
View plain text
<br />N <br />co <br />o <br />CO <br /> <br />if it is C\ssurried, that the changes toward the optimum point are <br />sufficiently small, then only a small deviation is introduced. <br />The e1iminC\tion procedure takes place by partitioning the vari- <br />able set into "states" and "decisions." The state variables are <br />the selected variables which are to be eliminated by the T active <br />constraints. The decision variables are the remaining independent <br />variables which will be employed to seek the minimum value of the <br />objective function, The criteria for the partition include two <br />aspects: <br /> <br />1. All slack variables are taken as decisions unless no <br />other x-variable is available to be a state variable. <br />Since all ~t are identically equal to zero, when the <br />algorithm moves from the old point xO to the new one <br />xV in its search for the minimum there is a 50 percent <br />cmance that the ~t will become negative. This is a <br />violation of the problem constraints; and <br />2. Since the same basic reasoning applies to the x-vari- <br />a~les, the largest absolute valued variables are best <br />suited to be state variables. <br /> <br />In the computer code of the algorithm described in Appendix B, <br />the selection of states and decisions is undertaken in a much <br />more complex procedure to insure numerical stability. <br /> <br />After ,partitioning the x-vector into state and decision <br />variables, the variables can be relabeled s for states and d <br />for decisions. Equation 1 at the initial point XO can then be <br />written, <br /> <br />y = min y(s ,s ,. <br />1 2 <br /> <br />. 'ST,d ,d , <br />1 2 <br /> <br />. ,dD) ..........,.'. (4) <br /> <br />in which D is the number of decision variables and equals <br />(N - T). Ln addition, the constraints listed in Eq. 3 can be <br />rewritten as: <br /> <br />!.(~'9) - :E. = Q .......................'................ (5) <br /> <br />The next step is to employ the chain rule of calculating the <br />total differential of y, In vector notation, <br /> <br />oy = (II y) <br />s <br /> <br />as + (lIdy) Cl9. <br /> <br />.............................. . <br /> <br />(6) <br /> <br />where the ~ymbo1 Cly is used to denote the total differential <br />rather than the standard notation of dy. This modification is <br />made so that the d can be reserved to denote the decision <br />variables. <br /> <br />The derivatives of the constraining functions can also be <br />written in vector form, <br /> <br />(IIS!.)a~ + (lId!.)Cl9. -a:E. = Q ...............,.............(7) <br /> <br />11 <br /> <br />:1, <br /> <br />.1'." <br />,~, <br /> <br /> <br />~..., <br /> <br />~,~. <br /> <br />Ji. ''';'.,,;''';' ,;..., <br />
The URL can be used to link to this page
Your browser does not support the video tag.