## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Problem 1

Solve the Prototype Example (Wyndor Glass Co.) By the Interior Point Method with initial solution X1 = 3 and x2 = 1. (a) Report the solution found (X1, X2, and Z) when the objective function improvement in two consecutive iterations comes below 1% for the first time. (x1, x2) = (1.992, 5.975), and Z = 35.852 (b) How many iterations are needed to obtain a less than 0.01% improvement in two consecutive iterations? More than 15 iterations, since the last iteration allowed by IOR tutorial provided a 0.011% improvement which is still slightly more than 0.01% (c) Do you think that if you continue you will ever find the exact optimum solution (assume that the objective function is computed with a very high degree of accuracy). No, the trial solutions obtained by an Interior Point Algorithm keep getting closer and closer to the exact optimal solution but never quite get there. (d) Include iteration results

Iteration

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

X1

3 3.471 3.446 3.317 2.912 2.408 2.156 2.04 1.996 1.988 1.992 1.996 1.998 1.999 1.999 2

X2

1 2.044 2.956 3.587 4.414 5.207 5.603 5.802 5.901 5.95 5.975 5.988 5.994 5.997 5.998 5.999

Z

14 20.632 25.119 27.887 30.804 33.257 34.486 35.129 35.491 35.715 35.852 35.926 35.963 35.981 35.991 35.995

% Improvement

47.371 21.748 11.020 10.460 7.963 3.695 1.865 1.030 0.631 0.384 0.206 0.103 0.050 0.028 0.011

Bt≥0. Ct≥0.000 that he wishes to invest now in order to use the accumulation for purchasing a retirement annuity in 5 years.7B1 D5+R5=R4+1.7B2+R4 And At≥0. Al wishes to know which investment plan maximizes the amount of money that can be accumulated by the beginning of year 6.000 A2+B2+C2+R2=R1 A3+B3+R3=R2+1. Maximize P = 1.000 A2+B2+C2 +R2=R1 A3+B3+R3=1. B. Thus.4A2+1.7B2 (b) Formulate a complete linear programming model for this problem. Write such an equation in terms of the relevant variables above for the beginning of each of the 5 years to obtain the 5 functional constraints for this problem. To do this let At. Each dollar invested in B at the beginning of a year returns $1. he has been offered four types of fixed income investments. Each dollar invested in D at the beginning of year 5 returns $1. which we will label as investments A. Each dollar invested in A at the beginning of a year returns $1. B.4-13 Al Ferris has $60. Also let Rt be the number of available dollars not invested at the beginning of year t (therefore available for investment in a later year).4A1 A4+R4=R3+1. (a) All the functional constraints for this problem can be expressed as equality constraints. and Dt. A1+B1+R1=60.7B3+1.7B1+R3 D5 +R5=1. Each dollar invested in C at the beginning of year 2 returns $1.9C2+1. C and D.70. Investments C and D will each be available at one time in the future. Rt≥0 .4A3+1. the amount invested at the beginning of year t plus Rt must equal the number of dollars available for investment at that time.4A1+1. C and D respectively at the beginning of each year t for each t where the investment is available and will mature by the end of year 5.4A1+R2 A4 +R4=1.40.90 at the end of year 5. Bt. Investments A and B are available at the beginning of each of the next 5 years. be the amount invested in investments A.4A1+1.4A3+1.3D5 Subject to: A1+B1+R1=60. After consulting with his financial adviser. Ct. 2 years later. 3 years later. Dt≥0.Problem 3.30 at the end of year 5.

(c) Solve this model by the simplex method. .

5 million $2 million $300 million Maureen wishes to determine the mix of investments in the assets that will cover the cash-flow requirements while minimizing the total amount invested. Maureen needs to invest some of the company’s money now to meet these future cash-flow needs.5 million $400 million 10 $0.5 1 2 0 Actual Cash Flow 0 >= 0 >= 0 >= Minimum Cash Flow Requirement 400 100 300 0 . and 20 years from now to meet the needs of the growing population in the region served by the company.5 0 Asset 3 0.) The following table shows both the amount of income generated by each u nit of each asset and the minimum amount of income needed for each of the future time periods when a new hydroelectric plant will be constructed. x3≥0 (b) Display the model on a spreadsheet.5 million $1 million $100 million 20 0 $1.5x3≥400 0. (a) Formulate a linear programming model for this problem Minimize C= Subject to x1+x2+x3 2x1+x2+0.5x1+0.. x2≥0. a major public utility in the Midwest. (Any excess income above the minimum requirements for each time period will be used to increase dividend payments to shareholders rather than saving it to help meet the minimum cash-flow requirements in the next time period. Model Year 5 10 20 Asset 1 2 0.5x2+2x3≥300 And x1≥0. Maureen may purchase only three kinds of financial assets. The assets produce income 5. and 20 years from now.5 0 0 Asset 2 1 0.Problem 3. 10.5 1. Year Income per Unit of Asset Asset 1 Asset 2 Asset 3 Minimum Cash Flow Required 5 $2 million $1 million $0. And that income is needed to cover at least minimum cash-flow requirements in those years. each of which costs $1 million per unit. Fractional units may be purchased. To cover at least the construction costs. The company has scheduled the construction of new hydroelectric plants 5.5-6 Maureen Laird is the CFO for Alva Electric Co.5x2+x3≥100 1.5 million $0. 10.

How much cash flow would this mix of investments generate 5. $300 million in 10 years. 200) is a feasible solution which would generate $400 million in 5 years. The total invested would be $400 million. (d) Take a few minutes to use a trial-and-error approach with the spreadsheet to develop your best guess for the optimal solution.(c) Use the spreadsheet to check the possibility of purchasing 100 units of Asset 1.5 100 Asset 3 0. x3) = (100. x3) = (100. and 200 units of Asset 3.5 1. 200) Year 5 10 20 Asset 1 2 0. 10.And .5 0 125 Asset 2 1 0.5 350 >= >= >= Minimum Cash Flow Requirement 400 100 300 325 (e) Use the Excel Solver to solve the model by the simplex method. and 20 years from now? What would be the total amount invested? Solution (x1. and $550 million in 20 years.5 1.5 0 100 Asset 2 1 0. x2.5 0 100 Asset 2 1 0.5 1 2 200 Actual Cash Flow 400 300 550 >= >= >= Minimum Cash Flow Requirement 400 100 300 400 (x1.Error Solution Year 5 10 20 Asset 1 2 0.5 1 2 100 Actual Cash Flow 400 212.5 1 2 0 Actual Cash Flow 400 150 300 >= >= >= Minimum Cash Flow Requirement 400 100 300 300 .5 200 Asset 3 0.5 100 Asset 3 0. x2. 100 units of Asset 2. Solver Optimal Solution Year 5 10 20 Asset 1 2 0. 100. 100. What is the total amount invested for your solution? Trial .5 1.

3. ( ) [ ]( ) ( ) ( ) ( ) (b) Use the given information to identify the shadow prices for the three resources. After you apply the simplex method. x2≥0.Problem 5. for j=1. x3≥0 Let x4. a portion of the final simplex tableau is as follows: . and x6 denote slack variables for the respective constrains.x3≤3 X1+2x2+ x3≤1 And x1≥0. 2. ( )[ ] ( ) Problem 5. 5 You are given the facts that the basic variables in the optimal solution are x3. x1 and x5 and that [ ] [ ] (a) Use the given information to identify the optimal solution.3-3 Consider the following problem Maximize Subject to Z=6x1+x2+2x3 2x1+2x2+ x3≤2 -4x1-2x2. x5. 4.2-1 Consider the following problem Maximize Subject to Z=8x1+4x2+6x3+3x4+9x5 x1+2x2+3x3+3x4≤180 4x1+3x2+2x3+x4+x5≤270 X1+x2+x4+3x5≤180 And xj≥0.

Final constraint columns for (x1. Variable Z Z x5 x3 x1 (0) (1) (2) (3) 1 0 0 0 Coefficient of: x1 x2 x3 x4 2 1 -2 1 x5 0 1 0 0 x6 2 2 4 -1 Right Side Use the fundamental insight presented in Sec 5. x3): ( ( The final objective coefficients: ( RHS: ( ) ( )( ) ) ( ) ( ) ) ( ) )( ) ( ) ( )( ) Final Simplex Tableau Basic Eq.Basic Eq.3 to identify the missing numbers in the final simplex tableau. x2. Variable Z Z x5 x3 x1 (0) (1) (2) (3) 1 0 0 0 Coefficient of: x1 0 0 0 1 x2 7 4 4 0 x3 0 0 1 0 x4 2 1 -2 1 x5 0 1 0 0 x6 2 2 4 -1 Right Side 6 7 0 1 . Show your calculations.

f°¾½nf °°°fnffn°¾¯°¾fff f°¯f ° f ¾ °¯ fff f¾°°¾f °°°f %fff °¾¯°°fff% @¾ f¯°°¾f °°° f½¾¯¾f°¯ f¾fff °¾¯°ff¯ J ¾n f° f° ° ¯¾ f° ff ¾ f °°° fn f¾ f°°n°fn°¾f°¾¾½ ¯ ++ ++.

f¯9 + + .+ ++ + + + + + + + % % ¯ffn¯½°f½f¯¯°¯¾½ ¯ .

+ ©n ++ ++.

+ ++ + + + + + + + ° .

.

%n% ¾¯ ¾¯½¯ .

f°f¾. ^[TW .

fnn.

°¯¯.¾ @n¯½f°f¾ ¾nn°¾n°°nn½f°¾ f°f¾¯°¯°¾ °½½f°°°¾ n¯½f° @nff¾n°¾n°n¾¾ . f¯f©½ n°.f° ¯f ½nf¾ ° °¾ °f°nf f¾¾¾ fn n n¾¾ ¯° ½ ° fn°f°¾¯f ½nf¾ @f¾¾¾½n°n¯ f°f¾¯° °f °n¯¾°nff¾¯°¯¯nf¾ ¯°¾°¾f¾ %°n¾¾°n¯ f ¯°¯¯¯°¾fn¯½ ¾°nf¾°½f¯°¾ ¾f¾ff°¾f°½¯¯°¯¯nf¾ ¯°¾°°¯ ½ %@°f ¾¾ f¯°°n¯°f fn°fnf¾¾f° ¯°¯¯f¯°°n¯°fn¯½¾°f°nn ½f° n°¾n f °n¯½D°¾¾ ¾¾ ¾¾ ¾¾ .f° °¾ °¾ ¾¯ n¯½f°#¾ ¯° ° ¯ ¾ nf¾ °¾ .

f° ¾¾ ¯° ¯ °¾¯°¾ ° f¾¾¾ f n nf¾ ¯°¾¯°¯°ff¯°°¾ %f% ¯ff°f½f¯¯°¯¾½ ¯ .f¾ ¯° ¯° ¯° ¯° ¯° ¯° ¯° ¯° ¯° ¯° ¯° .°¯.

©n ° ++ ++ + + + % % ¾½f¯°f¾½f¾ . f ¾¾ ¾¾ ¾¾ nf.

°¯¯.f¾ .

f¾¯° .

%n% D¾ ¾½f¾ nn ½¾¾ ½nf¾° °¾ ¾¾ °¾ ¾¾ f°°¾¾¾ ¯nnf¾¾¯°¾¯°¾°f f°f¾¯°"Jf ff¯°°¾" °% % % % f ¾¾ ¾¾ ¾¾ nf.

f¾ .°¯¯.

f¾¯° % % % %¾ff¾ ¾°n°f¯°°f¾ ¯°°f¾ f°¯°°f¾ @f°¾ ¯° %% @ff¯°¾¾ff f° f½½fn¾½f¾½ ¾ ¾¾½¯f¾° Jf¾ff¯°°¾¾°" @f ° ° f ¾¾ ¾¾ ¾¾ nf.

f¾ .°¯¯.

f¾¯° %% D¾n¾¯ ¾¯½¯ ½¯f° f ¾¾ ¾¾ ¾¾ nf.

°¯¯.f¾ .

f¾¯° .

^[TW .

°¾°½ ¯ .f¯ ++++ ©n +++ ++++ O+++ °© © f°fn¾f f¾nff ¾°½¯f¾°f f°f°f % %f% D¾°°¯f°°½¯f¾° I I % {% %{ % % %% I % % D¾°°¯f°°¾f½n¾¾n¾ I { %%{ % ^[TW .f¯ ©n .

°¾°½ ¯ ++ ++ O++ ° f°°¾fnff ¾¾½nn°¾f°¾ f½½¾¯½ ¯ f½°°f¾¯½f f¾f¾¾ .

f¾n Iff %% %% %% %% .

n° D¾°f¯°f°¾½¾°°n °¯¾¾°°¯ ¾°°f¾¯½ f f nfnf°¾ °fn°¾f°n¯°¾% % @°f ©nnn°¾ { I I { { { { { { { f¾n Iff %% %% %% %% °f¯½@f f .

n° .

- Paper-AUC2007
- Wiley_ Deter Minis Tic Operations Research_ Models and Methods in Linear Optimization
- MB0048 Operations Research
- Lecture 7
- Teaching Reaction Using Attainable Region
- Dual Simplex Method
- The Dynamic Berth Allocation Problem for a Container Port
- Optimization in Practice with MATLAB® For Engineering Students and Professionals
- Optimality
- Simplex Method
- Engineering Project Summary(6)
- Chap09[2] LS Modif
- Paper8-Solving the Resource Constrained Project Scheduling Problem to Minimize the Financial Failure Risk
- Lucrarea
- The Importance of Bfs
- Writing Engineering Abstracts(6)
- GARAGe96-05-01
- compressors
- Rapid Design Exploration to Determine Feasible FPSO
- Network Simplex Method
- OR1 Syllabus
- FP_J.Akbari[A]
- Minimization of Electrical Field in Stator Slot Groundwall Insulation of HV Generators
- Operations Research
- threeprinciplesoftransportationoptimization-120625224119-phpapp01
- 1533.pdf
- C8-ISITES13182
- 1
- 0060019
- ch8_student

Sign up to vote on this title

UsefulNot usefulRead Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading