0% found this document useful (0 votes)

364 views

Management Science Numerical Problems

Management Science Numerical Problems Software oriented approach.

Uploaded by

Srinivas Rao

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

364 views

Management Science Numerical Problems

Management Science Numerical Problems Software oriented approach.

Uploaded by

Srinivas Rao

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 768

MANAGEMENT SCIENCE

NUMERICAL PROBLEMS-

A SOFTWARE ORIENTED
SOLUTION APPROACH FOR
BACHELORS MASTERS AND
PH.D

AUTHOR:
SRINIVAS R RAO
LLB , MBA(FACULTY)
PREFACE
MANAGEMENT SCIENCE NUMERICAL PROBLEMS –A SOFTWARE ORIENTED SOLUTION APPROACH FOR
BACHELORS , MASTERS & PH.D.

This book is the result of my teaching experience in the subject and working experience in various
softwares related to Management Science/Decision Science/Operations Research/Quantitative
Techniques/Quantitative Analysis for Management to Sikkim Manipal University,Udupi students for
about 8 years.It is designed to meet the requirements of research students at Masters and Ph D levels
particularly Engineering and Management(BBA BCA BBM BCOM,M E, MCA MBA and Ph D in
LPP,Mathematics,Engg,Computer Applications and Business Administration).

The main highlight of the book is solved problem approach with the softwares and explanations added
for numerical question problems framed by the author.This book has a good number of problems solved
in all 21 chapters.

I am extremely grateful to all my lecturers so far .Special thanks to Prof Srinivasan from IIT Madras who
has hosted free videos in NPTEL which I referred to in learning the basics initially while working LPP
numerical problems manually.

I also thank various International software makers in the field of LPP which made me enable to work on
NUMERICAL PROBLEMS involving lots of complex data.

There are many problems framed by myself and can be best suitable for other Ph D students during
their RESEARCH WORK in the three fields mentioned below:

ENGINEERING-ALL FIELDS.(BACHELOS LEVEL MASTERS LEVEL AND DOCTORS LEVEL)

COMPUTER APPLICATIONS. (BACHELORS LEVEL MASTERS LEVEL AND DOCTORS LEVEL)

BUSINESS ADMINISTRATION. (BACHELORS LEVEL MASTERS LEVEL AND DOCTORS LEVEL)

SRINIVAS R RAO

EDUNXT CERTIFIED LEVEL 3 FACULTY FOR MBA

TRACKS INDIA INFOTECH LTD,UDUPI

SIKKIM MANIPAL UNIVERSITY,MANIPAL

ABOUT THE AUTHOR

Author’s name is Srinivas R Rao, born and done his school level education in Mangalore,Karnataka in a
reputed private school Canara High School and PUC(+2) from Canara PUC in Science stream with PCMB
as main subjects.
Later, pursuing LL.B(5 Years) course passed the degree in 1999 and done Diploma in Export
Management ,Diploma in Customs and Central Excise , Diploma in Business Adminstration and some
important IT subjects like MS-Office,Internet/Email,Visual Basic 6.0,C,C++,Java,Advanced Java,Oracle
with D2K,HTML with Javascript,VBscript and Active Server Pages.
Joined as a FACULTY for students in a small computer Institute in 2002 July and later after 4 months
worked in a company by name CRP Technologies(I) .P.Ltd as Branch Manager(Risk Manager) for
Mangalore,Udupi and Kasargod areas from January 2003 to June 11 2007.In the year 2005 pursued MBA
distance education course.Currently working , as a FACULTY in Sikkim Manipal University , Udupi centre
for BBA & MBA students and teaching numerical subjects like Statistics/Operations Research(Mgt
Science/Quant. Techniques for Mgt)/Accounting and several numerical and difficult oriented subjects
for distance education students in their weekend contact classes from July 2010 till present day.
Thanks
Regards
Author
(SRINIVAS R RAO)
ABOUT THE BOOK
This book is on Management Science which is a compulsory subject for Bachelors, M.E., B Tech,
M.Tech.,B.Sc and M.Sc(Maths),MBA and Ph.D .However , any Bachelor level students can also read it as
it contains a lot of numerical problems framed by me.

Linear Programmming Problem,Simplex Method , Sensitivity Analysis,Dual Method,Graphical

Analysis,Project Management using PERT/CPM , Networks like Minimal Spanning Tree,Shortest Route
and Maximal Flow Problem,Transportation,Assignment,Integer Linear Programming,Inventory and
Waiting Lines with several models,Decision Analysis,Forecasting with 4 classic methods of
forecasting,Markov Processes,Goal and Dynamic Programming,Simulation Modelling(with seeds),Work
Measurement,Break Even Analysis and Cost Volume Analysis,Game Theory which involves maximin and
minimax strategies finding the value of the game are the various topics covered in this book.

I feel that this is a unique book as there are only numerical problems solved using software approach
with the numerical problems framed by me.

As they are tested on softwares they are correct solutions to various numerical problems used in this
book

HAPPY READING.

THANKS

REGARDS

AUTHOR

SRINIVAS R RAO
MANAGEMENT SCIENCE NUMERICAL
PROBLEMS –A SOFTWARE ORIENTED
SOLUTION APPROACH FOR
BACHELORS,MASTERS & PH.D.
CHAPTERS:
1. LINEAR PROGRAMMING-OPTIMISATION TYPES-MAXIMISATION & MINIMSATION WITH DECISION VARIABLES &
CONSTRAINTS NOT INCLUDING NON NEGATIVITY.MAXIMIZE OR MINIMIZE THE VALUE OF LINEAR OBJECTIVE
FUNCTION WHICH ARE SUBJECT TO A SET OF LINEAR CONSTRAINTS.
2. SIMPLEX METHOD, SENSITIVITY ANALYSIS, DUALITY & GRAPHICAL ANALYSIS.
3. TRANSPORTATION-OPTIMAL SOLUTIONS TO TRANSPORATION PROBLEMS USING NORTH WEST CORNER RULE,
MINIMUM COST METHOD, VOGEL’S APPROXIMATION METHOD.
4. ASSIGNMENT-AGENTS & TASKS - HUNGARIAN ALGORITHM
5. INTEGER LINEAR PROGRAMMING-(1) ALL VARIABLES ARE 0/1 (BINARY) (2) ALL VARIABLES ARE GENERAL
INTEGER (3) MULTIPLE TYPES OF VARIABLES.
6. SHORTEST ROUTE-NODES AND ARCS
7. MINIMAL SPANNING TREE-NODES AND ARCS
8. PERT/CPM-ACTIVITIES AND IMMEDIATE PREDECESSORS FOR EACH ACTIVITY.CERTAIN ACTIVITY TIMES ARE
CALLED AS SINGLE TIME ESTIMATES. UNCERTAIN ACTIVITY TIMES ARE CALLED AS THREE TIME
ESTIMATES.ACTIVITIES AND PREDECESSORS ARE IDENTIFIED AND REPRESENTED BY ALPHABETS.TIME (KNOWN OR
UNKNOWN) IN NUMERICALS.
9. INVENTORY-OPTIMAL INVENTORY DECISIONS CONSIST OF THE FOLLOWING MODELS: ECONOMIC ORDER
QUANTITY/ECONOMIC PRODUCTION LOT SIZE/EOQ WITH PLANNED SHORTAGES/EOQ WITH QUANTITY
DISCOUNTS/ORDER QUANTITY-REORDER POINT WITH PROBABILISTIC DEMAND/SINGLE-PERIOD INVENTORY WITH
PROBABILISTIC DEMAND.
10. WAITING LINES-MODELS: POISSON ARRIVALS WITH EXPONENTIAL SERVICE TIMES/POISSON ARRIVALS AND
ARBITRARY SERVICE TIMES/POISSON ARRIVALS AND DETERMINISTIC SERVICE TIMES/POISSON ARRIVALS AND
ARBITRARY SERVICE TIMES (NO WAITING)/POISSON ARRIVALS AND EXPONENTIAL SERVICE TIMES WITH A FINITE
CALLING POPULATION.
11. DECISION ANALYSIS-DECISION ALTERNATIVES AND STATES OF NATURE FOR THE CHANCE EVENT WITH STATE
OF NATURE POSSIBILITIES, COMPUTE DECISION STRATEGY WITH INDICATOR OUTCOMES.
12. FORECASTING - MOVING AVERAGES/EXPONENTIAL SMOOTHING/TREND PROJECTION/TREND & SEASONAL
COMPONENTS
13. MARKOV PROCESSES-STATES.BOTH MARKOV PROCESSES INVOLVING STEADY STATE BEHAVIOR AND
ABSORBING STATES ARE ANALYZED.TRANSIENT AND RECURRENT STATES ARE ALSO SEEN.
14. GOAL PROGRAMMING-INCLUDES PRIORITY
15. DYNAMIC PROGRAMMING-SHORTEST ROUTE PROBLEM, TRAVELLING SALESMAN PROBLEM, KNAPSACK
PROBLEM.
16. SIMULATION-MODELLING USING DIFFERENT NUMBER OF SEEDS.
17. WORK MEASUREMENT-TIME STUDY/SAMPLE SIZE (TIME STUDY)/WORK SAMPLING (SAMPLE SIZE)
18. BREAK EVEN ANALYSIS & COST VOLUME ANALYSIS-ONE COST FIXED AND ANOTHER COST VARIABLE
19. GAME THEORY-TO FIND THE VALUE OF THE GAME
20. MAXIMAL FLOW PROBLEM.
21. NON LINEAR PROGRAMMING.-UNCONSTRAINED OPTIMUM/LINEARLY CONSTRAINED OPTIMUM/QUADRATIC
PROGRAMMING/UNCONSTRAINED QUADRATIC PROGRAMMING/CONVEX PROGRAMMING/NON CONVEX
PROGRAMMING/SEPARABLE PROGRAMMING/GEOMETRIC PROGRAMMING/LINEAR FRACTIONAL
PROGRAMMING/COMPLEMENTARITY PROBLEM.-MAJOR 10 TYPES OF NONLINEAR PROGRAMMING PROBLEMS .
CHAPTER 1

LINEAR PROGRAMMING

LINEAR PROGRAMMING PROBLEM

The problems do not include non-negativity constraints.

Q1. MAX 10X1+12X2+14X3+16X4+18X5

S.T.

1) 1X1+2X2+3X3+4X4+5X5<19
2) 2X1+5X2+8X3+12X4+14X5<31
3) 4X1+7X2+2X3+9X4+5X5<55
4) 5X1+6X2+7X3+9X4+4X5<78
5) 8X1+3X2+1X3+7X4+9X5<91
OPTIMAL SOLUTION:

Objective Function Value = 129.448

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 10.724 0.000
X2 1.690 0.000
X3 0.138 0.000
X4 0.000 10.559
X5 0.000 12.103

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 4.483 0.000
2 0.000 1.593
3 0.000 0.269
4 13.276 0.000
5 0.000 0.717

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 5.478 10.000 14.105
X2 10.742 12.000 19.429
X3 6.980 14.000 16.294
X4 No Lower Limit 16.000 26.559
X5 No Lower Limit 18.000 30.103

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 14.517 19.000 No Upper Limit
2 30.091 31.000 43.150
3 47.097 55.000 56.176
4 64.724 78.000 No Upper Limit
5 84.333 91.000 108.500

Q2. LINEAR PROGRAMMING PROBLEM

MAX 10X1+13X2+16X3+19X4

S.T.

1) 3X1+6X2+9X3+12X4<100
2) 4X1+6X2+11X3+14X4<200
3) 5X1+7X2+6X3+13X4<300
4) 6X1+8X2+12X3+9X4<400
OPTIMAL SOLUTION:

Objective Function Value = 333.333

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 33.333 0.000
X2 0.000 7.000
X3 0.000 14.000
X4 0.000 21.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 0.000 3.333
2 66.667 0.000
3 133.333 0.000
4 200.000 0.000
OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 6.500 10.000 No Upper Limit
X2 No Lower Limit 13.000 20.000
X3 No Lower Limit 16.000 30.000
X4 No Lower Limit 19.000 40.000

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 0.000 100.000 150.000
2 133.333 200.000 No Upper Limit
3 166.667 300.000 No Upper Limit
4 200.000 400.000 No Upper Limit

Q3. LINEAR PROGRAMMING PROBLEM

MAX 10X1+12X2+14X3+16X4+23X5

S.T.

1) 2X1+9X2+12X3+16X4+18X5<58
2) 6X1+7X2+9X3+12X4+25X5<64
3) 13X1+3X2+16X3+34X4+29X5<79
4) 15X1+9X2+19X3+22X4+45X5<47
5) 21X1+12X2+23X3+30X4+32X5<96
6) 16X1+14X2+25X3+23X4+21X5<70
7) 17X1+6X2+28X3+29X4+28X5<65
8) 18X1+16X2+21X3+17X4+29X5<49
9) 24X1+9X2+24X3+18X4+35X5<73
10) 28X1+19X2+31X3+24X4+40X5<69

OPTIMUM SOLUTION:

Objective Function Value = 41.829

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.000 4.774
X2 1.402 0.000
X3 0.000 3.628
X4 1.563 0.000
X5 0.000 6.246

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 20.377 0.000
2 35.432 0.000
3 21.658 0.000
4 0.000 0.261
5 32.291 0.000
6 14.427 0.000
7 11.266 0.000
8 0.000 0.603
9 32.251 0.000
10 4.854 0.000
OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 No Lower Limit 10.000 14.774
X2 6.806 12.000 15.059
X3 No Lower Limit 14.000 17.628
X4 13.292 16.000 29.333
X5 No Lower Limit 23.000 29.246

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 37.623 58.000 No Upper Limit
2 28.568 64.000 No Upper Limit
3 57.342 79.000 No Upper Limit
4 27.563 47.000 53.193
5 63.709 96.000 No Upper Limit
6 55.573 70.000 No Upper Limit
7 53.734 65.000 No Upper Limit
8 36.318 49.000 53.782
9 40.749 73.000 No Upper Limit
10 64.146 69.000 No Upper Limit

Q4. LINEAR PROGRAMMING PROBLEM

MAX 11X1+19X2+12X3+14X4+31X5+15X6+27X7+34X8+65X9+47X10+34X11+67X12+43X13+21X14+2
2X15+24X16+26X17+29X18+30X19+32X20

S.T.

1) 71X1+21X2+32X3+45X4+62X5+61X6+66X7+67X8+62X9+89X10+31X11+45X12+67X13
+89X14+90X15+91X16+92X17+93X18+98X19+99X20<1000
2) 12X1+23X2+25X3+27X4+31X5+39X6+91X7+98X8+97X9+86X10+65X11+55X12+57X13
+58X14+59X15+24X16+31X17+43X18+46X19+54X20<1200
3) 13X1+29X2+32X3+20X4+45X5+46X6+48X7+97X8+86X9+67X10+69X11+51X12+34X13
+38X14+41X15+47X16+67X17+78X18+89X19+90X20<1400
4) 16X1+9X2+39X3+76X4+21X5+90X6+80X7+69X8+56X9+80X10+71X11+72X12+78X13+
64X14+91X15+99X16+100X17+110X18+44X19+42X20<1600
5) 14X1+20X2+11X3+20X4+21X5+23X6+29X7+30X8+43X9+44X10+46X11+49X12+50X13
+51X14+52X15+90X16+99X17+87X18+80X19+70X20<1800
6) 12X1+99X2+39X3+10X4+12X5+34X6+36X7+38X8+137X9+121X10+111X11+12X12+14
X13+141X14+145X15+21X16+213X17+20X18+201X19+222X20<2000
7) 76X1+89X2+49X3+43X4+100X5+120X6+37X7+121X8+111X9+11X10+10X11+11X12+1
09X13+91X14+27X15+28X16+31X17+34X18+211X19+213X20<2200
8) 45X1+78X2+50X3+41X4+31X5+140X6+38X7+546X8+191X9+211X10+231X11+412X12
+231X13+114X14+115X15+231X16+234X17+209X18+211X19+20X20<2400
9) 55X1+64X2+66X3+20X4+18X5+190X6+66X7+345X8+200X9+199X10+17X11+107X12+
213X13+240X14+210X15+120X16+100X17+80X18+60X19+40X20<2600
10) 56X1+50X2+23X3+76X4+20X5+40X6+60X7+80X8+18X9+100X10+110X11+120X12+11
5X13+121X14+130X15+131X16+135X17+134X18+136X19+139X20<2800
11) 43X1+20X2+143X3+500X4+109X5+900X6+800X7+700X8+5X9+600X10+500X11+400X
12+300X13+200X14+100X15+50X16+40X17+30X18+20X19+10X20<3000
12) 35X1+30X2+151X3+400X4+12X5+13X6+14X7+15X8+16X9+17X10+18X11+19X12+20X
13+22X14+23X15+25X16+26X17+27X18+28X19+29X20<3200
13) 37X1+41X2+150X3+300X4+654X5+100X6+100X7+200X8+300X9+400X10+500X11+60
0X12+700X13+800X14+900X15+986X16+786X17+345X18+238X19+1000X20<3400
14) 38X1+28X2+50X3+200X4+345X5+122X6+110X7+565X8+234X9+100X10+90X11+87X1
2+84X13+58X14+27X15+51X16+39X17+102X18+113X19+132X20<3600
15) 39X1+24X2+318X3+10X4+651X5+132X6+66X7+54X8+312X9+210X10+234X11+231X1
2+315X13+316X14+317X15+318X16+390X17+876X18+327X19+1212X20<3800
16) 21X1+23X2+305X3+100X4+456X5+144X6+245X7+876X8+765X9+310X10+121X11+19
0X12+214X13+289X14+256X15+309X16+903X17+405X18+504X19+678X20<4000
17) 22X1+214X2+5X3+90X4+234X5+156X6+123X7+23X8+110X9+40X10+540X11+867X12
+169X13+980X14+12X15+16X16+18X17+21X18+43X19+817X20<4200
18) 23X1+312X2+7X3+96X4+233X5+198X6+120X7+230X8+234X9+20X10+844X11+789X1
2+216X13+786X14+12X15+2X16+3X17+4X18+5X19+67X20<4400
19) 21X1+99X2+91X3+95X4+211X5+123X6+31X7+312X8+543X9+100X10+890X11+560X1
2+215X13+444X14+234X15+213X16+432X17+567X18+765X19+312X20<4600
20) 20X1+66X2+123X3+85X4+21X5+142X6+66X7+876X8+76X9+10X10+109X11+450X12+
319X13+913X14+666X15+786X16+99X17+77X18+66X19+88X20<4800
21) 27X1+98X2+341X3+5X4+201X5+189X6+34X7+123X8+131X9+10X10+1100X11+340X1
2+333X13+214X14+314X15+908X16+54X17+980X18+347X19+99X20<5000
22) 29X1+83X2+435X3+10X4+290X5+213X6+110X7+565X8+454X9+110X10+2100X11+12
3X12+321X13+412X14+1100X15+777X16+56X17+900X18+98X19+77X20<5200
23) 30X1+39X2+262X3+25X4+213X5+245X6+21X7+119X8+465X9+11X10+3145X11+141X
12+329X13+378X14+110X15+879X16+678X17+87X18+11X20<5400
24) 38X1+20X2+393X3+30X4+312X5+265X6+345X7+123X8+324X9+12X10+5412X11+121
X12+345X13+387X14+169X15+678X16+444X17+65X18+444X19+444X20<5600
25) 33X1+44X2+400X3+35X4+211X5+222X6+765X7+110X8+215X9+13X10+1000X11+144
X12+666X13+980X14+345X15+98X16+5X17+4X18+32X19+1X20<5800

OPTIMAL SOLUTION:

Objective Function Value = 634.945

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 2.952 0.000
X2 10.937 0.000
X3 0.000 10.495
X4 0.000 2.565
X5 0.000 2.251
X6 0.000 19.232
X7 0.577 0.000
X8 0.000 72.350
X9 3.148 0.000
X10 3.528 0.000
X11 0.000 19.102
X12 0.000 3.580
X13 0.201 0.000
X14 0.000 29.820
X15 0.000 10.831
X16 0.000 19.059
X17 0.000 48.505
X18 0.000 16.243
X19 0.000 24.486
X20 0.000 13.514
Constraint Slack/Surplus Dual Prices
-------------- --------------- ------------------
1 0.000 0.066
2 240.287 0.000
3 502.795 0.000
4 933.975 0.000
5 1222.552 0.000
6 0.000 0.024
7 570.783 0.000
8 0.000 0.097
9 325.067 0.000
10 1620.653 0.000
11 0.000 0.006
12 2646.128 0.000
13 288.400 0.000
14 2011.763 0.000
15 1597.894 0.000
16 0.000 0.045
17 1202.281 0.000
18 0.000 0.021
19 1331.891 0.000
20 3642.515 0.000
21 3314.359 0.000
22 2261.354 0.000
23 3304.028 0.000
24 3938.544 0.000
25 3923.859 0.000
OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 7.263 11.000 14.445
X2 15.512 19.000 39.321
X3 No Lower Limit 12.000 22.495
X4 No Lower Limit 14.000 16.565
X5 No Lower Limit 31.000 33.251
X6 No Lower Limit 15.000 34.232
X7 23.643 27.000 39.156
X8 No Lower Limit 34.000 106.350
X9 61.603 65.000 77.423
X10 42.798 47.000 49.685
X11 No Lower Limit 34.000 53.102
X12 No Lower Limit 67.000 70.580
X13 41.545 43.000 46.763
X14 No Lower Limit 21.000 50.820
X15 No Lower Limit 22.000 32.831
X16 No Lower Limit 24.000 43.059
X17 No Lower Limit 26.000 74.505
X18 No Lower Limit 29.000 45.243
X19 No Lower Limit 30.000 54.486
X20 No Lower Limit 32.000 45.514
RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 825.332 1000.000 1101.339
2 959.713 1200.000 No Upper Limit
3 897.205 1400.000 No Upper Limit
4 666.025 1600.000 No Upper Limit
5 577.448 1800.000 No Upper Limit
6 1869.371 2000.000 2031.511
7 1629.217 2200.000 No Upper Limit
8 2352.118 2400.000 2490.374
9 2274.933 2600.000 No Upper Limit
10 1179.347 2800.000 No Upper Limit
11 2418.736 3000.000 5016.841
12 553.872 3200.000 No Upper Limit
13 3111.600 3400.000 No Upper Limit
14 1588.237 3600.000 No Upper Limit
15 2202.106 3800.000 No Upper Limit
16 3172.758 4000.000 6225.806
17 2997.719 4200.000 No Upper Limit
18 4218.455 4400.000 5930.995
19 3268.109 4600.000 No Upper Limit
20 1157.485 4800.000 No Upper Limit
21 1685.641 5000.000 No Upper Limit
22 2938.646 5200.000 No Upper Limit
23 2095.972 5400.000 No Upper Limit
24 1661.456 5600.000 No Upper Limit
25 1876.141 5800.000 No Upper Limit

Q5. LINEAR PROGRAMMING PROBLEM

MIN 11X1+21X2+34X3+42X4+51X5+67X6+72X7+83X8+93X9+100X10
S.T.

1) 5X1+7X2+9X3+11X4+13X5+15X6+17X7+19X8+21X9+23X10>100
2) 8X1+12X2+21X3+34X4+45X5+46X6+76X7+86X8+98X9+111X10>150
3) 11X1+15X2+22X3+22X4+24X5+26X6+28X7+31X8+23X9+33X10>200
4) 13X1+31X2+26X3+32X4+213X5+65X6+67X7+68X8+86X9+79X10>250
5) 16X1+37X2+62X3+42X4+23X5+56X6+23X7+25X8+26X9+28X10>300
6) 19X1+51X2+35X3+52X4+21X5+25X6+51X7+46X8+51X9+77X10>350
7) 22X1+78X2+51X3+67X4+34X5+210X6+23X7+214X8+180X9+87X10>400
8) 25X1+54X2+55X3+119X4+36X5+231X6+25X7+314X8+200X9+67X10>450
9) 28X1+31X2+29X3+110X4+29X5+112X6+26X7+231X8+220X9+75X10>500
10) 31X1+27X2+90X3+21X4+101X5+111X6+31X7+254X8+240X9+77X10>550
11) 37X1+65X2+34X3+134X4+22X5+99X6+23X7+214X8+41X9+29X10>600
12) 39X1+33X2+45X3+124X4+31X5+79X6+213X7+160X8+120X9+32X10>650

OPTIMAL SOLUTION:

Objective Function Value = 220.000

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 20.000 0.000
X2 0.000 5.600
X3 0.000 14.200
X4 0.000 17.800
X5 0.000 22.400
X6 0.000 34.000
X7 0.000 34.600
X8 0.000 41.200
X9 0.000 46.800
X10 0.000 49.400

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 0.000 -2.200
2 10.000 0.000
3 20.000 0.000
4 10.000 0.000
5 20.000 0.000
6 30.000 0.000
7 40.000 0.000
8 50.000 0.000
9 60.000 0.000
10 70.000 0.000
11 140.000 0.000
12 130.000 0.000
OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 0.000 11.000 15.000
X2 15.400 21.000 No Upper Limit
X3 19.800 34.000 No Upper Limit
X4 24.200 42.000 No Upper Limit
X5 28.600 51.000 No Upper Limit
X6 33.000 67.000 No Upper Limit
X7 37.400 72.000 No Upper Limit
X8 41.800 83.000 No Upper Limit
X9 46.200 93.000 No Upper Limit
X10 50.600 100.000 No Upper Limit

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 96.154 100.000 No Upper Limit
2 No Lower Limit 150.000 160.000
3 No Lower Limit 200.000 220.000
4 No Lower Limit 250.000 260.000
5 No Lower Limit 300.000 320.000
6 No Lower Limit 350.000 380.000
7 No Lower Limit 400.000 440.000
8 No Lower Limit 450.000 500.000
9 No Lower Limit 500.000 560.000
10 No Lower Limit 550.000 620.000
11 No Lower Limit 600.000 740.000
12 No Lower Limit 650.000 780.000

Q6, LINEAR PROGRAMMING PROBLEM

MAX 4X1+14X2

S.T.

1) 5X1+2X2<10
2) 2X1+9X2<15
3) 7X1+10X2<20
4) 9X1+12X2<25
5) 12X1+17X2<30
6) 11X1+23X2<35
7) 13X1+28X2<40
8) 19X1+32X2<45
9) 18X1+33X2<50

OPTIMAL SOLUTION:

Objective Function Value = 19.688

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.000 4.313
X2 1.406 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 7.188 0.000
2 2.344 0.000
3 5.938 0.000
4 8.125 0.000
5 6.094 0.000
6 2.656 0.000
7 0.625 0.000
8 0.000 0.438
9 3.594 0.000
OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 No Lower Limit 4.000 8.313
X2 6.737 14.000 No Upper Limit

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 2.813 10.000 No Upper Limit
2 12.656 15.000 No Upper Limit
3 14.063 20.000 No Upper Limit
4 16.875 25.000 No Upper Limit
5 23.906 30.000 No Upper Limit
6 32.344 35.000 No Upper Limit
7 39.375 40.000 No Upper Limit
8 0.000 45.000 45.714
9 46.406 50.000 No Upper Limit

Q7. LINEAR PROGRAMMING PROBLEM

MAX 4X1+14X2

S.T.

1) 5X1+2X2<10
2) 2X1+9X2<15
3) 7X1+10X2<20
4) 9X1+12X2<25
5) 12X1+17X2>30
6) 11X1+23X2>35
7) 13X1+28X2>40
8) 19X1+32X2>45
9) 18X1+33X2>50

OPTIMAL SOLUTION:

Objective Function Value = 23.953

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.698 0.000
X2 1.512 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 3.488 0.000
2 0.000 1.349
3 0.000 0.186
4 0.581 0.000
5 4.070 0.000
6 7.442 0.000
7 11.395 0.000
8 16.628 0.000
9 12.442 0.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 3.111 4.000 9.800
X2 5.714 14.000 18.000
RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 6.512 10.000 No Upper Limit
2 10.833 15.000 18.000
3 17.635 20.000 20.439
4 24.419 25.000 No Upper Limit
5 No Lower Limit 30.000 34.070
6 No Lower Limit 35.000 42.442
7 No Lower Limit 40.000 51.395
8 No Lower Limit 45.000 61.628
9 No Lower Limit 50.000 62.442

Q8. LINEAR PROGRAMMING PROBLEM

MAX 10X1+12X2+14X3

S.T.

1) 45X1+79X2+90X3<20
2) 68X1+100X2+130X3<40
3) 100X1+140X2+180X3<60

OPTIMAL SOLUTION

Objective Function Value = 4.444

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.444 0.000
X2 0.000 5.556
X3 0.000 6.000
Constraint Slack/Surplus Dual Prices
-------------- --------------- ------------------
1 0.000 0.222
2 9.778 0.000
3 15.556 0.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 7.000 10.000 No Upper Limit
X2 No Lower Limit 12.000 17.556
X3 No Lower Limit 14.000 20.000

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 0.000 20.000 26.471
2 30.222 40.000 No Upper Limit
3 44.444 60.000 No Upper Limit

Q9. LINEAR PROGRAMMING PROBLEM

MAX 6X1+12X2+18X3+24X4+32X5+38X6

S.T.

1) 11X1+21X2+31X3+41X4+51X5+61X6<100
2) 12X1+22X2+33X3+44X4+55X5+66X6<160
3) 13X1+26X2+39X3+48X4+59X5+62X6<220
4) 14X1+28X2+38X3+46X4+56X5+67X6<280
5) 15X1+30X2+45X3+60X4+75X5+90X6<360
6) 16X1+32X2+48X3+55X4+67X5+78X6<420

OPTIMAL SOLUTION:

Objective Function Value = 62.745

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.000 0.902
X2 0.000 1.176
X3 0.000 1.451
X4 0.000 1.725
X5 1.961 0.000
X6 0.000 0.275

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 0.000 0.627
2 52.157 0.000
3 104.314 0.000
4 170.196 0.000
5 212.941 0.000
6 288.627 0.000

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 No Lower Limit 6.000 6.902
X2 No Lower Limit 12.000 13.176
X3 No Lower Limit 18.000 19.451
X4 No Lower Limit 24.000 25.725
X5 31.770 32.000 No Upper Limit
X6 No Lower Limit 38.000 38.275

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 0.000 100.000 148.364
2 107.843 160.000 No Upper Limit
3 115.686 220.000 No Upper Limit
4 109.804 280.000 No Upper Limit
5 147.059 360.000 No Upper Limit
6 131.373 420.000 No Upper Limit

Q.10 LINEAR PROGRAMMING PROBLEM

MAX 10X1+12X2

S.T.

1) 5X1+7X2<13
2) 6X1+9X2<15

OPTIMAL SOLUTION:

Objective Function Value = 25.000

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 2.500 0.000
X2 0.000 3.000
Constraint Slack/Surplus Dual Prices
-------------- --------------- ------------------
1 0.500 0.000
2 0.000 1.667

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 8.000 10.000 No Upper Limit
X2 No Lower Limit 12.000 15.000

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 12.500 13.000 No Upper Limit
2 0.000 15.000 15.600

Q11. LINEAR PROGRAMMING PROBLEM

MIN 21X1+24X2+27X3+29X4+31X5+36X6+39X7+41X8

S.T.

1) 1X1+3X2+5X3+7X4+9X5+11X6+13X7+15X8>10
2) 5X1+8X2+13X3+17X4+21X5+25X6+28X7+31X8>20
3) 10X1+14X2+18X3+22X4+26X5+29X6+32X7+36X8>30
4) 15X1+22X2+25X3+29X4+33X5+39X6+41X7+48X8>40
5) 20X1+27X2+31X3+37X4+39X5+45X6+48X7+52X8>50
6) 25X1+29X2+34X3+36X4+39X5+49X6+53X7+55X8>60
7) 30X1+32X2+34X3+36X4+38X5+40X6+42X7+44X8>70
8) 35X1+36X2+37X3+38X4+39X5+41X6+43X7+45X8>80
9) 40X1+42X2+44X3+46X4+48X5+58X6+60X7+62X8>90
10) 45X1+49X2+54X3+58X4+59X5+69X6+79X7+89X8>120
11) 50X1+60X2+70X3+80X4+90X5+100X6+110X7+120X8>150
12) 55X1+64X2+73X3+82X4+91X5+100X6+111X7+123X8>180

OPTIMAL SOLUTION

Objective Function Value = 61.923

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 0.292 0.000
X2 0.000 0.480
X3 0.000 0.919
X4 0.000 0.399
X5 1.718 0.000
X6 0.000 2.073
X7 0.000 1.658
X8 0.062 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 6.682 0.000
2 19.456 0.000
3 19.815 0.000
4 24.042 0.000
5 26.057 0.000
6 17.701 0.000
7 6.761 0.000
8 0.000 -0.165
9 7.973 0.000
10 0.000 -0.040
11 26.638 0.000
12 0.000 -0.244

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 20.071 21.000 21.622
X2 23.520 24.000 No Upper Limit
X3 26.081 27.000 No Upper Limit
X4 28.601 29.000 No Upper Limit
X5 27.382 31.000 31.356
X6 33.927 36.000 No Upper Limit
X7 37.342 39.000 No Upper Limit
X8 40.373 41.000 43.396

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 No Lower Limit 10.000 16.682
2 No Lower Limit 20.000 39.456
3 No Lower Limit 30.000 49.815
4 No Lower Limit 40.000 64.042
5 No Lower Limit 50.000 76.057
6 No Lower Limit 60.000 77.701
7 No Lower Limit 70.000 76.761
8 74.394 80.000 81.176
9 No Lower Limit 90.000 97.973
10 119.038 120.000 135.191
11 No Lower Limit 150.000 176.638
12 158.557 180.000 183.226

Q12. LINEAR PROGRAMMING PROBLEM

MIN 3X1+8X2+12X3+17X4+19X5

S.T.

1) 12X1+18X2+24X3+28X4+32X5>20
2) 18X1+29X2+31X3+36X4+29X5>30
3) 24X1+28X2+21X3+31X4+38X5>40
4) 36X1+45X2+52X3+67X4+28X5>50
5) 45X1+121X2+121X3+30X4+31X5>60
6) 51X1+113X2+120X3+322X4+43X5>70
7) 67X1+51X2+122X3+410X4+47X5>80
8) 71X1+54X2+13X3+120X4+67X5>90
9) 82X1+56X2+17X3+90X4+86X5>100
10) 93X1+91X2+19X3+100X4+69X5>110
11) 102X1+110X2+93X3+21X4+81X5>120
12) 114X1+120X2+76X3+45X4+20X5>130
13) 125X1+213X2+74X3+20X4+120X5>140
14) 138X1+119X2+70X3+21X4+131X5>150
15) 149X1+123X2+141X3+154X4+162X5>160

OPTIMAL SOLUTION:

Objective Function Value = 5.000

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 1.667 0.000
X2 0.000 4.500
X3 0.000 9.375
X4 0.000 13.125
X5 0.000 14.250
Constraint Slack/Surplus Dual Prices
-------------- --------------- ------------------
1 0.000 0.000
2 0.000 0.000
3 0.000 -0.125
4 10.000 0.000
5 15.000 0.000
6 15.000 0.000
7 31.667 0.000
8 28.333 0.000
9 36.667 0.000
10 45.000 0.000
11 50.000 0.000
12 60.000 0.000
13 68.333 0.000
14 80.000 0.000
15 88.333 0.000

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 0.000 3.000 6.857
X2 3.500 8.000 No Upper Limit
X3 2.625 12.000 No Upper Limit
X4 3.875 17.000 No Upper Limit
X5 4.750 19.000 No Upper Limit

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 No Lower Limit 20.000 20.000
2 No Lower Limit 30.000 30.000
3 40.000 40.000 No Upper Limit
4 No Lower Limit 50.000 60.000
5 No Lower Limit 60.000 75.000
6 No Lower Limit 70.000 85.000
7 No Lower Limit 80.000 111.667
8 No Lower Limit 90.000 118.333
9 No Lower Limit 100.000 136.667
10 No Lower Limit 110.000 155.000
11 No Lower Limit 120.000 170.000
12 No Lower Limit 130.000 190.000
13 No Lower Limit 140.000 208.333
14 No Lower Limit 150.000 230.000
15 No Lower Limit 160.000 248.333

Q13. LINEAR PROGRAMMING PROBLEM

MIN 100X1+200X2+300X3+400X4+500X5+600X6+700X7+800X8+900X9+1000X10

S.T.

1) 10X1+20X2+30X3+40X4+50X5+60X6+70X7+80X8+90X9+100X10>150
2) 15X1+20X2+25X3+30X4+35X5+40X6+45X7+50X8+55X9+60X10>250
3) 20X1+40X2+60X3+80X4+100X5+120X6+140X7+160X8+180X9+200X10>300
4) 25X1+35X2+45X3+55X4+65X5+75X6+85X7+95X8+105X9+115X10>350
5) 30X1+50X2+70X3+90X4+110X5+130X6+150X7+170X8+190X9+210X10>400
6) 35X1+60X2+85X3+110X4+135X5+160X6+185X7+200X8+225X9+250X10>450
7) 40X1+42X2+44X3+46X4+48X5+50X6+52X7+54X8+56X9+60X10>500
8) 45X1+46X2+47X3+48X4+49X5+50X6+51X7+52X8+53X9+54X10>550
9) 50X1+100X2+150X3+200X4+250X5+300X6+350X7+400X8+450X9+500X10>600
10) 55X1+45X2+35X3+25X4+15X5+5X6+15X7+25X8+35X9+45X10>650

OPTIMAL SOLUTION:
Objective Function Value = 1666.667

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 16.667 0.000
X2 0.000 66.667
X3 0.000 133.333
X4 0.000 200.000
X5 0.000 266.667
X6 0.000 333.333
X7 0.000 400.000
X8 0.000 466.667
X9 0.000 533.333
X10 0.000 600.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 16.667 0.000
2 0.000 -6.667
3 33.333 0.000
4 66.667 0.000
5 100.000 0.000
6 133.333 0.000
7 166.667 0.000
8 200.000 0.000
9 233.333 0.000
10 266.667 0.000

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 0.000 100.000 150.000
X2 133.333 200.000 No Upper Limit
X3 166.667 300.000 No Upper Limit
X4 200.000 400.000 No Upper Limit
X5 233.333 500.000 No Upper Limit
X6 266.667 600.000 No Upper Limit
X7 300.000 700.000 No Upper Limit
X8 333.333 800.000 No Upper Limit
X9 366.667 900.000 No Upper Limit
X10 400.000 1000.000 No Upper Limit

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 No Lower Limit 150.000 166.667
2 225.000 250.000 No Upper Limit
3 No Lower Limit 300.000 333.333
4 No Lower Limit 350.000 416.667
5 No Lower Limit 400.000 500.000
6 No Lower Limit 450.000 583.333
7 No Lower Limit 500.000 666.667
8 No Lower Limit 550.000 750.000
9 No Lower Limit 600.000 833.333
10 No Lower Limit 650.000 916.667

Q14. LINEAR PROGRAMMING PROBLEM

MIN 100X1+140X2+321X3+256X4+416X5

S.T.

1) 123X1+167X2+213X3+145X4+122X5>1000
2) 321X1+189X2+245X3+156X4+344X5>2000
3) 412X1+129X2+278X3+178X4+511X5>3000
4) 567X1+134X2+290X3+191X4+677X5>4000
5) 612X1+150X2+312X3+200X4+433X5>5000
6) 145X1+290X2+209X3+215X4+544X5>6000
7) 542X1+310X2+129X3+290X4+199X5>7000

OPTIMAL SOLUTION:

Objective Function Value = 3002.504

Variable Value Reduced Costs

-------------- --------------- ------------------
X1 3.532 0.000
X2 18.924 0.000
X3 0.000 208.713
X4 0.000 147.246
X5 0.000 144.909

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 2594.677 0.000
2 2710.287 0.000
3 896.250 0.000
4 538.291 0.000
5 0.000 -0.056
6 0.000 -0.454
7 780.582 0.000

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 70.000 100.000 571.200
X2 24.510 140.000 200.000
X3 112.287 321.000 No Upper Limit
X4 108.754 256.000 No Upper Limit
X5 271.091 416.000 No Upper Limit

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 No Lower Limit 1000.000 3594.677
2 No Lower Limit 2000.000 4710.287
3 No Lower Limit 3000.000 3896.250
4 No Lower Limit 4000.000 4538.291
5 4421.876 5000.000 25324.138
6 4878.805 6000.000 9666.667
7 No Lower Limit 7000.000 7780.582

Q15. LINEAR PROGRAMMING PROBLEM

MIN 20X1+15X2+10X3+5X4+1X5

S.T.

1) 11X1+21X2+13X3+41X4+12X5>25
2) 13X1+14X2+15X3+16X4+43X5>28
3) 19X1+12X2+21X3+12X4+23X5>32
4) 23X1+18X2+23X3+21X4+51X5>36
5) 61X1+22X2+31X3+23X4+65X5>42

OPTIMAL SOLUTION:

Objective Function Value = 2.083

Variable Value Reduced Costs
-------------- --------------- ------------------
X1 0.000 19.083
X2 0.000 13.250
X3 0.000 8.917
X4 0.000 1.583
X5 2.083 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------
1 0.000 -0.083
2 61.583 0.000
3 15.917 0.000
4 70.250 0.000
5 93.417 0.000

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
X1 0.917 20.000 No Upper Limit
X2 1.750 15.000 No Upper Limit
X3 1.083 10.000 No Upper Limit
X4 3.417 5.000 No Upper Limit
X5 0.000 1.000 1.463

RIGHT HAND SIDE RANGES:

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------
1 16.696 25.000 No Upper Limit
2 No Lower Limit 28.000 89.583
3 No Lower Limit 32.000 47.917
4 No Lower Limit 36.000 106.250
5 No Lower Limit 42.000 135.417
SIMPLEX METHOD,SENSITIVITY ANALYSIS,DUALITY & GRAPHICAL ANALYSIS.

PROBLEM 1:

Objective: Maximize

X1Basic 2
X2NONBasic 0
slack 1NONBasic 0
slack 2Basic 26
Optimal Value (Z) 20

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X12 0 10 8.5714 Infinity
X20 2 12 -Infinity 14

Dual Slack/ Original Lower Upper

ConstraintValue Surplus Value Bound Bound
------------------------------------------------------------------------------------------------------
Constraint 1 2 0 10 0 20.8333
Constraint 2 0 26 50 24 Infinity

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Maximize 10 12
Constraint 1 5 7 <= 10
Constraint 2 12 19 <= 50
----------------------------------------------------------
Solution 2 0 20

Iterations ----------

Iteration 1

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
slack 1 10 5 7 1 0
slack 2 50 12 19 0 1
zj 0 0 0 0 0
cj-zj 10 12 0 0

Iteration 2

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
X2 1.4286 0.7143 1 0.1429 0
slack 2 22.8571 -1.5714 0 -2.7143 1
zj 17.1429 8.5714 12 1.7143 0
cj-zj 1.4286 0 -1.7143 0

Iteration 3

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
X1 2 1 1.4 0.2 0
slack 2 26.0 0 2.2 -2.4 1
zj 20.0 10 14 2 0
cj-zj 0 -2.0 -2.0 0

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 10 50
X1 5 12 >= 10
X2 7 19 >= 12

Intercepts and Intersections ----------

X1 X2 Profit
-------------------------------------------
Point 1 0 0 0
Point 2 0 1.4286 17.1429
Point 3 2 0 20

(untitled)

X2
2.6316

Constraints

1.4286

Isoprofit Line

2.,0.
2 4.1667
X1
PROBLEM 2:

Objective: Maximize

Problem and Results ----------

X1Basic 0
X2Basic 14.2857
slack 1NONBasic 0
slack 2NONBasic 0
Optimal Value (Z) 171.4286

Ranging ----------

Reduced Original Lower Upper

VariableValue Cost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 0 10 8.5714 10.2857
X214.2857 0 12 11.6667 14

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Maximize 10 12
Constraint 1 5 7 <= 100
Constraint 2 12 14 <= 200
----------------------------------------------------------
Solution 0 14.2857 171.4286

Iterations ----------

Iteration 1

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
slack 1 100 5 7 1 0
slack 2 200 12 14 0 1
zj 0 0 0 0 0
cj-zj 10 12 0 0

Iteration 2

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
X2 14.2857 0.7143 1 0.1429 0
slack 2 0 2.0 0 -2 1
zj 171.4286 8.5714 12 1.7143 0
cj-zj 1.4286 0 -1.7143 0

Iteration 3

Cj-- > 10 12 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
X2 14.2857 0 1 0.8571 -0.3571
X1 0 1 0 -1 0.5
zj 171.4286 10 12 .2857 .7143
cj-zj 0 0 -0.2857 -0.7143

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 100 200
X1 5 12 >= 10
X2 7 14 >= 12

Intercepts and Intersections ----------

X1 X2 Profit
-------------------------------------------
Point 1 0 0 0
Point 2 0 14.2857 171.4286
Point 3 16.6667 0 166.6667
Point 4 0 14.2857 171.4286

LPP-Example1

X20.,14.29
14.2857

Constraints

Isoprofit Line

16.6667 20
X1
PROBLEM 3:
Objective: Maximize

Problem and Results ----------

X1Basic 5.824
X2Basic 3.427
slack 1NONBasic 0
slack 2NONBasic 0
Optimal Value (Z) 288.1648

Ranging ----------

Reduced Original Lower Upper

Variable Value Cost Value Bound Bound
------------------------------------------------------------------------------------------------------
X 15.824 0 23 14.6739 28.4211
X 23.427 0 45 36.4167 70.5333

Dual Slack/ Original Lower Upper

Constraint Value Surplus Value Bound Bound
------------------------------------------------------------------------------------------------------
Constraint 1 1.4345 0 135 101.1957 196
Constraint 2 .3858 0 245 168.75 326.8421

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Maximize 23 45
Constraint 1 12 19 <= 135
Constraint 2 15 46 <= 245
----------------------------------------------------------
Solution 5.824 3.427 288.1648

Iterations ----------

Iteration 1

Cj-- > 23 45 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
slack 1 135 12 19 1 0
slack 2 245 15 46 0 1
zj 0 0 0 0 0
cj-zj 23 45 0 0

Iteration 2

Cj-- > 23 45 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
slack 1 33.8043 5.8043 0 1 -0.413
X2 5.3261 0.3261 1 0 0.0217
zj 239.6739 14.6739 45 0 .9783
cj-zj 8.3261 0 0 -0.9783

Iteration 3

Cj-- > 23 45 0 0
Basic Quantity X1 X2 slack 1 slack 2
-----------------------------------------------------------------
X1 5.824 1 0 0.1723 -0.0712
X2 3.427 0 1 -0.0562 0.0449
zj 288.1648 23 45 1.4345 .3858
cj-zj 0 0 -1.4345 -0.3858

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 135 245
X1 12 15 >= 23
X2 19 46 >= 45

Intercepts and Intersections ----------

X1 X2 Profit
-------------------------------------------
Point 1 0 0 0
Point 2 11.25 0 258.75
Point 3 0 5.3261 239.6739
Point 4 5.824 3.427 288.1648

LPP-Example2

X2
7.1053

Constraints

5.3261

5.82,3.43

Isoprofit Line

11.25 16.3333
X1
Objective: Maximize

Problem and Results ----------

X1NONBasic 0
X2Basic 8.2105
X3Basic .6316
slack 1NONBasic 0
slack 2NONBasic 0
slack 3Basic 363.1579
Optimal Value (Z) 107.3684

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 .5263 10 -Infinity 10.5263
X28.2105 0 12 11.2 13.0345
X3.6316 0 14 12.8889 15

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Maximize10 12 14
Constraint 123 27 29 <= 240
Constraint 236 40 50 <= 360
Constraint 350 10 55 <= 480
---------------------------------------------------------------------
Solution0 8.2105 .6316 107.3684

Iterations ----------

Iteration 1

Cj--> 10 12 14 0 0 0
BasicQuantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 240 23 27 29 1 0 0
slack 2 360 36 40 50 0 1 0
slack 3 480 50 10 55 0 0 1
zj 0 0 0 0 0 0 0
cj-zj 10 12 14 0 0 0

Iteration 2

Cj--> 10 12 14 0 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 31.2 2.12 3.8 0 1 -0.58 0
X3 7.2 0.72 0.8 1 0 0.02 0
slack 3 84.0 10.4 -34 0 0 -1.1 1
zj 100.8 10.08 11.2 14 0 .28 0
cj-zj -0.08 0.8 0 0 -0.28 0
Iteration 3

Cj--> 10 12 14 0 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
X2 8.2105 0.5579 1 0 0.2632 -0.1526 0
X3 0.6316 0.2737 0 1 -0.2105 0.1421 0
slack 3 363.1579 29.3684 0 0 8.9474 -6.2895 1
zj 107.3684 10.5263 12 14 .2105 .1579 0
cj-zj -0.5263 0 0 -0.2105 -0.1579 0

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Minimize 240 360 480
X1 23 36 50 >= 10
X2 27 40 10 >= 12
X3 29 50 55 >= 14
Problem 5
Objective: Maximize

Problem and Results ----------

X1Basic 20
X2NONBasic 0
X3NONBasic 0
slack 1Basic 200
slack 2Basic 100
slack 3NONBasic 0
Optimal Value (Z) 2000

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X120 0 100 93.75 Infinity
X20 10 150 -Infinity 160
X30 30 200 -Infinity 230

Dual Slack/ Original Lower Upper

Original Problem w/answers ---------

X1 X2 X3 RHS
---------------------------------------------------------------------
Maximize100 150 200
Constraint 110 18 39 <= 400
Constraint 220 38 59 <= 500
Constraint 330 48 69 <= 600
---------------------------------------------------------------------
Solution20 0 0 2000

Iterations ----------

Iteration 1

Cj--> 150 200 0 0 0

BasicQuantity X2 X3 slack 1 slack 2 slack 3
100

---------------------------------------------------------------------------------------
X1

slack 1 400 10 18 39 1 0 0
slack 2 500 20 38 59 0 1 0
slack 3 600 30 48 69 0 0 1
zj 0 0 0 0 0 0 0
cj-zj 100 150 200 0 0 0

Iteration 2

Cj--> 100 150 200 0 0 0

Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 69.4915 -3.2203 -7.1186 0 1 -0.661 0
X3 8.4746 0.339 0.6441 1 0 0.0169 0
slack 3 15.2542 6.6102 3.5593 0 0 -1.1695 1
Zj 1,694.9153 67.7966 128.8136 200 0 3.3898 0
cj-zj 32.2034 21.1864 0 0 -3.3898 0
Iteration 3

Cj--> 100 150 200 0 0 0

Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 76.9231 0 -5.3846 0 1 -1.2308 0.4872
X3 7.6923 0 0.4615 1 0 0.0769 -0.0513
X1 2.3077 1 0.5385 0 0 -0.1769 0.1513
Zj 1,769.2308 100 146.1538 200 0 -2.3077 4.8718
cj-zj 0 3.8462 0 0 2.3077 -4.8718

Iteration 4

Cj--> 100 150 200 0 0 0

Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 100.0 10.0 0 0 1 -3.0 2.0
X3 5.7143 -0.8571 0 1 0 0.2286 -0.181
X2 4.2857 1.8571 1 0 0 -0.3286 0.281
Zj 1,785.7143 107.1429 150 200 0 -3.5714 5.9524
cj-zj -7.1429 0 0 0 3.5714 -5.9524

Iteration 5

Cj--> 100 150 200 0 0 0

Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 175.0 -1.25 0 13.125 1 0 -0.375
slack 2 25.0 -3.75 0 4.375 0 1 -0.7917
X2 12.5 0.625 1 1.4375 0 0 0.0208
Zj 1,875.0 93.75 150 215.625 0 0 3.125
cj-zj 6.25 0 -15.625 0 0 -3.125

Iteration 6

Cj--> 100 150 200 0 0 0

Basic Quantity X1 X2 X3 slack 1 slack 2 slack 3
---------------------------------------------------------------------------------------
slack 1 200.0 0 2.0 16.0 1 0 -0.3333
slack 2 100.0 0 6.0 13.0 0 1 -0.6667
X1 20.0 1 1.6 2.3 0 0 0.0333
Zj 2,000.0 100 160 230 0 0 3.3333
cj-zj 0 -10.0 -30.0 0 0 -3.3333

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Minimize 400 500 600
X1 10 20 30 >= 100
X2 18 38 48 >= 150
X3 39 59 69 >= 200
Problem 6:
Objective: Minimize

Problem and Results ----------

X1 NONBasic 0
X2 Basic 12.7273
surplus 1 NONBasic 0
surplus 2 Basic 730
Optimal Value (Z) 152.7273

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 .8182 9 8.1818 Infinity
X212.7273 0 12 0 13.2

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Minimize 9 12
Constraint 1 15 22 >= 280
Constraint 2 45 88 >= 390
----------------------------------------------------------
Solution 0 12.7273 152.7273

Iterations ----------

Iteration 1

Cj-- > 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------
artfcl 1 280 15 22 1 -1 0 0
artfcl 2 390 45 88 0 0 1 -1
zj 670 -60 -110 1 1 1 1
cj-zj 60 110 0 -1 0 -1

Iteration 2

Cj-- > 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------
artfcl 1 182.5 3.75 0 1 -1 -0.25 0.25
X2 4.4318 0.5114 1 0 0 0.0114 -0.0114
zj 182.5 -3.75 0 1 1 2.25 -.25
cj-zj 3.75 0 0 -1 -1.25 0.25

Iteration 3

Cj-- > 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------
artfcl 1 150 0 -7.3333 1 -1 -0.3333 0.3333
X1 8.6667 1 1.9556 0 0 0.0222 -0.0222
zj 150.0 0 7.3333 1 1 2.3333 -.3333
cj-zj 0 -7.3333 0 -1 -1.3333 0.3333

Iteration 4

Cj-- > 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
----------------------------------------------------------------------------------------
surplus 2 450 0 -22 3 -3 -1 1
X1 18.6667 1 1.4667 0.0667 -0.0667 0 0
Zj 0.0 0 0 2 0 2 0
cj-zj 0 0 -1.0 0 -1.0 0

Iteration 5

Cj--> 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
----------------------------------------------------------------------------------------
surplus 2 450 0 -22 3 -3 -1 1
X1 18.6667 1 1.4667 0.0667 -0.0667 0 0
Zj 168.0 9 10.8 -.6 .6 0 0
cj-zj 0 1.2 0.6 -0.6 0 0

Iteration 6

Cj--> 9 12 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
----------------------------------------------------------------------------------------
surplus 2 730.0 15.0 0 4.0 -4.0 -1 1
X2 12.7273 0.6818 1 0.0455 -0.0455 0 0
Zj 152.7273 9.8182 12 -.5455 .5455 0 0
cj-zj -0.8182 0 0.5455 -0.5455 0 0

Dual ----------

y1 y2
---------------------------------------------------------
Maximize 280 390
X1 15 45 <= 9
X2 22 88 <= 12

Intercepts and Intersections ----------

X1 X2 Cost
-------------------------------------------
Point 1 0 12.7273 152.7273
Point 2 18.6667 0 168
LPP-Example5

X2
12.7273
0.,12.73

Constraints

Isoprofit Line

4.4318

8.6667 18.6667
X1
Problem 7
Objective: Minimize

Problem and Results ----------

X1 NONBasic 0
X2 Basic 16.5
surplus 1 NONBasic 0
surplus 2 Basic 104.5
Optimal Value (Z) 594

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 6 18 12 Infinity
X216.5 0 36 0 54

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Minimize 18 36
Constraint 1 2 6 >= 99
Constraint 2 5 7 >= 11
----------------------------------------------------------
Solution 0 16.5 594

Iterations ----------

Iteration 1

Cj-- > 18 36 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------
artfcl 1 99 2 6 1 -1 0 0
artfcl 2 11 5 7 0 0 1 -1
zj 110 -7 -13 1 1 1 1
cj-zj 7 13 0 -1 0 -1

Iteration 2

Cj-- > 18 36 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------
artfcl 1 89.5714 -2.2857 0 1 -1 -0.8571 0.8571
X2 1.5714 0.7143 1 0 0 0.1429 -0.1429
zj 89.5714 2.2857 0 1 1 2.8571 -.8571
cj-zj -2.2857 0 0 -1 -1.8571 0.8571

Iteration 3

Cj-- > 18 36 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2
----------------------------------------------------------------------------------------
surplus 2 104.5 -2.6667 0 1.1667 -1.1667 -1 1
X2 16.5 0.3333 1 0.1667 -0.1667 0 0
zj 0 0 0 2 0 2 0
cj-zj 0 0 -1.0 0 -1.0 0

Iteration 4

Dual ----------

y1 y2
---------------------------------------------------------
Maximize 99 11
X1 2 5 <= 18
X2 6 7 <= 36

Intercepts and Intersections ----------

X1 X2 Cost
-------------------------------------------
Point 1 0 16.5 594
Point 2 49.5 0 891
LPP-Min2-Example6

X2
16.5
0.,16.5

Constraints

Isoprofit Line

1.5714

2.2 49.5
X1
Problem 8
Objective: Minimize

Problem and Results ----------

X1Basic 20
X2NONBasic 0
X3NONBasic 0
surplus 1Basic 60
surplus 2Basic 40
surplus 3NONBasic 0
Optimal Value (Z) 200

Ranging ----------

Reduced Original Lower Upper

VariableValue Cost Value Bound Bound
------------------------------------------------------------------------------------------------------
X120 0 10 0 14.0625
X20 4.3333 15 10.6667 Infinity
X30 8.6667 20 11.3333 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Minimize10 15 20
Constraint 18 9 10 >= 100
Constraint 212 13 14 >= 200
Constraint 315 16 17 >= 300
---------------------------------------------------------------------
Solution20 0 0 200

Iterations ----------

Iteration 1

Cj--> 0 0
Basic artfcl 3 surplus 3
--------------------------------
artfcl 1 0 0
artfcl 2 0 0
artfcl 3 1 -1
Zj 1 1
cj-zj 0 -1

Iteration 2
Cj--> 10 15 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
X3 10 0.8 0.9 1 0.1 -0.1 0 0
artfcl 2 60 0.8 0.4 0 -1.4 1.4 1 -1
artfcl 3 130 1.4 0.7 0 -1.7 1.7 0 0
Zj 190 -2.2 -1.1 0 5.1 -3.1 1 1
cj-zj 2.2 1.1 0 -4.1 3.1 0 -1

Cj--> 0 0
Basic artfcl 3 surplus 3
--------------------------------
X3 0 0
artfcl 2 0 0
artfcl 3 1 -1
Zj 1 1
cj-zj 0 -1

Iteration 3

Cj--> 10 15 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 14.2857 0.8571 0.9286 1 0 0 0.0714 -0.0714
surplus 1 42.8571 0.5714 0.2857 0 -1 1 0.7143 -0.7143
artfcl 3 57.1429 0.4286 0.2143 0 0 0 -1.2143 1.2143
Zj 57.1429 -.4286 -.2143 0 2 0 3.2143 -1.2143
cj-zj 0.4286 0.2143 0 -1.0 0 -2.2143 1.2143

Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0 0
surplus 1 0 0
artfcl 3 1 -1
Zj 1 1
cj-zj 0 -1

Iteration 4

Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0.0588 -0.0588
surplus 1 0.5882 -0.5882
surplus 2 0.8235 -0.8235
Zj 2 0
cj-zj -1.0 0

Iteration 5

Cj-- > 10 15 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 17.6471 0.8824 0.9412 1 0 0 0 0
surplus 1 76.4706 0.8235 0.4118 0 -1 1 0 0
surplus 2 47.0588 0.3529 0.1765 0 0 0 -1 1
Zj 352.9412 2.3529 11.1765 20 0 0 0 0
cj-zj 7.6471 3.8235 0 0 0 0 0
Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0.0588 -0.0588
surplus 1 0.5882 -0.5882
surplus 2 0.8235 -0.8235
Zj -1.1765 1.1765
cj-zj 1.1765 -1.1765

Iteration 6

Cj-- > 10 15 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X1 20.0 1 1.0667 1.1333 0 0 0 0
surplus 1 60.0 0 -0.4667 -0.9333 -1 1 0 0
surplus 2 40.0 0 -0.2 -0.4 0 0 -1 1
Zj 200.0 10 19.3333 28.6667 0 0 0 0
cj-zj 0 -4.3333 -8.6667 0 0 0 0

Cj--> 0 0
Basic artfcl 3 surplus 3
---------------------------------
X1 0.0667 -0.0667
surplus 1 0.5333 -0.5333
surplus 2 0.8 -0.8
Zj -.6667 .6667
cj-zj 0.6667 -0.6667

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Maximize 100 200 300
X1 8 12 15 <= 10
X2 9 13 16 <= 15
X3 10 14 17 <= 20
Problem 9
Objective: Minimize

Problem and Results ----------

X1NONBasic 0
X2Basic 35
X3NONBasic 0
surplus 1Basic 122
surplus 2NONBasic 0
surplus 3Basic 63
Optimal Value (Z) 385

Ranging ----------

Reduced Original Lower Upper

VariableValue Cost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 1.7143 8 6.2857 Infinity
X235 0 11 0 12.4444
X30 1.8571 16 14.1429 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Minimize8 11 16
Constraint 13 7 10 >= 123
Constraint 24 7 9 >= 245
Constraint 39 12 15 >= 357
---------------------------------------------------------------------
Solution0 35 0 385

Iterations ----------

Iteration 1

Cj--> 0 0
Basic artfcl 3 surplus 3
--------------------------------
artfcl 1 0 0
artfcl 2 0 0
artfcl 3 1 -1
Zj 1 1
cj-zj 0 -1

Iteration 2
Cj--> 8 11 16 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
X3 12.3 0.3 0.7 1 0.1 -0.1 0 0
artfcl 2 134.3 1.3 0.7 0 -0.9 0.9 1 -1
artfcl 3 172.5 4.5 1.5 0 -1.5 1.5 0 0
Zj 306.8 -5.8 -2.2 0 4.4 -2.4 1 1
cj-zj 5.8 2.2 0 -3.4 2.4 0 -1

Cj-- > 0 0
Basic artfcl 3 surplus 3
--------------------------------
X3 0 0
artfcl 2 0 0
artfcl 3 1 -1
Zj 1 1
cj-zj 0 -1

Iteration 3

Cj-- > 8 11 16 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
X3 0.8 0 0.6 1 0.2 -0.2 0 0
artfcl 2 84.4667 0 0.2667 0 -0.4667 0.4667 1 -1
X1 38.3333 1 0.3333 0 -0.3333 0.3333 0 0
Zj 84.4667 0 -.2667 0 2.4667 -.4667 1 1
cj-zj 0 0.2667 0 -1.4667 0.4667 0 -1

Cj--> 0 0
Basic artfcl 3 surplus 3
--------------------------------
X3 -0.0667 0.0667
artfcl 2 -0.2889 0.2889
X1 0.2222 -0.2222
Zj 2.2889 -.2889
cj-zj -1.2889 0.2889

Iteration 4

Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0.0667 -0.0667
artfcl 2 -0.6 0.6
surplus 1 0.6667 -0.6667
Zj 2.6 -.6
cj-zj -1.6 0.6

Iteration 5

Cj-- > 8 11 16 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 27.2222 0.4444 0.7778 1 0 0 0.1111 -0.1111
surplus 3 51.3333 -2.3333 -0.3333 0 0 0 1.6667 -1.6667
surplus 1 149.2222 1.4444 0.7778 0 -1 1 1.1111 -1.1111
Zj 0.0 0 0 0 2 0 2 0
cj-zj 0 0 0 -1.0 0 -1.0 0
Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0 0
surplus 3 -1 1
surplus 1 0 0
Zj 2 0
cj-zj -1.0 0

Iteration 6

Cj-- > 8 11 16 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 27.2222 0.4444 0.7778 1 0 0 0.1111 -0.1111
surplus 3 51.3333 -2.3333 -0.3333 0 0 0 1.6667 -1.6667
surplus 1 149.2222 1.4444 0.7778 0 -1 1 1.1111 -1.1111
Zj 435.5556 8.8889 9.5556 16 0 0 -1.7778 1.7778
cj-zj -0.8889 1.4444 0 0 0 1.7778 -1.7778

Cj-- > 0 0
Basic artfcl 3 surplus 3
---------------------------------
X3 0 0
surplus 3 -1 1
surplus 1 0 0
Zj 0 0
cj-zj 0 0

Iteration 7

Cj-- > 8 11 16 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X2 35.0 0.5714 1 1.2857 0 0 0.1429 -0.1429
surplus 3 63.0 -2.1429 0 0.4286 0 0 1.7143 -1.7143
surplus 1 122.0 1.0 0 -1.0 -1 1 1.0 -1.0
Zj 385.0 9.7143 11 17.8571 0 0 -1.5714 1.5714
cj-zj -1.7143 0 -1.8571 0 0 1.5714 -1.5714

Cj--> 0 0
Basic artfcl 3 surplus 3
---------------------------------
X2 0 0
surplus 3 -1 1
surplus 1 0 0
Zj 0 0
cj-zj 0 0

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Maximize 123 245 357
X1 3 4 9 <= 8
X2 7 7 12 <= 11
X3 10 9 15 <= 16
Problem 10.
Objective: Maximize

Problem and Results ----------

X1NONBasic 0
X2Basic 1.2778
slack 1NONBasic 0
slack 2Basic 3.2778
slack 3Basic 6.5556
Optimal Value (Z) 63.8889

Ranging ----------

Reduced Original Lower Upper

VariableValue Cost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 23.3333 10 -Infinity 33.3333
X21.2778 0 50 15 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Maximize10 50
Constraint 112 18 <= 23
Constraint 213 17 <= 25
Constraint 314 16 <= 27
----------------------------------------------------------
Solution0 1.2778 63.8889

Iterations ----------

Iteration 1

Cj--> 10 50 0 0 0
BasicQuantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
slack 1 23 12 18 1 0 0
slack 2 25 13 17 0 1 0
slack 3 27 14 16 0 0 1
zj 0 0 0 0 0 0
cj-zj 10 50 0 0 0

Iteration 2

Cj--> 10 50 0 0 0
Basic Quantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
X2 1.2778 0.6667 1 0.0556 0 0
slack 2 3.2778 1.6667 0 -0.9444 1 0
slack 3 6.5556 3.3333 0 -0.8889 0 1
Zj 63.8889 33.3333 50 2.7778 0 0
cj-zj -23.3333 0 -2.7778 0 0
Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Minimize 23 25 27
X1 12 13 14 >= 10
X2 18 17 16 >= 50

Intercepts and Intersections ----------

X1 X2 Profit
-------------------------------------------
Point 1 0 0 0
Point 2 0 1.2778 63.8889
Point 3 1.9167 0 19.1667

LPP-2v-3c-max-Example9

X2
1.6875

1.4706 Constraints
0.,1.28
1.2778

Isoprofit Line

1...921673186
X1
Problem 11
Objective: Maximize

Problem and Results ----------

X1Basic 1.7333
X2NONBasic 0
slack 1Basic 1.4667
slack 2NONBasic 0
slack 3Basic .2667
Optimal Value (Z) 32.9333

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X11.7333 0 19 18.5294 Infinity
X20 .5333 21 -Infinity 21.5333

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Maximize19 21
Constraint 113 18 <= 24
Constraint 215 17 <= 26
Constraint 316 19 <= 28
----------------------------------------------------------
Solution1.7333 0 32.9333

Iterations ----------

Iteration 1

Cj--> 19 21 0 0 0
BasicQuantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
slack 1 24 13 18 1 0 0
slack 2 26 15 17 0 1 0
slack 3 28 16 19 0 0 1
zj 0 0 0 0 0 0
cj-zj 19 21 0 0 0

Iteration 2

Cj--> 19 21 0 0 0
Basic Quantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
X2 1.3333 0.7222 1 0.0556 0 0
slack 2 3.3333 2.7222 0 -0.9444 1 0
slack 3 2.6667 2.2778 0 -1.0556 0 1
Zj 28 15.1667 21 1.1667 0 0
cj-zj 3.8333 0 -1.1667 0 0

Iteration 3
Cj--> 19 21 0 0 0
Basic Quantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
X2 0.4878 0 1 0.3902 0 -0.3171
slack 2 0.1463 0 0 0.3171 1 -1.1951
X1 1.1707 1 0 -0.4634 0 0.439
Zj 32.4878 19 21 -.6098 0 1.6829
cj-zj 0 0 0.6098 0 -1.6829

Iteration 4

Cj--> 19 21 0 0 0
Basic Quantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
X2 0.3077 0 1 0 -1.2308 1.1538
slack 1 0.4615 0 0 1 3.1538 -3.7692
X1 1.3846 1 0 0 1.4615 -1.3077
Zj 32.7692 19 21 0 1.9231 -.6154
cj-zj 0 0 0 -1.9231 0.6154

Iteration 5

Cj--> 19 21 0 0 0
Basic Quantity X1 X2 slack 1 slack 2 slack 3
----------------------------------------------------------------------------
slack 3 0.2667 0 0.8667 0 -1.0667 1
slack 1 1.4667 0 3.2667 1 -0.8667 0
X1 1.7333 1 1.1333 0 0.0667 0
Zj 32.9333 19 21.5333 0 1.2667 0
cj-zj 0 -0.5333 0 -1.2667 0

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Minimize 24 26 28
X1 13 15 16 >= 19
X2 18 17 19 >= 21

Intercepts and Intersections ----------

X1 X2 Profit
-------------------------------------------
Point 1 0 0 0
Point 2 0 1.3333 28
Point 3 1.7333 0 32.9333
Point 4 1.1707 .4878 32.4878
Point 5 1.3846 .3077 32.7692
LPP-2v3c-Max-Example10

X2
1.5294
1.4737

1.3333 Constraints

Isoprofit Line

1.73,0.
1.73331.751.8462
X1
Problem 12
Objective: Maximize

Problem and Results ----------

X1 Basic 16.75
X2 NONBasic 0
X3 NONBasic 0
slack 1 Basic 1.5
slack 2 NONBasic 0
Optimal Value (Z) 201

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X116.75 0 12 10 Infinity
X20 4 20 -Infinity 24
X30 11 34 -Infinity 45

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Maximize 12 20 34
Constraint 1 2 7 13 <= 35
Constraint 2 4 8 15 <= 67
---------------------------------------------------------------------
Solution 16.75 0 0 201

Iterations ----------

Iteration 1

Cj-- > 12 20 34 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
slack 1 35 2 7 13 1 0
slack 2 67 4 8 15 0 1
zj 0 0 0 0 0 0
cj-zj 12 20 34 0 0

Iteration 2

Cj-- > 12 20 34 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
X3 2.6923 0.1538 0.5385 1 0.0769 0
slack 2 26.6154 1.6923 -0.0769 0 -1.1538 1
zj 91.5385 5.2308 18.3077 34 2.6154 0
cj-zj 6.7692 1.6923 0 -2.6154 0

Iteration 3

Cj-- > 12 20 34 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
X3 0.2727 0 0.5455 1 0.1818 -0.0909
X1 15.7273 1 -0.0455 0 -0.6818 0.5909
Zj 198.0 12 18 34 -2 4
cj-zj 0 2.0 0 2.0 -4.0

Iteration 4

Cj--> 12 20 34 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
X2 0.5 0 1 1.8333 0.3333 -0.1667
X1 15.75 1 0 0.0833 -0.6667 0.5833
Zj 199.0 12 20 37.6667 -1.3333 3.6667
cj-zj 0 0 -3.6667 1.3333 -3.6667

Iteration 5

Cj--> 12 20 34 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
slack 1 1.5 0 3.0 5.5 1 -0.5
X1 16.75 1 2.0 3.75 0 0.25
Zj 201.0 12 24 45 0 3
cj-zj 0 -4.0 -11.0 0 -3.0

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 35 67
X1 2 4 >= 12
X2 7 8 >= 20
X3 13 15 >= 34
Problem 13
Objective: Maximize

Problem and Results ----------

X1 Basic 17.5
X2 NONBasic 0
X3 NONBasic 0
slack 1 Basic 5.5
slack 2 NONBasic 0
Optimal Value (Z) 332.5

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X117.5 0 19 8.8 Infinity
X20 25.5 22 -Infinity 47.5
X30 70 25 -Infinity 95

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Maximize 19 22 25
Constraint 1 1 6 12 <= 23
Constraint 2 2 5 10 <= 35
---------------------------------------------------------------------
Solution 17.5 0 0 332.5

Iterations ----------

Iteration 1

Cj-- > 19 22 25 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
slack 1 23 1 6 12 1 0
slack 2 35 2 5 10 0 1
zj 0 0 0 0 0 0
cj-zj 19 22 25 0 0

Iteration 2

Cj-- > 19 22 25 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
X3 1.9167 0.0833 0.5 1 0.0833 0
slack 2 15.8333 1.1667 0 0 -0.8333 1
zj 47.9167 2.0833 12.5 25 2.0833 0
cj-zj 16.9167 9.5 0 -2.0833 0

Iteration 3

Cj-- > 19 22 25 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
X3 0.7857 0 0.5 1 0.1429 -0.0714
X1 13.5714 1 0 0 -0.7143 0.8571
Zj 277.5 19 12.5 25 -10 14.5
cj-zj 0 9.5 0 10.0 -14.5

Iteration 4

Cj--> 19 22 25 0 0
Basic Quantity X1 X2 X3 slack 1 slack 2
----------------------------------------------------------------------------
slack 1 5.5 0 3.5 7.0 1 -0.5
X1 17.5 1 2.5 5.0 0 0.5
Zj 332.5 19 47.5 95 0 9.5
cj-zj 0 -25.5 -70.0 0 -9.5

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 23 35
X1 1 2 >= 19
X2 6 5 >= 22
X3 12 10 >= 25
Problem 14
Objective: Minimize

Problem and Results ----------

X1Basic 2.2143
X2NONBasic 0
surplus 1Basic 1.5714
surplus 2Basic 1.7857
surplus 3NONBasic 0
Optimal Value (Z) 2.2143

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X12.2143 0 1 0 7
X20 7.7143 9 1.2857 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Minimize1 9
Constraint 112 14 >= 25
Constraint 213 16 >= 27
Constraint 314 18 >= 31
----------------------------------------------------------
Solution2.2143 0 2.2143

Iterations ----------

Iteration 1

Cj--> 1 9 0 0 0 0 0
BasicQuantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
--------------------------------------------------------------------------------------------------
artfcl 1 25 12 14 1 -1 0 0 0
artfcl 2 27 13 16 0 0 1 -1 0
artfcl 3 31 14 18 0 0 0 0 1
zj 83 -39 -48 1 1 1 1 1
cj-zj 39 48 0 -1 0 -1 0

Cj-- > 0
Basic surplus 3
---------------------
artfcl 1 0
artfcl 2 0
artfcl 3 -1
zj 1
cj-zj -1

Iteration 2

Cj-- > 1 9 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
--------------------------------------------------------------------------------------------------
artfcl 1 1.375 0.625 0 1 -1 -0.875 0.875 0
X2 1.6875 0.8125 1 0 0 0.0625 -0.0625 0
artfcl 3 0.625 -0.625 0 0 0 -1.125 1.125 1
zj 2 0 0 1 1 4 -2 1
cj-zj 0 0 0 -1 -3 2 0

Cj-- > 0
Basic surplus 3
---------------------
artfcl 1 0
X2 0
artfcl 3 -1
zj 1
cj-zj -1

Iteration 3

Cj-- > 1 9 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
artfcl 1 0.8889 1.1111 0 1 -1 0 0 -0.7778
X2 1.7222 0.7778 1 0 0 0 0 0.0556
surplus 2 0.5556 -0.5556 0 0 0 -1 1 0.8889
zj 0.8889 -1.1111 0 1 1 2 0 2.7778
cj-zj 1.1111 0 0 -1 -1 0 -1.7778

Cj-- > 0
Basic surplus 3
----------------------
artfcl 1 0.7778
X2 -0.0556
surplus 2 -0.8889
zj -.7778
cj-zj 0.7778

Iteration 4

Cj-- > 1 9 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
X1 0.8 1 0 0.9 -0.9 0 0 -0.7
X2 1.1 0 1 -0.7 0.7 0 0 0.6
surplus 2 1.0 0 0 0.5 -0.5 -1 1 0.5
zj 0 0 0 2 0 2 0 2
cj-zj 0 0 -1.0 0 -1 0 -1.0

Cj-- > 0
Basic surplus 3
----------------------
X1 0.7
X2 -0.6
surplus 2 -0.5
zj 0
cj-zj 0

Iteration 5

Cj-- > 1 9 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
X1 0.8 1 0 0.9 -0.9 0 0 -0.7
X2 1.1 0 1 -0.7 0.7 0 0 0.6
surplus 2 1.0 0 0 0.5 -0.5 -1 1 0.5
Zj 10.7 1 9 5.4 -5.4 0 0 -4.7
cj-zj 0 0 -5.4 5.4 0 0 4.7
Cj-- > 0
Basic surplus 3
----------------------
X1 0.7
X2 -0.6
surplus 2 -0.5
Zj 4.7
cj-zj -4.7

Iteration 6

Cj-- > 1 9 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
X1 2.2143 1 1.2857 0 0 0 0 0.0714
surplus 1 1.5714 0 1.4286 -1 1 0 0 0.8571
surplus 2 1.7857 0 0.7143 0 0 -1 1 0.9286
Zj 2.2143 1 16.7143 0 0 0 0 -.0714
cj-zj 0 -7.7143 0 0 0 0 0.0714

Cj--> 0
Basic surplus 3
----------------------
X1 -0.0714
surplus 1 -0.8571
surplus 2 -0.9286
Zj .0714
cj-zj -0.0714

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Maximize 25 27 31
X1 12 13 14 <= 1
X2 14 16 18 <= 9

Intercepts and Intersections ----------

X1 X2 Cost
-------------------------------------------
Point 1 0 1.7857 16.0714
Point 2 2.2143 0 2.2143
Point 3 .8 1.1 10.7
LPP-2v3c-min-Example13

X2
1.7857
1.7222
1.6875
Constraints

Isoprofit Line

2..07698332.2143
2.21,0.
X1
Problem 15
Objective: Minimize

Problem and Results ----------

X1Basic 1.5
X2NONBasic 0
surplus 1NONBasic 0
surplus 2Basic 1
surplus 3Basic 2
Optimal Value (Z) 10.5

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X11.5 0 7 0 15.1111
X20 9.125 17 7.875 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 RHS
----------------------------------------------------------
Minimize7 17
Constraint 18 9 >= 12
Constraint 210 18 >= 14
Constraint 314 21 >= 19
----------------------------------------------------------
Solution1.5 0 10.5

Iterations ----------

Iteration 1

Cj--> 7 17 0 0 0 0 0
BasicQuantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
--------------------------------------------------------------------------------------------------
artfcl 1 12 8 9 1 -1 0 0 0
artfcl 2 14 10 18 0 0 1 -1 0
artfcl 3 19 14 21 0 0 0 0 1
zj 45 -32 -48 1 1 1 1 1
cj-zj 32 48 0 -1 0 -1 0

Cj-- > 0
Basic surplus 3
---------------------
artfcl 1 0
artfcl 2 0
artfcl 3 -1
zj 1
cj-zj -1

Iteration 2

Cj-- > 7 17 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
--------------------------------------------------------------------------------------------------
artfcl 1 5 3 0 1 -1 -0.5 0.5 0
X2 0.7778 0.5556 1 0 0 0.0556 -0.0556 0
artfcl 3 2.6667 2.3333 0 0 0 -1.1667 1.1667 1
zj 7.6667 -5.3333 0 1 1 3.6667 -1.6667 1
cj-zj 5.3333 0 0 -1 -2.6667 1.6667 0

Cj-- > 0
Basic surplus 3
---------------------
artfcl 1 0
X2 0
artfcl 3 -1
zj 1
cj-zj -1

Iteration 3

Cj-- > 7 17 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
--------------------------------------------------------------------------------------------------
artfcl 1 1.5714 0 0 1 -1 1 -1 -1.2857
X2 0.1429 0 1 0 0 0.3333 -0.3333 -0.2381
X1 1.1429 1 0 0 0 -0.5 0.5 0.4286
zj 1.5714 0 0 1 1 1 1 3.2857
cj-zj 0 0 0 -1 0 -1.0 -2.2857

Cj-- > 0
Basic surplus 3
---------------------
artfcl 1 1.2857
X2 0.2381
X1 -0.4286
zj -1.2857
cj-zj 1.2857

Iteration 4

Cj-- > 7 17 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
artfcl 1 0.8 0 -5.4 1 -1 -0.8 0.8 0
surplus 3 0.6 0 4.2 0 0 1.4 -1.4 -1
X1 1.4 1 1.8 0 0 0.1 -0.1 0
zj 0.8 0 5.4 1 1 2.8 -.8 2
cj-zj 0 -5.4 0 -1 -1.8 0.8 -1.0

Cj-- > 0
Basic surplus 3
----------------------
artfcl 1 0
surplus 3 1
X1 0
zj 0
cj-zj 0

Iteration 5

Cj-- > 7 17 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
surplus 2 1.0 0 -6.75 1.25 -1.25 -1 1 0
surplus 3 2.0 0 -5.25 1.75 -1.75 0 0 -1
X1 1.5 1 1.125 0.125 -0.125 0 0 0
Zj 0 0 0 2 0 2 0 2
cj-zj 0 0 -1.0 0 -1.0 0 -1.0
Cj-- > 0
Basic surplus 3
----------------------
surplus 2 0
surplus 3 1
X1 0
Zj 0
cj-zj 0

Iteration 6

Cj-- > 7 17 0 0 0 0 0
Basic Quantity X1 X2 artfcl 1 surplus 1 artfcl 2 surplus 2 artfcl 3
---------------------------------------------------------------------------------------------------
surplus 2 1.0 0 -6.75 1.25 -1.25 -1 1 0
surplus 3 2.0 0 -5.25 1.75 -1.75 0 0 -1
X1 1.5 1 1.125 0.125 -0.125 0 0 0
Zj 10.5 7 26.125 -.875 .875 0 0 0
cj-zj 0 -9.125 0.875 -0.875 0 0 0

Cj--> 0
Basic surplus 3
----------------------
surplus 2 0
surplus 3 1
X1 0
Zj 0
cj-zj 0

Dual ----------

y1 y2 y3
--------------------------------------------------------------------
Maximize 12 14 19
X1 8 10 14 <= 7
X2 9 18 21 <= 17

Intercepts and Intersections ----------

X1 X2 Cost
-------------------------------------------
Point 1 0 1.3333 22.6667
Point 2 1.5 0 10.5
LPP-2v3c-Min-Example14

X2
1.3333

Constraints

.9048

.7778

Isoprofit Line

1.3571.4 1.5 1.5,0.

X1
Problem 16
Objective: Minimize

Problem and Results ----------

X1 NONBasic 0
X2 Basic 1.8235
X3 NONBasic 0
surplus 1 Basic 4.5294
surplus 2 NONBasic 0
Optimal Value (Z) 18.2353

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 1.3529 9 7.6471 Infinity
X21.8235 0 10 0 11.7692
X30 7.6471 20 12.3529 Infinity

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Minimize9 10 20
Constraint 111 14 17 >= 21
Constraint 213 17 21 >= 31
---------------------------------------------------------------------
Solution0 1.8235 0 18.2353

Iterations ----------

Iteration 1

Cj--> 9 10 20 0 0 0 0
BasicQuantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
artfcl 1 21 11 14 17 1 -1 0 0
artfcl 2 31 13 17 21 0 0 1 -1
Zj 52 -24 -31 -38 1 1 1 1
cj-zj 24 31 38 0 -1 0 -1

Iteration 2

Cj--> 9 10 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
X3 1.2353 0.6471 0.8235 1 0.0588 -0.0588 0 0
artfcl 2 5.0588 -0.5882 -0.2941 0 -1.2353 1.2353 1 -1
Zj 5.0588 .5882 .2941 0 3.2353 -1.2353 1 1
cj-zj -0.5882 -0.2941 0 -2.2353 1.2353 0 -1

Iteration 3

Cj--> 9 10 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 1.4762 0.619 0.8095 1 0 0 0.0476 -0.0476
surplus 1 4.0952 -0.4762 -0.2381 0 -1 1 0.8095 -0.8095
Zj 0 0 0 0 2 0 2 0
cj-zj 0 0 0 -1.0 0 -1.0 0

Iteration 4

Cj--> 9 10 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X3 1.4762 0.619 0.8095 1 0 0 0.0476 -0.0476
surplus 1 4.0952 -0.4762 -0.2381 0 -1 1 0.8095 -0.8095
Zj 29.5238 5.619 3.8095 20 0 0 -.9524 .9524
cj-zj 3.381 6.1905 0 0 0 0.9524 -0.9524

Iteration 5

Cj--> 9 10 20 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
X2 1.8235 0.7647 1 1.2353 0 0 0.0588 -0.0588
surplus 1 4.5294 -0.2941 0 0.2941 -1 1 0.8235 -0.8235
Zj 18.2353 10.3529 10 27.6471 0 0 -.5882 .5882
cj-zj -1.3529 0 -7.6471 0 0 0.5882 -0.5882

Dual ----------

y1 y2
---------------------------------------------------------
Maximize 21 31
X1 11 13 <= 9
X2 14 17 <= 10
X3 17 21 <= 20
Problem 17
Objective: Minimize

Problem and Results ----------

X1 NONBasic 0
X2 NONBasic 0
X3 Basic 1.4444
surplus 1 NONBasic 0
surplus 2 Basic 18.5556
Optimal Value (Z) 41.8889

Ranging ----------

Reduced Original Lower Upper

VariableValueCost Value Bound Bound
------------------------------------------------------------------------------------------------------
X10 .8889 17 16.1111 Infinity
X20 3.6667 23 19.3333 Infinity
X31.4444 0 29 0 30.6

Dual Slack/ Original Lower Upper

Original Problem w/answers ----------

X1 X2 X3 RHS
---------------------------------------------------------------------
Minimize17 23 29
Constraint 15 6 9 >= 13
Constraint 212 19 26 >= 19
---------------------------------------------------------------------
Solution0 0 1.4444 41.8889

Iterations ----------

Iteration 1

Cj--> 17 23 29 0 0 0 0
BasicQuantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
artfcl 1 13 5 6 9 1 -1 0 0
artfcl 2 19 12 19 26 0 0 1 -1
Zj 32 -17 -25 -35 1 1 1 1
cj-zj 17 25 35 0 -1 0 -1

Iteration 2

Cj--> 17 23 29 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
artfcl 1 6.4231 0.8462 -0.5769 0 1 -1 -0.3462 0.3462
X3 0.7308 0.4615 0.7308 1 0 0 0.0385 -0.0385
Zj 6.4231 -.8462 .5769 0 1 1 2.3462 -.3462
cj-zj 0.8462 -0.5769 0 0 -1 -1.3462 0.3462

Iteration 3

Cj--> 17 23 29 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
--------------------------------------------------------------------------------------------------
artfcl 1 5.0833 0 -1.9167 -1.8333 1 -1 -0.4167 0.4167
X1 1.5833 1 1.5833 2.1667 0 0 0.0833 -0.0833
Zj 5.0833 0 1.9167 1.8333 1 1 2.4167 -.4167
cj-zj 0 -1.9167 -1.8333 0 -1 -1.4167 0.4167

Iteration 4

Cj--> 17 23 29 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
surplus 2 12.2 0 -4.6 -4.4 2.4 -2.4 -1 1
X1 2.6 1 1.2 1.8 0.2 -0.2 0 0
Zj 0 0 0 0 2 0 2 0
cj-zj 0 0 0 -1.0 0 -1.0 0

Iteration 5

Cj--> 17 23 29 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
surplus 2 12.2 0 -4.6 -4.4 2.4 -2.4 -1 1
X1 2.6 1 1.2 1.8 0.2 -0.2 0 0
Zj 44.2 17 25.6 27.4 -3.4 3.4 0 0
cj-zj 0 -2.6 1.6 3.4 -3.4 0 0

Iteration 6

Cj--> 17 23 29 0 0 0 0
Basic Quantity X1 X2 X3 artfcl 1 surplus 1 artfcl 2 surplus 2
---------------------------------------------------------------------------------------------------
surplus 2 18.5556 2.4444 -1.6667 0 2.8889 -2.8889 -1 1
X3 1.4444 0.5556 0.6667 1 0.1111 -0.1111 0 0
Zj 41.8889 17.8889 26.6667 29 -3.2222 3.2222 0 0
cj-zj -0.8889 -3.6667 0 3.2222 -3.2222 0 0

Dual ----------

y1 y2
---------------------------------------------------------
Maximize 13 19
X1 5 12 <= 17
X2 6 19 <= 23
X3 9 26 <= 29
Module/submodel: Transportation
Problem title: TP-!
Starting method: Any starting method
Objective: Minimize

Data and Results ----------

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 4 7 10
Source 2 5 9 20
DEMAND 12 18

Shipments

Destination Destination
1 2
------------------------------------
Source 1 10
Source 2 12 8

Total cost = 202

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 1
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 (1) 10
Source 2 12 8

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 (1) 10
Source 2 12 8

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 10/$70
Source 2 12/$60 8/$72

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 2 10 7 70
Source 2 Destination 1 12 5 60
Source 2 Destination 2 8 9 72
----------
Total shipping cost = 202
Module/submodel: Transportation
Problem title: TP-2
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 1 3 4
Source 2 2 6 6
DEMAND 5 5

Shipments

Destination Destination
1 2
------------------------------------
Source 1 4
Source 2 5 1

Total cost = 28

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 2
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 (2) 4
Source 2 5 1

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 4 (-2)
Source 2 1 5

Iteration 2
Destination Destination
1 2
------------------------------------
Source 1 (2) 4
Source 2 5 1

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 4/$12
Source 2 5/$10 1/$6
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 2 4 3 12
Source 2 Destination 1 5 2 10
Source 2 Destination 2 1 6 6
----------
Total shipping cost = 28
Module/submodel: Transportation
Problem title: TP-3
Starting method: Minimum Cost Method
Objective: Minimize

Data and Results ----------

Original Data
Destination Destination Destination
1 2 3 SUPPLY
--------------------------------------------------------------
Source 1 3 5 8 10
Source 2 6 4 7 12
Source 3 9 6 2 14
DEMAND 8 14 14

Shipments

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 8 2
Source 2 12
Source 3 0 14

Total cost = 110

Marginal Costs ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 7
Source 2 4 7
Source 3 5

Final Solution Table ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 8 2 (7)
Source 2 (4) 12 (7)
Source 3 (5) 0 14

Iterations ----------

Iteration 1
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 8 2 (7)
Source 2 (4) 12 (7)
Source 3 (5) (0) 14

Shipments with costs ----------

Destination 1 Destination 2 Destination 3

-------------------------------------------------------
Source 1 8/$24 2/$10
Source 2 12/$48
Source 3 0/$0 14/$28
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 8 3 24
Source 1 Destination 2 2 5 10
Source 2 Destination 2 12 4 48
Source 3 Destination 2 0 6 0
Source 3 Destination 3 14 2 28
----------
Total shipping cost = 110
Module/submodel: Transportation
Problem title: TP-4
Starting method: Vogel's Approximation Method
Objective: Minimize

Data and Results ----------

Original Data
Destination Destination Destination
1 2 3 SUPPLY
--------------------------------------------------------------
Source 1 2 4 8 12
Source 2 4 7 9 13
Source 3 5 10 11 14
DEMAND 13 16 10

Shipments

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 12
Source 2 4 9
Source 3 13 1

Total cost = 233

Marginal Costs ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 2 2
Source 2 1
Source 3 1

Final Solution Table ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 (2) 12 (2)
Source 2 (1) 4 9
Source 3 13 (1) 1

Iterations ----------

Iteration 1
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 (2) 12 (2)
Source 2 (1) 4 9
Source 3 13 (1) 1

Shipments with costs ----------

Destination 1 Destination 2 Destination 3

-------------------------------------------------------
Source 1 12/$48
Source 2 4/$28 9/$81
Source 3 13/$65 1/$11
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 2 12 4 48
Source 2 Destination 2 4 7 28
Source 2 Destination 3 9 9 81
Source 3 Destination 1 13 5 65
Source 3 Destination 3 1 11 11
----------
Total shipping cost = 233
Module/submodel: Transportation
Problem title: TP-5
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Original Data
Destination Destination Destination
1 2 3 SUPPLY
--------------------------------------------------------------
Source 1 10 11 12 18
Source 2 14 16 20 12
Source 3 15 9 17 10
DEMAND 15 16 9

Shipments

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 3 6 9
Source 2 12
Source 3 10

Total cost = 462

Marginal Costs ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1
Source 2 1 4
Source 3 7 7

Final Solution Table ----------

Destination Destination Destination

1 2 3
-------------------------------------------------
Source 1 3 6 9
Source 2 12 (1) (4)
Source 3 (7) 10 (7)

Iterations ----------

Iteration 1
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 15 3 (-7)
Source 2 (-1) 12 (-4)
Source 3 (7) 1 9

Iteration 2
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 15 (7) 3
Source 2 (-8) 12 (-4)
Source 3 (0) 4 6

Iteration 3
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 9 (-1) 9
Source 2 6 6 (4)
Source 3 (8) 10 (8)

Iteration 4
Destination Destination Destination
1 2 3
-------------------------------------------------
Source 1 3 6 9
Source 2 12 (1) (4)
Source 3 (7) 10 (7)

Shipments with costs ----------

Destination 1 Destination 2 Destination 3

-------------------------------------------------------
Source 1 3/$30 6/$66 9/$108
Source 2 12/$168
Source 3 10/$90

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 3 10 30
Source 1 Destination 2 6 11 66
Source 1 Destination 3 9 12 108
Source 2 Destination 1 12 14 168
Source 3 Destination 2 10 9 90
----------
Total shipping cost = 462
Module/submodel: Transportation
Problem title: TP-6
Starting method: Any starting method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination Destination Destination Destination
1 2 3 4 5 SUPPLY
----------------------------------------------------------------------------------------
Source 1 3 5 7 9 11 11
Source 2 5 12 19 23 27 15
Source 3 4 8 12 16 22 19
Source 4 9 13 15 12 8 25
Source 5 7 16 18 21 15 32
DEMAND 16 12 20 24 30

Shipments

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 11
Source 2 13 2
Source 3 10 9
Source 4 24 1
Source 5 3 29

Total cost = 1106

Marginal Costs ----------

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 7 2 1 7
Source 2 3 6 14
Source 3 3 3 13
Source 4 9 6 4
Source 5 2 0 2

Final Solution Table ----------

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (7) (2) 11 (1) (7)
Source 2 13 2 (3) (6) (14)
Source 3 (3) 10 9 (3) (13)
Source 4 (9) (6) (4) 24 1
Source 5 3 (2) (0) (2) 29

Iterations ----------

Iteration 1
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (6) (5) 11 (-2) (6)
Source 2 (-4) 12 (0) 3 (10)
Source 3 (2) (3) 9 10 (12)
Source 4 (9) (10) (5) (-2) 25
Source 5 16 (6) (1) 11 5

Iteration 2
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (6) (1) 11 (-2) (6)
Source 2 3 12 (4) (4) (14)
Source 3 (2) (-1) 9 10 (12)
Source 4 (9) (6) (5) (-2) 25
Source 5 13 (2) (1) 14 5

Iteration 3
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (8) (3) 1 10 (8)
Source 2 3 12 (2) (4) (14)
Source 3 (4) (1) 19 (2) (14)
Source 4 (9) (6) (3) (-2) 25
Source 5 13 (2) (-1) 14 5

Iteration 4
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (6) (1) 1 10 (6)
Source 2 3 12 (4) (6) (14)
Source 3 (2) (-1) 19 (2) (12)
Source 4 (9) (6) (5) 14 11
Source 5 13 (2) (1) (2) 19

Iteration 5
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (7) (2) 11 (1) (7)
Source 2 13 2 (3) (6) (14)
Source 3 (3) 10 9 (3) (13)
Source 4 (9) (6) (4) 24 1
Source 5 3 (2) (0) (2) 29

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4 Destination 5

-------------------------------------------------------------------------------------
Source 1 11/$77
Source 2 13/$65 2/$24
Source 3 10/$80 9/$108
Source 4 24/$288 1/$8
Source 5 3/$21 29/$435

Shipping list ----------

From To Total shipping Units $/Unit 11

Source 1 Destination 3 cost = 7 13 5
Source 2 Destination 1 2 12 10
Source 2 Destination 2 89 12 24
Source 3 Destination 2 12 1 8 3
Source 3 Destination 3 7 29 15
Source 4 Destination 4
Source 4 Destination 5
Source 5 Destination 1
Source 5 Destination 5
Total Cost
77
65
24
80
108
288 8
21
435
----------
1106
M
o
d
u
l
e
/
s
u
b
m
o
d
e
l
:

T
r
a
n
s
p
o
r
t
a
t
i
o
n

P
r
o
b
01-31-2014 21:03:25

Module/submodel: Transportation
Problem title: TP-6
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Shipments

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 11
Source 2 13 2
Source 3 10 9
Source 4 24 1
Source 5 3 29

Total cost = 1106

Marginal Costs ----------

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 7 2 1 7
Source 2 3 6 14
Source 3 3 3 13
Source 4 9 6 4
Source 5 2 0 2

Final Solution Table ----------

Destination Destination Destination Destination Destination

Iterations ----------

Iteration 1
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 11 (-5) (-7) (-2) (6)
Source 2 5 10 (3) (10) (20)
Source 3 (3) 2 17 (7) (19)
Source 4 (5) (2) 3 22 (2)
Source 5 (-6) (-4) (-6) 2 30

Iteration 2
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 1 (2) 10 (5) (13)
Source 2 15 (7) (10) (17) (27)
Source 3 (-4) 12 7 (7) (19)
Source 4 (-2) (2) 3 22 (2)
Source 5 (-13) (-4) (-6) 2 30

Iteration 3
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (13) (2) 11 (5) (13)
Source 2 15 (-6) (-3) (4) (14)
Source 3 (9) 12 7 (7) (19)
Source 4 (11) (2) 2 23 (2)
Source 5 1 (-4) (-6) 1 30

Iteration 4
Destination Destination Destination Destination Destination
1 2 3 4 5
---------------------------------------------------------------------------
Source 1 (7) (2) 11 (5) (7)
Source 2 14 1 (3) (10) (14)
Source 3 (3) 11 8 (7) (13)
Source 4 (5) (2) 1 24 (-4)
Source 5 2 (2) (0) (6) 30

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4 Destination 5

-------------------------------------------------------------------------------------
Source 1 11/$77
Source 2 13/$65 2/$24
Source 3 10/$80 9/$108
Source 4 24/$288 1/$8
Source 5 3/$21 29/$435

Shipping list ----------

From To Total shipping Units $/Unit 11

Module/submodel: Transportation
Problem title: TP-6
Starting method: Vogel's Approximation Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Shipments

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 11
Source 2 13 2
Source 3 10 9
Source 4 24 1
Source 5 3 29

Total cost = 1106

Marginal Costs ----------

Destination Destination Destination Destination Destination

1 2 3 4 5
---------------------------------------------------------------------------
Source 1 7 2 1 7
Source 2 3 6 14
Source 3 3 3 13
Source 4 9 6 4
Source 5 2 0 2

Final Solution Table ----------

Destination Destination Destination Destination Destination

Iterations ----------

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4 Destination 5

-------------------------------------------------------------------------------------
Source 1 11/$77
Source 2 13/$65 2/$24
Source 3 10/$80 9/$108
Source 4 24/$288 1/$8
Source 5 3/$21 29/$435

Shipping list ----------

From To Total shipping Units $/Unit 11

Module/submodel: Transportation
Problem title: TP-7-AnyStartingmethod-4*4
Starting method: Any starting method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination Destination Destination
1 2 3 4 SUPPLY
---------------------------------------------------------------------------
Source 1 1 3 4 7 15
Source 2 4 6 3 9 10
Source 3 9 7 2 0 20
Source 4 12 11 8 13 25
DEMAND 13 12 22 23

Shipments

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2
Source 2 10 0
Source 3 20
Source 4 22 3

Total cost = 294

Marginal Costs ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 4 2
Source 2 0 1
Source 3 13 9 7
Source 4 3 0

Final Solution Table ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 0 (1)
Source 3 (13) (9) (7) 20
Source 4 (3) (0) 22 3

Iterations ----------

Iteration 1
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (3) (1)
Source 2 (0) 10 (-1) (0)
Source 3 (14) (10) (7) 20
Source 4 (4) (1) 22 3
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 (0) (1)
Source 3 (13) (9) (7) 20
Source 4 (3) (0) 22 3

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4

----------------------------------------------------------------------
Source 1 13/$13 2/$6
Source 2 10/$60 0/$0
Source 3 20/$0
Source 4 22/$176 3/$39

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 13 1 13
Source 1 Destination 2 2 3 6
Source 2 Destination 2 10 6 60
Source 2 Destination 3 0 3 0
Source 3 Destination 4 20 0 0
Source 4 Destination 3 22 8 176
Source 4 Destination 4 3 13 39
----------
Total shipping cost = 294
01-31-2014 21:33:43

Module/submodel: Transportation
Problem title: TP-7-AnyStartingmethod-4*4
Starting method: Minimum Cost Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Shipments

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2
Source 2 10
Source 3 20
Source 4 10 12 3

Total cost = 294

Marginal Costs ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 4 2
Source 2 0 0 1
Source 3 13 9 7
Source 4 3

Final Solution Table ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) (0) 10 (1)
Source 3 (13) (9) (7) 20
Source 4 (3) 10 12 3

Iterations ----------

Iteration 1
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) (0) 10 (1)
Source 3 (13) (9) (7) 20
Source 4 (3) 10 12 3

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4
----------------------------------------------------------------------
Source 1 13/$13 2/$6
Source 2 10/$30
Source 3 20/$0
Source 4 10/$110 12/$96 3/$39

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 13 1 13
Source 1 Destination 2 2 3 6
Source 2 Destination 3 10 3 30
Source 3 Destination 4 20 0 0
Source 4 Destination 2 10 11 110
Source 4 Destination 3 12 8 96
Source 4 Destination 4 3 13 39
----------
Total shipping cost = 294
01-31-2014 21:27:14

Module/submodel: Transportation
Problem title: TP-7-AnyStartingmethod-4*4
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Shipments

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2
Source 2 10
Source 3 20
Source 4 0 22 3

Total cost = 294

Marginal Costs ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 4 2
Source 2 0 0 1
Source 3 13 9 7
Source 4 3

Final Solution Table ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 (0) (1)
Source 3 (13) (9) (7) 20
Source 4 (3) 0 22 3

Iterations ----------

Iteration 1
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (6) (4)
Source 2 (0) 10 (2) (3)
Source 3 (4) (0) 20 (-7)
Source 4 (1) (-2) 2 23

Iteration 2
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (13) (11)
Source 2 (0) 10 (9) (10)
Source 3 (4) (0) (7) 20
Source 4 (-6) (-9) 22 3

Iteration 3
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 (0) (1)
Source 3 (13) (9) (7) 20
Source 4 (3) (0) 22 3

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4

----------------------------------------------------------------------
Source 1 13/$13 2/$6
Source 2 10/$60
Source 3 20/$0
Source 4 0/$0 22/$176 3/$39

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 13 1 13
Source 1 Destination 2 2 3 6
Source 2 Destination 2 10 6 60
Source 3 Destination 4 20 0 0
Source 4 Destination 2 0 11 0
Source 4 Destination 3 22 8 176
Source 4 Destination 4 3 13 39
----------
Total shipping cost = 294
01-31-2014 21:35:08

Module/submodel: Transportation
Problem title: TP-7-AnyStartingmethod-4*4
Starting method: Vogel's Approximation Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Shipments

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2
Source 2 10 0
Source 3 20
Source 4 22 3

Total cost = 294

Marginal Costs ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 4 2
Source 2 0 1
Source 3 13 9 7
Source 4 3 0

Final Solution Table ----------

Destination Destination Destination Destination

1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 0 (1)
Source 3 (13) (9) (7) 20
Source 4 (3) (0) 22 3

Iterations ----------

Iteration 2
Destination Destination Destination Destination
1 2 3 4
--------------------------------------------------------------
Source 1 13 2 (4) (2)
Source 2 (0) 10 (0) (1)
Source 3 (13) (9) (7) 20
Source 4 (3) (0) 22 3

Shipments with costs ----------

Destination 1 Destination 2 Destination 3 Destination 4

----------------------------------------------------------------------
Source 1 13/$13 2/$6
Source 2 10/$60 0/$0
Source 3 20/$0
Source 4 22/$176 3/$39

Shipping list ----------

From To Units $/Unit Total Cost

Module/submodel: Transportation
Problem title: TP-8-2by2-AnyStartingmethod
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 20 35
Source 2 40 50 55
Dummy 65 75

Shipments

Destination Destination
1 2
------------------------------------
Source 1 35
Source 2 30 25
Dummy 50

Total cost = 2800

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2
Dummy 10

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 35/$350
Source 2 30/$1200 25/$1250
Dummy 50/$3750
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 35 10 350
Source 2 Destination 1 30 40 1200
Source 2 Destination 2 25 50 1250
Dummy Destination 2 50 0 0
----------
Total shipping cost = 2800
01-31-2014 21:44:03

Module/submodel: Transportation
Problem title: TP-8-2by2-AnyStartingmethod
Starting method: Any starting method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 20 35
Source 2 40 50 55
Dummy 65 75

Shipments

Destination Destination
1 2
------------------------------------
Source 1 35
Source 2 30 25
Dummy 50

Total cost = 2800

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2
Dummy 10

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 35/$350
Source 2 30/$1200 25/$1250
Dummy 50/$3750
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 35 10 350
Source 2 Destination 1 30 40 1200
Source 2 Destination 2 25 50 1250
Dummy Destination 2 50 0 0
----------
Total shipping cost = 2800
01-31-2014 21:53:14

Module/submodel: Transportation
Problem title: TP-8-2by2-AnyStartingmethod
Starting method: Minimum Cost Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 20 35
Source 2 40 50 55
Dummy 65 75

Shipments

Destination Destination
1 2
------------------------------------
Source 1 35
Source 2 30 25
Dummy 50

Total cost = 2800

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2
Dummy 10

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 15 20
Source 2 (0) 55
Dummy 50 (-10)

Iteration 2
Destination Destination
1 2
------------------------------------
Source 1 35 (10)
Source 2 (-10) 55
Dummy 30 20

Iteration 3
Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 35/$350
Source 2 30/$1200 25/$1250
Dummy 50/$3750

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 35 10 350
Source 2 Destination 1 30 40 1200
Source 2 Destination 2 25 50 1250
Dummy Destination 2 50 0 0
----------
Total shipping cost = 2800
01-31-2014 21:55:03

Module/submodel: Transportation
Problem title: TP-8-2by2-AnyStartingmethod
Starting method: Vogel's Approximation Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 20 35
Source 2 40 50 55
Dummy 65 75

Shipments

Destination Destination
1 2
------------------------------------
Source 1 35
Source 2 30 25
Dummy 50

Total cost = 2800

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2
Dummy 10

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 35 (0)
Source 2 30 25
Dummy (10) 50

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 35/$350
Source 2 30/$1200 25/$1250
Dummy 50/$3750
Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 35 10 350
Source 2 Destination 1 30 40 1200
Source 2 Destination 2 25 50 1250
Dummy Destination 2 50 0 0
----------
Total shipping cost = 2800
01-31-2014 22:06:20

Module/submodel: Transportation
Problem title: TP-balanced-2by2-Anystartingmethod
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 11 100
Source 2 20 21 200
DEMAND 150 150

Shipments

Destination Destination
1 2
------------------------------------
Source 1 100
Source 2 50 150

Total cost = 5150

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 100/$1000
Source 2 50/$1000 150/$3150

Shipping list ----------

From To Units $/Unit Total Cost
Source 1 Destination 1 100 10 1000
Source 2 Destination 1 50 20 1000
Source 2 Destination 2 150 21 3150
----------
Total shipping cost = 5150
01-31-2014 22:09:20

Module/submodel: Transportation
Problem title: TP-balanced-2by2-Anystartingmethod
Starting method: Vogel's Approximation Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 11 100
Source 2 20 21 200
DEMAND 150 150

Shipments

Destination Destination
1 2
------------------------------------
Source 1 100
Source 2 50 150

Total cost = 5150

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 100/$1000
Source 2 50/$1000 150/$3150

Shipping list ----------

From To Units $/Unit Total Cost
Source 1 Destination 1 100 10 1000
Source 2 Destination 1 50 20 1000
Source 2 Destination 2 150 21 3150
----------
Total shipping cost = 5150
01-31-2014 22:01:48

Module/submodel: Transportation
Problem title: TP-balanced-2by2-Anystartingmethod
Starting method: Any starting method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 11 100
Source 2 20 21 200
DEMAND 150 150

Shipments

Destination Destination
1 2
------------------------------------
Source 1 100
Source 2 50 150

Total cost = 5150

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 100/$1000
Source 2 50/$1000 150/$3150

Shipping list ----------

From To Units $/Unit Total Cost
Source 1 Destination 1 100 10 1000
Source 2 Destination 1 50 20 1000
Source 2 Destination 2 150 21 3150
----------
Total shipping cost = 5150
01-31-2014 22:07:55

Module/submodel: Transportation
Problem title: TP-balanced-2by2-Anystartingmethod
Starting method: Minimum Cost Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 10 11 100
Source 2 20 21 200
DEMAND 150 150

Shipments

Destination Destination
1 2
------------------------------------
Source 1 100
Source 2 50 150

Total cost = 5150

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 0
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 100 (0)
Source 2 50 150

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 100/$1000
Source 2 50/$1000 150/$3150

Shipping list ----------

From To Units $/Unit Total Cost
Source 1 Destination 1 100 10 1000
Source 2 Destination 1 50 20 1000
Source 2 Destination 2 150 21 3150
----------
Total shipping cost = 5150
3000
55350
----------
77350
01-31-2014 22:41:35

Module/submodel: Transportation
Problem title: TP-balanced-Max-2by2
Starting method: Any starting method
Objective: Maximize

Data and Results ----------

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 95 105 200
Source 2 100 205 300
DEMAND 230 270

Shipments

Destination Destination
1 2
------------------------------------
Source 1 200
Source 2 30 270

Total profit = 77350

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 -95
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 200 (-95)
Source 2 30 270

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 200 (95)
Source 2 30 270

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 200/$19000
Source 2 30/$3000 270/$55350

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 200 95 19000
Source 2 Destination 1 30 100 3000
Source 2 Destination 2 270 205 55350
----------
Total shipping cost = 77350
01-31-2014 22:43:44

Module/submodel: Transportation
Problem title: TP-balanced-Max-2by2
Starting method: Northwest Corner Method
Objective: Maximize

Data and Results ----------

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 95 105 200
Source 2 100 205 300
DEMAND 230 270

Shipments

Destination Destination
1 2
------------------------------------
Source 1 200
Source 2 30 270

Total profit = 77350

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 -95
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 200 (-95)
Source 2 30 270

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 200 (95)
Source 2 30 270

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 200/$19000
Source 2 30/$3000 270/$55350

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 200 95 19000
Source 2 Destination 1 30 100 3000
Source 2 Destination 2 270 205 55350
----------
Total shipping cost = 77350
01-31-2014 22:44:46

Module/submodel: Transportation
Problem title: TP-balanced-Max-2by2
Starting method: Minimum Cost Method
Objective: Maximize

Data and Results ----------

Original Data
Destination Destination
1 2 SUPPLY
-------------------------------------------------
Source 1 95 105 200
Source 2 100 205 300
DEMAND 230 270

Shipments

Destination Destination
1 2
------------------------------------
Source 1 200
Source 2 30 270

Total profit = 77350

Marginal Costs ----------

Destination Destination
1 2
------------------------------------
Source 1 -95
Source 2

Final Solution Table ----------

Destination Destination
1 2
------------------------------------
Source 1 200 (-95)
Source 2 30 270

Iterations ----------

Iteration 1
Destination Destination
1 2
------------------------------------
Source 1 200 (95)
Source 2 30 270

Shipments with costs ----------

Destination 1 Destination 2
----------------------------------------
Source 1 200/$19000
Source 2 30/$3000 270/$55350

Shipping list ----------

From To Units $/Unit Total Cost

Source 1 Destination 1 200 95 19000
Source 2 Destination 1 30 100 3000
Source 2 Destination 2 270 205 55350
----------
Total shipping cost = 77350
02-01-2014 06:59:27

Module/submodel: Transportation
Problem title: TP-NWCornerRule
Starting method: Northwest Corner Method
Objective: Minimize

Data and Results ----------

Multiple optimal solutions exist

Original Data
Warehouse Warehouse Warehouse
X Y Z Fact-cap
--------------------------------------------------------------------
Factory A 3 9 13 14
Factory B 5 8 12 16
Factory C 6 12 19 19
Warehouse requirements 10 17 12

Shipments

Warehouse Warehouse Warehouse

X Y Z Dummy
-------------------------------------------------------
Factory A 1 13
Factory B 4 12
Factory C 9 10

Total cost = 350

Marginal Costs ----------

Warehouse Warehouse Warehouse

X Y Z Dummy
-------------------------------------------------------
Factory A 0 3
Factory B 3 4
Factory C 0 3

Final Solution Table ----------

Warehouse Warehouse Warehouse

X Y Z Dummy
-------------------------------------------------------
Factory A 1 13 (0) (3)
Factory B (3) 4 12 (4)
Factory C 9 (0) (3) 10

Iterations ----------

Iteration 1
Warehouse Warehouse Warehouse
X Y Z Dummy
-------------------------------------------------------
Factory A 10 4 (0) (6)
Factory B (3) 13 3 (7)
Factory C (-3) (-3) 9 10

Iteration 2
Warehouse Warehouse Warehouse
X Y Z Dummy
-------------------------------------------------------
Factory A 1 13 (0) (3)
Factory B (3) 4 12 (4)
Factory C 9 (0) (3) 10
Shipments with costs ----------

Warehouse X Warehouse Y Warehouse Z Dummy

-----------------------------------------------------------------------
Factory A 1/$3 13/$117
Factory B 4/$32 12/$144
Factory C 9/$54 10/$190

Shipping list ----------

From To Units $/Unit Total Cost

Factory A Warehouse X 1 3 3
Factory A Warehouse Y 13 9 117
Factory B Warehouse Y 4 8 32
Factory B Warehouse Z 12 12 144
Factory C Warehouse X 9 6 54
Factory C Dummy 10 0 0
----------
Total shipping cost = 350
AP-ALLFILES
ASSIGNMENT PROBLEM:

PROBLEM 1:

Number of tasks: 6

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D E F | Row Min
__________|___________________________________________|________
0 | 110 100 210 314 270 318 | 100
0 | 200 100 50 150 212 312 | 50
0 | 100 70 80 99 110 210 | 70
0 | 315 416 520 600 710 500 | 315
5 | 210 516 810 800 780 77 | 77
6 | 99 77 66 55 88 44 | 44
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
0 | 10 0 110 214 170 218 |
0 | 150 50 0 100 162 262 |
0 | 30 0 10 29 40 140 |
0 | 0 101 205 285 395 185 |
5 | 133 439 733 723 703 0 |
6 | 55 33 22 11 44 0 |
Col Min | 0 0 0 11 40 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
0 | 10 0 110 203 130 218 |
0 | 150 50 0 89 122 262 |
0 | 30 0 10 18 0 140 |
0 | 0 101 205 274 355 185 |
5 | 133 439 733 712 663 0 |
Page 1
AP-ALLFILES
6 | 55 33 22 0 4 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
| | | | | | | |
0 | 10 0 110 203 130 218 |
| | | | | | | |_

0 | 150 50 0 89 122 262 |

| | | | | | | |
0 | 30 0 10 18 0 140 |
| | | | | | | |
0 | 0 101 205 274 355 185 |
| | | | | | | |
5 | 133 439 733 712 663 0 |
| | | | | | | |
6 | 55 33 22 0 4 0 |
| | | | | | | |

Make the assignments.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
0 | 10 [0] 110 203 130 218 |
0 | 150 50 [0] 89 122 262 |
0 | 30 0 10 18 [0] 140 |
0 | [0] 101 205 274 355 185 |
5 | 133 439 733 712 663 [0] |
6 | 55 33 22 [0] 4 0 |

Task B is assigned to Assignee 1

Task C is assigned to Assignee 2
Task E is assigned to Assignee 3
Task A is assigned to Assignee 4
Task F is assigned to Assignee 5
Task D is assigned to Assignee 6

PROBLEM 2:

Number of tasks: 5
Page 2
AP-ALLFILES

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D E | Row Min
__________|____________________________________|________
1 | 18 18 18 18 18 | 18
2 | 18 18 18 18 18 | 18
3 | 18 18 18 18 18 | 18
4 | 18 18 18 18 18 | 18
5 | 18 18 18 18 18 | 18
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | 0 0 0 0 0 |
2 | 0 0 0 0 0 |
3 | 0 0 0 0 0 |
4 | 0 0 0 0 0 |
5 | 0 0 0 0 0 |
Col Min | 0 0 0 0 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | 0 0 0 0 0 |
2 | 0 0 0 0 0 |
3 | 0 0 0 0 0 |
4 | 0 0 0 0 0 |
5 | 0 0 0 0 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E |
Page 3
AP-ALLFILES
__________|____________________________________|________
| | | | | | |
1 | 0 0 0 0 0 |
| | | | | | |
2 | 0 0 0 0 0 |
| | | | | | |
3 | 0 0 0 0 0 |_

| | | | | | |
4 | 0 0 0 0 0 |
| | | | | | |
5 | 0 0 0 0 0 |
| | | | | | |

Make the assignments.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | [0] 0 0 0 0 |
2 | 0 [0] 0 0 0 |
3 | 0 0 [0] 0 0 |
4 | 0 0 0 [0] 0 |
5 | 0 0 0 0 [0] |

Task A is assigned to Assignee 1

Task B is assigned to Assignee 2
Task C is assigned to Assignee 3
Task D is assigned to Assignee 4
Task E is assigned to Assignee 5

PROBLEM 3:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
1 | 100 134 157 | 100
2 | 231 314 451 | 231
3 | 565 671 781 | 565
| |
Page 4
AP-ALLFILES

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 34 57 |
2 | 0 83 220 |
3 | 0 106 216 |
Col Min | 0 34 57 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 0 0 |
2 | 0 49 163 |
3 | 0 72 159 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | |
1 |-0------0------0------|
| | |
2 | 0 49 163 |
| | |
3 | 0 72 159 |
| | |

Step :
Select the smallest number from all the uncovered numbers

Task_

Assignee| A B C |
__________|______________________|________
1 | 0 0 0 |
Page 5
AP-ALLFILES
2 | 0 [49] 163 |
3 | 0 72 159 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C |
__________|______________________|________
1 | 49 0 0 |
2 | 0 0 114 |
3 | 0 23 110 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | | | |
1 | 49 0 0 |
| | | | |
2 | 0 0 114 |
| | | | |
3 | 0 23 110 |
| | | | |

Make the assignments.

Task
Assignee| A B C |
__________|______________________|________
1 | 49 0 [0] |
2 | 0 [0] 114 |
3 | [0] 23 110 |

Task C is assigned to Assignee 1

Task B is assigned to Assignee 2
Task A is assigned to Assignee 3

PROBLEM 4:

ASSIGNMENT PROBLEM
Page 6
AP-ALLFILES
******************

OBJECTIVE: MINIMIZATION

SUMMARY OF UNIT COST OR REVENUE DATA

************************************

TASK
AGENT 1 2 3
------ ------ ------ ------
1 10 20 34
2 21 23 24
3 31 34 43

OPTIMAL ASSIGNMENTS COST/REVENUE

******************* ************

ASSIGN AGENT 1 TO TASK 1 10

ASSIGN AGENT 3 TO TASK 2 34

ASSIGN AGENT 2 TO TASK 3 24

----------
TOTAL COST/REVENUE 68

PROBLEM 5:

Number of tasks: 4

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D | Row Min
__________|_____________________________|________
1 | 5 9 13 24 | 5
2 | 10 20 30 40 | 10
3 | 15 18 25 27 | 15
4 | 20 28 35 30 | 20
Page 7
AP-ALLFILES
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 4 8 19 |
2 | 0 10 20 30 |
3 | 0 3 10 12 |
4 | 0 8 15 10 |
Col Min | 0 3 8 10 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 1 0 9 |
2 | 0 7 12 20 |
3 | 0 0 2 2 |
4 | 0 5 7 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | | | | |
1 | 0 1 0 9 |
| | | | | |
2 | 0 7 12 20 |
| | | | | |
3 | 0 0 2 2 |
| | | | | |
4 | 0 5 7 0 |
| | | | | |_

Make the assignments.

Page 8
AP-ALLFILES
Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 1 [0] 9 |
2 | [0] 7 12 20 |
3 | 0 [0] 2 2 |
4 | 0 5 7 [0] |

Task C is assigned to Assignee 1

Task A is assigned to Assignee 2
Task B is assigned to Assignee 3
Task D is assigned to Assignee 4

PROBLEM 6:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
1 | 2 2 2 | 2
2 | 2 2 2 | 2
3 | 2 2 2 | 2
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 0 0 |
2 | 0 0 0 |
3 | 0 0 0 |
Col Min | 0 0 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
Page 9
AP-ALLFILES
__________|______________________|________
1 | 0 0 0 |
2 | 0 0 0 |
3 | 0 0 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | | | |
1 | 0 0 0 |
| | | | |
2 | 0 0 0 |
| | | | |
3 | 0 0 0 |
| | | | |

Make the assignments.

Task
Assignee| A B C |_

__________|______________________|________
1 | [0] 0 0 |
2 | 0 [0] 0 |
3 | 0 0 [0] |

Task A is assigned to Assignee 1

Task B is assigned to Assignee 2
Task C is assigned to Assignee 3

PROBLEM 7:

Number of tasks: 6

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D E F | Row Min
__________|___________________________________________|________
0 | 100 0 0 0 0 100 | 0
Page 10
AP-ALLFILES
0 | 0 100 0 0 100 0 | 0
0 | 0 0 100 100 0 0 | 0
0 | 0 0 100 100 0 0 | 0
5 | 0 100 0 0 100 0 | 0
6 | 100 0 0 0 0 100 | 0
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
0 | 100 0 0 0 0 100 |
0 | 0 100 0 0 100 0 |
0 | 0 0 100 100 0 0 |
0 | 0 0 100 100 0 0 |
5 | 0 100 0 0 100 0 |
6 | 100 0 0 0 0 100 |
Col Min | 0 0 0 0 0 0 |

Step :
Enter the results in a new table.

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
| | | | | | | |
0 | 100 0 0 0 0 100 |
| | | | | | | |_

Page 11
AP-ALLFILES
0 | 0 100 0 0 100 0 |
| | | | | | | |
0 | 0 0 100 100 0 0 |
| | | | | | | |
0 | 0 0 100 100 0 0 |
| | | | | | | |
5 | 0 100 0 0 100 0 |
| | | | | | | |
6 | 100 0 0 0 0 100 |
| | | | | | | |

Make the assignments.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
0 | 100 [0] 0 0 0 100 |
0 | [0] 100 0 0 100 0 |
0 | 0 0 100 100 [0] 0 |
0 | 0 0 100 100 0 [0] |
5 | 0 100 [0] 0 100 0 |
6 | 100 0 0 [0] 0 100 |

Task B is assigned to Assignee 1

Task A is assigned to Assignee 2
Task E is assigned to Assignee 3
Task F is assigned to Assignee 4
Task C is assigned to Assignee 5
Task D is assigned to Assignee 6

PROBLEM 8:

Number of tasks: 6

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D E F | Row Min
__________|___________________________________________|________
1 | 18 3 3 3 3 0 | 0
2 | 3 9 3 1 3 3 | 1
3 | 3 3 6 3 3 3 | 3
4 | 3 3 6 3 3 3 | 3
5 | 3 9 3 3 3 3 | 3
6 | 18 3 3 3 3 0 | 0
Page 12
AP-ALLFILES
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 18 3 3 3 3 0 |
2 | 2 8 2 0 2 2 |
3 | 0 0 3 0 0 0 |
4 | 0 0 3 0 0 0 |
5 | 0 6 0 0 0 0 |
6 | 18 3 3 3 3 0 |
Col Min | 0 0 0 0 0 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 18 3 3 3 3 0 |
2 | 2 8 2 0 2 2 |
3 | 0 0 3 0 0 0 |
4 | 0 0 3 0 0 0 |
5 | 0 6 0 0 0 0 |
6 | 18 3 3 3 3 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
| | | |
1 | 18 3 3 3 3 0 |
| | | |_

2 | 2 8 2 0 2 2 |
| | | |
3 |-0------0------3------0------0------0------|
| | | |
4 |-0------0------3------0------0------0------|
Page 13
AP-ALLFILES
| | | |
5 |-0------6------0------0------0------0------|
| | | |
6 | 18 3 3 3 3 0 |
| | | |

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 18 3 3 3 3 0 |
2 | [2] 8 2 0 2 2 |
3 | 0 0 3 0 0 0 |
4 | 0 0 3 0 0 0 |
5 | 0 6 0 0 0 0 |
6 | 18 3 3 3 3 0 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 16 1 1 3 1 0 |
2 | 0 6 0 0 0 2 |
3 | 0 0 3 2 0 2 |
4 | 0 0 3 2 0 2 |
5 | 0 6 0 2 0 2 |
6 | 16 1 1 3 1 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
| | |
1 | 16 1 1 3 1 0 |
| | |
2 |-0------6------0------0------0------2------|
| | |
Page 14
AP-ALLFILES
3 |-0------0------3------2------0------2------|
| | |
4 |-0------0------3------2------0------2------|
| | |
5 |-0------6------0------2------0------2------|_

| | |
6 | 16 1 1 3 1 0 |
| | |

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 16 [1] 1 3 1 0 |
2 | 0 6 0 0 0 2 |
3 | 0 0 3 2 0 2 |
4 | 0 0 3 2 0 2 |
5 | 0 6 0 2 0 2 |
6 | 16 1 1 3 1 0 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
1 | 15 0 0 2 0 0 |
2 | 0 6 0 0 0 3 |
3 | 0 0 3 2 0 3 |
4 | 0 0 3 2 0 3 |
5 | 0 6 0 2 0 3 |
6 | 15 0 0 2 0 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E F |
__________|___________________________________________|________
Page 15
AP-ALLFILES
| | | | | | | |
1 | 15 0 0 2 0 0 |
| | | | | | | |
2 | 0 6 0 0 0 3 |
| | | | | | | |
3 | 0 0 3 2 0 3 |
| | | | | | | |
4 | 0 0 3 2 0 3 |
| | | | | | | |
5 | 0 6 0 2 0 3 |
| | | | | | | |
6 | 15 0 0 2 0 0 |
| | | | | | | |

Make the assignments.

Task

Assignee| A B C D E F |
__________|___________________________________________|________
1 | 15 [0] 0 2 0 0 |
2 | 0 6 0 [0] 0 3 |
3 | [0] 0 3 2 0 3 |
4 | 0 0 3 2 [0] 3 |
5 | 0 6 [0] 2 0 3 |
6 | 15 0 0 2 0 [0] |

Task B is assigned to Assignee 1

Task D is assigned to Assignee 2
Task A is assigned to Assignee 3
Task E is assigned to Assignee 4
Task C is assigned to Assignee 5
Task F is assigned to Assignee 6

PROBLEM 9:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
1 | 90 100 110 | 90
Page 16
AP-ALLFILES
2 | 112 213 314 | 112
3 | 345 245 456 | 245
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 10 20 |
2 | 0 101 202 |
3 | 100 0 211 |
Col Min | 0 0 20 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 10 0 |
2 | 0 101 182 |
3 | 100 0 191 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | | | |
1 | 0 10 0 |
| | | | |
2 | 0 101 182 |
| | | | |
3 | 100 0 191 |
| | | | |

Make the assignments.

Task
Assignee| A B C |_

Page 17
AP-ALLFILES
__________|______________________|________
1 | 0 10 [0] |
2 | [0] 101 182 |
3 | 100 [0] 191 |

Task C is assigned to Assignee 1

Task A is assigned to Assignee 2
Task B is assigned to Assignee 3

PROBLEM 10:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
1 | 10 23 56 | 10
2 | 90 100 110 | 90
3 | 56 101 80 | 56
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 13 46 |
2 | 0 10 20 |
3 | 0 45 24 |
Col Min | 0 10 20 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 3 26 |
2 | 0 0 0 |
3 | 0 35 4 |
Page 18
AP-ALLFILES
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | |
1 | 0 3 26 |
| | |
2 |-0------0------0------|
| | |
3 | 0 35 4 |
| | |

Step :
Select the smallest number from all the uncovered numbers

Task_

Assignee| A B C |
__________|______________________|________
1 | 0 [3] 26 |
2 | 0 0 0 |
3 | 0 35 4 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 0 23 |
2 | 3 0 0 |
3 | 0 32 1 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
Page 19
AP-ALLFILES
__________|______________________|________
| | | | |
1 | 0 0 23 |
| | | | |
2 | 3 0 0 |
| | | | |
3 | 0 32 1 |
| | | | |

Make the assignments.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 [0] 23 |
2 | 3 0 [0] |
3 | [0] 32 1 |

Task B is assigned to Assignee 1

Task C is assigned to Assignee 2
Task A is assigned to Assignee 3

PROBLEM 11:

Number of tasks: 4

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D | Row Min
__________|_____________________________|________
1 | 120 124 240 350 | 120
2 | 245 614 220 100 | 100
3 | 230 410 710 565 | 230
4 | 465 610 900 800 | 465
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 4 120 230 |
Page 20
AP-ALLFILES
2 | 145 514 120 0 |
3 | 0 180 480 335 |
4 | 0 145 435 335 |
Col Min | 0 4 120 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 0 0 230 |
2 | 145 510 0 0 |
3 | 0 176 360 335 |
4 | 0 141 315 335 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | |
1 |-0------0------0------230------|
| | |
2 |-145------510------0------0------|
| | |
3 | 0 176 360 335 |
| | |
4 | 0 141 315 335 |
| | |_

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 0 0 230 |
2 | 145 510 0 0 |
3 | 0 176 360 335 |
4 | 0 [141] 315 335 |
| |

Page 21
AP-ALLFILES
Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 141 0 0 230 |
2 | 286 510 0 0 |
3 | 0 35 219 194 |
4 | 0 0 174 194 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | | | | |
1 | 141 0 0 230 |
| | | | | |
2 | 286 510 0 0 |
| | | | | |
3 | 0 35 219 194 |
| | | | | |
4 | 0 0 174 194 |
| | | | | |

Make the assignments.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 141 0 [0] 230 |
2 | 286 510 0 [0] |
3 | [0] 35 219 194 |
4 | 0 [0] 174 194 |

Task C is assigned to Assignee 1

Task D is assigned to Assignee 2
Task A is assigned to Assignee 3
Task B is assigned to Assignee 4_

Page 22
AP-ALLFILES
PROBLEM 12:

Number of tasks: 5

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D E | Row Min
__________|____________________________________|________
1 | 10 20 30 40 50 | 10
2 | 60 70 80 90 100 | 60
3 | 110 120 130 140 150 | 110
4 | 160 170 180 190 200 | 160
5 | 210 220 230 240 250 | 210
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | 0 10 20 30 40 |
2 | 0 10 20 30 40 |
3 | 0 10 20 30 40 |
4 | 0 10 20 30 40 |
5 | 0 10 20 30 40 |
Col Min | 0 10 20 30 40 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | 0 0 0 0 0 |
2 | 0 0 0 0 0 |
3 | 0 0 0 0 0 |
4 | 0 0 0 0 0 |
5 | 0 0 0 0 0 |
| |

Step :
Page 23
AP-ALLFILES
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D E |
__________|____________________________________|________
| | | | | | |
1 | 0 0 0 0 0 |
| | | | | | |
2 | 0 0 0 0 0 |
| | | | | | |
3 | 0 0 0 0 0 |_

| | | | | | |
4 | 0 0 0 0 0 |
| | | | | | |
5 | 0 0 0 0 0 |
| | | | | | |

Make the assignments.

Task
Assignee| A B C D E |
__________|____________________________________|________
1 | [0] 0 0 0 0 |
2 | 0 [0] 0 0 0 |
3 | 0 0 [0] 0 0 |
4 | 0 0 0 [0] 0 |
5 | 0 0 0 0 [0] |

Task A is assigned to Assignee 1

Task B is assigned to Assignee 2
Task C is assigned to Assignee 3
Task D is assigned to Assignee 4
Task E is assigned to Assignee 5

PROBLEM 13:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
Page 24
AP-ALLFILES
1 | 200 300 400 | 200
2 | 500 600 700 | 500
3 | 800 900 999 | 800
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 100 200 |
2 | 0 100 200 |
3 | 0 100 199 |
Col Min | 0 100 199 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 0 1 |
2 | 0 0 1 |
3 | 0 0 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | | | |
1 | 0 0 1 |
| | | | |
2 | 0 0 1 |
| | | | |
3 | 0 0 0 |
| | | | |

Make the assignments.

Task
Assignee| A B C |_

Page 25
AP-ALLFILES

__________|______________________|________
1 | [0] 0 1 |
2 | 0 [0] 1 |
3 | 0 0 [0] |

Task A is assigned to Assignee 1

Task B is assigned to Assignee 2
Task C is assigned to Assignee 3

PROBLEM 14:

Number of tasks: 3

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C | Row Min
__________|______________________|________
1 | 900 850 800 | 800
2 | 750 700 650 | 650
3 | 600 550 500 | 500
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C |
__________|______________________|________
1 | 100 50 0 |
2 | 100 50 0 |
3 | 100 50 0 |
Col Min | 100 50 0 |

Step :
Enter the results in a new table.

Task
Assignee| A B C |
__________|______________________|________
1 | 0 0 0 |
2 | 0 0 0 |
Page 26
AP-ALLFILES
3 | 0 0 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C |
__________|______________________|________
| | | | |
1 | 0 0 0 |
| | | | |
2 | 0 0 0 |
| | | | |
3 | 0 0 0 |
| | | | |

Make the assignments.

Task
Assignee| A B C |_

__________|______________________|________
1 | [0] 0 0 |
2 | 0 [0] 0 |
3 | 0 0 [0] |

Task A is assigned to Assignee 1

Task B is assigned to Assignee 2
Task C is assigned to Assignee 3

PROBLEM 15:

Number of tasks: 4

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D | Row Min
__________|_____________________________|________
1 | 12 30 56 90 | 12
2 | 56 87 99 100 | 56
3 | 13 9 7 160 | 7
4 | 16 21 29 31 | 16
Page 27
AP-ALLFILES
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 18 44 78 |
2 | 0 31 43 44 |
3 | 6 2 0 153 |
4 | 0 5 13 15 |
Col Min | 0 2 0 15 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 16 44 63 |
2 | 0 29 43 29 |
3 | 6 0 0 138 |
4 | 0 3 13 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | | |
1 | 0 16 44 63 |
| | | |
2 | 0 29 43 29 |
| | | |
3 |-6------0------0------138------|
| | | |
4 | 0 3 13 0 |
| | | |_

Step :
Select the smallest number from all the uncovered numbers
Page 28
AP-ALLFILES

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 16 44 63 |
2 | 0 29 43 29 |
3 | 6 0 0 138 |
4 | 0 [3] 13 0 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 13 41 63 |
2 | 0 26 40 29 |
3 | 9 0 0 141 |
4 | 0 0 10 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | |
1 | 0 13 41 63 |
| | |
2 | 0 26 40 29 |
| | |
3 |-9------0------0------141------|
| | |
4 |-0------0------10------0------|
| | |

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 [13] 41 63 |
Page 29
AP-ALLFILES
2 | 0 26 40 29 |
3 | 9 0 0 141 |
4 | 0 0 10 0 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by _

number and added to every number at the intersection of covering lines

automatically.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 0 28 50 |
2 | 0 13 27 16 |
3 | 22 0 0 141 |
4 | 13 0 10 0 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | | | | |
1 | 0 0 28 50 |
| | | | | |
2 | 0 13 27 16 |
| | | | | |
3 | 22 0 0 141 |
| | | | | |
4 | 13 0 10 0 |
| | | | | |

Make the assignments.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 [0] 28 50 |
2 | [0] 13 27 16 |
3 | 22 0 [0] 141 |
4 | 13 0 10 [0] |

Page 30
AP-ALLFILES
Task B is assigned to Assignee 1
Task A is assigned to Assignee 2
Task C is assigned to Assignee 3
Task D is assigned to Assignee 4

PROBLEM 16:

Number of tasks: 4

Step :
Subtract the smallest number in each row from every number in the row.
Enter the results in a new table.

Task
Assignee| A B C D | Row Min
__________|_____________________________|________
1 | 10 100 200 501 | 10
2 | 7 10 501 9 | 7
3 | 1 501 10 11 | 1
4 | 501 3 5 10 | 3
| |

Step :
Subtract the smallest number in each column of the new table from every number in
the column.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 90 190 491 |
2 | 0 3 494 2 |
3 | 0 500 9 10 |
4 | 498 0 2 7 |
Col Min | 0 0 2 2 |

Step :
Enter the results in a new table.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 90 188 489 |
2 | 0 3 492 0 |
3 | 0 500 7 8 |
4 | 498 0 0 5 |
| |
Page 31
AP-ALLFILES

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
__________|_____________________________|________
| | | |
1 | 0 90 188 489 |
| | | |
2 | 0 3 492 0 |
| | | |
3 | 0 500 7 8 |
| | | |
4 |-498------0------0------5------|
| | | |_

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 90 188 489 |
2 | 0 [3] 492 0 |
3 | 0 500 7 8 |
4 | 498 0 0 5 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by
number and added to every number at the intersection of covering lines
automatically.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 87 185 489 |
2 | 0 0 489 0 |
3 | 0 497 4 8 |
4 | 501 0 0 8 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.
Page 32
AP-ALLFILES

Task
Assignee| A B C D |
__________|_____________________________|________
| | |
1 | 0 87 185 489 |
| | |
2 |-0------0------489------0------|
| | |
3 | 0 497 4 8 |
| | |
4 |-501------0------0------8------|
| | |

Step :
Select the smallest number from all the uncovered numbers

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 87 185 489 |
2 | 0 0 489 0 |
3 | 0 497 [4] 8 |
4 | 501 0 0 8 |
| |

Step :
The smallest number selected at the preceding step will be subtracted from every
uncovered by _

number and added to every number at the intersection of covering lines

automatically.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | 0 83 181 485 |
2 | 4 0 489 0 |
3 | 0 493 0 4 |
4 | 505 0 0 8 |
| |

Step :
Determine the minimum number of lines needed to cross out all zeros.

Task
Assignee| A B C D |
Page 33
AP-ALLFILES
__________|_____________________________|________
| | | | | |
1 | 0 83 181 485 |
| | | | | |
2 | 4 0 489 0 |
| | | | | |
3 | 0 493 0 4 |
| | | | | |
4 | 505 0 0 8 |
| | | | | |

Make the assignments.

Task
Assignee| A B C D |
__________|_____________________________|________
1 | [0] 83 181 485 |
2 | 4 0 489 [0] |
3 | 0 493 [0] 4 |
4 | 505 [0] 0 8 |

Task A is assigned to Assignee 1

Task D is assigned to Assignee 2
Task C is assigned to Assignee 3
Task B is assigned to Assignee 4

Page 34
INTEGER LINEAR PROGRAMMING PROBLEM

1.MAX 10X1+14X2+28X3

S.T.

1) 5X1+19X2+29X3<21
2) 12X1+24X2+37X3<34
3) 25X1+34X2+56X3<56

OPTIMAL SOLUTION(ALL VARIABLES ARE GENERAL INTEGER)

Objective Function Value = 20.000

Variable Value
-------------- ---------------
X1 2.000
X2 0.000
X3 0.000

OPTIMAL SOLUTION(All Variables are General Integer)

Objective Function Value = 80.000

Variable Value
-------------- ---------------
X1 0.000
X2 0.000
X3 0.000
X4 0.000
X5 0.000
X6 0.000
X7 0.000
X8 1.000

Constraint Slack/Surplus
-------------- ---------------
1 1.000
2 18.000
3 11.000
4 32.000
5 40.000
6 48.000
7 54.000
8 55.000
9 60.000
Page 7
10 69.000

9. MAX 15X1+27X2+39X3+41X4+53X5+62X6+77X7+80X8

S.T.

OPTIMAL SOLUTION(Multiple Types of Variables)

Objective Function Value = 145.500

Variable Value
-------------- ---------------
X1 0.000
X2 0.000
X3 0.000
X4 0.000
X5 0.000
X6 0.000
X7 1.500
X8 0.375

Constraint Slack/Surplus
-------------- ---------------
1 0.000
2 14.625
3 1.875
4 0.000
5 19.125
6 5.250
7 7.250
8 47.875
9 48.250
10 69.250

10. MAX 15X1+27X2+39X3+41X4+53X5+62X6+77X7+80X8

Objective Function Value = 2.000

Variable Value
-------------- ---------------
X1 0.000
X2 1.000
X3 0.000
X4 0.000
X5 0.000
X6 0.000

Constraint Slack/Surplus
-------------- ---------------
1 8.000
2 6.000
3 6.000
4 6.000
5 6.000
6 7.000
Page 14
ILP-ALLFILES

18. MIN 1X1+2X2+4X3+6X4+10X5

S.T.

1) 11X1+5X2+16X3+7X4+12X5>11
2) 13X1+15X2+26X3+13X4+16X5>21
3) 15X1+17X2+5X3+25X4+20X5>23
4) 16X1+19X2+3X3+24X5>25
5) 19X1+20X2+9X3+3X4+22X5>27

OPTIMAL SOLUTION(All variables are General Integer)

Objective Function Value = 2.000

Variable Value
-------------- ---------------
X1 2.000
X2 0.000
X3 0.000
X4 0.000
X5 0.000

Constraint Slack/Surplus
-------------- ---------------
1 11.000
2 5.000
3 7.000
4 7.000
5 11.000

19. MIN 1X1+2X2+4X3+6X4+10X5

S.T.

1) 11X1+5X2+16X3+7X4+12X5>11
2) 13X1+15X2+26X3+13X4+16X5>21
3) 15X1+17X2+5X3+25X4+20X5>23
4) 16X1+19X2+3X3+24X5>25
5) 19X1+20X2+9X3+3X4+22X5>27

OPTIMAL SOLUTION(Multiple Types of Variables)

Objective Function Value = 1.615

Variable Value
-------------- ---------------
Page 15
ILP-ALLFILES
X1 1.615
X2 0.000
X3 0.000
X4 0.000
X5 0.000

Constraint Slack/Surplus
-------------- ---------------
1 6.769
2 0.000
3 1.231
4 0.846
5 3.692

20. MIN 1X1+2X2+4X3+6X4+10X5

S.T.

1) 11X1+5X2+16X3+7X4+12X5>11
2) 13X1+15X2+26X3+13X4+16X5>21
3) 15X1+17X2+5X3+25X4+20X5>23
4) 16X1+19X2+3X3+24X5>25
5) 19X1+20X2+9X3+3X4+22X5>27

OPTIMAL SOLUTION(All variables are 0/1(Binary))

Objective Function Value = 3.000

Variable Value
-------------- ---------------
X1 1.000
X2 1.000
X3 0.000
X4 0.000
X5 0.000

Constraint Slack/Surplus
-------------- ---------------
1 5.000
2 7.000
3 9.000
4 10.000
5 12.000

21. MAX 10X1+13X2+19X3+21X4+5X5+8X6+9X7+2X8+1X9+19X10

Page 16
S.T.

1) 5X1+6X2+3X3+1X4+8X5+6X6+16X7+12X8+13X9+16X10<110
2) 4X3+6X4+8X5+10X6+14X7+18X8+21X9+24X10<112
3) 5X3+7X4+9X5+11X6+13X7+15X8+17X9+19X10<123
4) 9X3+12X4+15X5+18X6+21X7+24X8+27X9+30X10<134
5) 8X3+13X4+16X5+19X6+22X7+25X8+28X9+29X10<145

OPTIMAL SOLUTION

Objective Function Value = 443.000

Variable Value
-------------- ---------------
X1 3.000
X2 14.000
X3 0.000
X4 11.000
X5 0.000
X6 0.000
X7 0.000
X8 0.000
X9 0.000
X10 0.000

Constraint Slack/Surplus
-------------- ---------------
1 0.000
2 46.000
3 46.000
4 2.000
5 2.000

22. MIN 12X1+21X2+23X3+25X4+27X5

S.T.

1) 1X1+3X2+5X3+8X4+12X5>10
2) 8X1+2X2+5X3+6X4+2X5>12
3) 2X1+1X2+3X3+4X4+1X5>13
4) 4X1+5X2+9X3+5X4+2X5>14
5) 5X1+1X3+7X4+5X5>15
6) 6X1+1X2+1X4+4X5>16
7) 3X2+8X3+6X5>17
8) 9X1+2X2+4X3+5X4+8X5>18

OPTIMAL SOLUTION
Page 17
ILP-ALLFILES

Objective Function Value = 103.000

Variable Value
-------------- ---------------
X1 3.000
X2 1.000
X3 2.000
X4 0.000
X5 0.000

Constraint Slack/Surplus
-------------- ---------------
1 6.000
2 24.000
3 0.000
4 21.000
5 2.000
6 3.000
7 2.000
8 19.000

23. MIN 12X1+21X2+23X3+25X4+27X5

S.T.

1) 1X1+3X2+5X3+8X4+12X5>10
2) 8X1+2X2+5X3+6X4+2X5>12
3) 2X1+1X2+3X3+4X4+1X5>13
4) 4X1+5X2+9X3+5X4+2X5>14
5) 5X1+1X3+7X4+5X5>15
6) 6X1+1X2+1X4+4X5>16
7) 3X2+8X3+6X5>17
8) 9X1+2X2+4X3+5X4+8X5>18

OPTIMAL SOLUTION

OPTIMAL SOLUTION(Multiple Types of variables)

The solution for this problem with "ALL VARIABLES ARE 0/1 BINARY" IS ----- NO
FEASIBLE SOLUTION

Objective Function Value = 25.556

Variable Value
Page 21
ILP-ALLFILES
-------------- ---------------
X1 0.000
X2 5.111
X3 0.000
X4 0.000
X5 0.000

Constraint Slack/Surplus
-------------- ---------------
1 20.556
2 39.111
3 25.000
4 44.667
5 25.111
6 25.333
7 0.000
8 41.111

---------- -------- --------
5 4 11.2
4 3 13.9
3 2 15.6
2 1 13.4

TOTAL DISTANCE 54.1

7.
NETWORK DESCRIPTION

5 NODES AND 5 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 12.8
2 2 1 13.4
3 3 2 15.6
4 5 4 11.2
5 4 3 13.9

Page 4
SR-ALLFILES

THE SHORTEST ROUTE FROM NODE 4 TO NODE 2

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
4 3 13.9
3 2 15.6

TOTAL DISTANCE 29.5

8.
NETWORK DESCRIPTION

5 NODES AND 5 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 12.8
2 2 1 13.4
3 3 2 15.6
4 5 4 11.2
5 4 3 13.9

THE SHORTEST ROUTE FROM NODE 3 TO NODE 1

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
3 2 15.6
2 1 13.4

TOTAL DISTANCE 29.0

9.
NETWORK DESCRIPTION

7 NODES AND 7 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
Page 5
SR-ALLFILES
1 1 1 21
2 2 1 24
3 3 2 31
4 4 1 26
5 5 3 31
6 6 4 33
7 7 6 35

THE SHORTEST ROUTE FROM NODE 1 TO NODE 7

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
1 4 26
4 6 33
6 7 35

TOTAL DISTANCE 94

10.

NETWORK DESCRIPTION

7 NODES AND 7 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 21
2 2 1 24
3 3 2 31
4 4 1 26
5 5 3 31
6 6 4 33
7 7 6 35

THE SHORTEST ROUTE FROM NODE 1 TO NODE 6

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
1 4 26
4 6 33

Page 6
SR-ALLFILES
TOTAL DISTANCE 59

11. NETWORK DESCRIPTION

7 NODES AND 7 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 21
2 2 1 24
3 3 2 31
4 4 1 26
5 5 3 31
6 6 4 33
7 7 6 35

THE SHORTEST ROUTE FROM NODE 1 TO NODE 5

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
1 2 24
2 3 31
3 5 31

TOTAL DISTANCE 86

12.

NETWORK DESCRIPTION

5 NODES AND 5 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 1.9
2 3 2 19.1
3 2 1 29.8
4 4 3 31.4
5 5 4 41.5

Page 7
SR-ALLFILES

THE SHORTEST ROUTE FROM NODE 2 TO NODE 5

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
2 3 19.1
3 4 31.4
4 5 41.5

TOTAL DISTANCE 92.0

21.

NETWORK DESCRIPTION

Page 12
SR-ALLFILES
7 NODES AND 7 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 21
2 2 1 24
3 3 2 31
4 4 1 26
5 5 3 31
6 6 4 33
7 7 6 35

THE SHORTEST ROUTE FROM NODE 7 TO NODE 3

****************************************

START NODE END NODE DISTANCE

---------- -------- --------
7 6 35
6 4 33
4 1 26
1 2 24
2 3 31

TOTAL DISTANCE 149

22.

NETWORK DESCRIPTION

7 NODES AND 7 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 21
2 2 1 24
3 3 2 31
4 4 1 26
5 5 3 31
6 6 4 33
7 7 6 35

THE SHORTEST ROUTE FROM NODE 2 TO NODE 4

****************************************

START NODE END NODE DISTANCE

START NODE END NODE DISTANCE

---------- -------- --------
2 3 10

TOTAL DISTANCE 10

Page 19
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:39:25

Module/submodel: Inventory/ABC Analysis

Problem title: (untitled)
Percent of items that are A items: 20
Percent of items that are B items: 30

Results ----------

Item Dollar Percent Cumultv

name Demand Price Volume of $-Vol $-vol % Category
Item 5 28 54 1512 38.21 38.21 A
Item 4 25 45 1125 28.43 66.64 B
Item 3 21 39 819 20.7 87.34 C
Item 2 13 27 351 8.87 96.21 C
Item 1 10 15 150 3.79 100 C
---------------------------------------------------------------------------------
TOTAL 97 3957
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:35:06

Module/submodel: Inventory/ABC Analysis

Problem title: (untitled)
Percent of items that are A items: 20
Percent of items that are B items: 30

Results ----------

Item Dollar Percent Cumultv

name Demand Price Volume of $-Vol $-vol % Category
Item 5 28 13 364 37.56 37.56 A
Item 4 25 11 275 28.38 65.94 B
Item 3 21 9 189 19.5 85.45 C
Item 2 13 7 91 9.39 94.84 C
Item 1 10 5 50 5.16 100 C
---------------------------------------------------------------------------------
TOTAL 97 969
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:40:33

Module/submodel: Inventory/ABC Analysis

Problem title: (untitled)
Percent of items that are A items: 20
Percent of items that are B items: 30

Results ----------

Item Dollar Percent Cumultv

name Demand Price Volume of $-Vol $-vol % Category
Item 5 90 89 8010 47.98 47.98 A
Item 4 72 67 4824 28.9 76.88 B
Item 3 51 44 2244 13.44 90.33 C
Item 2 33 35 1155 6.92 97.24 C
Item 1 20 23 460 2.76 100 C
---------------------------------------------------------------------------------
TOTAL 266 16693
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-06-2014 14:53:23

Module/submodel: Inventory/Economic Order Quantity(EOQ) Model

Problem title: (untitled)
Order Quantity (0=EOQ): 0
Reorder point: No reorder point

Results ----------

Data
Demand rate(D) 12
Setup/Ordering cost(S) 80
Holding cost(H) 10
Unit cost 50

Results
Optimal order quantity (Q*) 13.86
Maximum Inventory Level (Imax) 13.86
Average inventory 6.93
Orders per period(year) .87
Annual Setup cost $69.28
Annual Holding cost $69.28
Unit costs (PD) $600
Total Cost $738.56

(untitled)
Inventory costs excluding unit costs

Cost

Total Cost

$138.56 Holding Cost

Setup cost

13.86
Order Quantity, Q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:41:45

Module/submodel: Inventory/ABC Analysis

Problem title: (untitled)
Percent of items that are A items: 20
Percent of items that are B items: 30

Results ----------

Item Dollar Percent Cumultv

name Demand Price Volume of $-Vol $-vol % Category
Item 5 565 700 395500 41.98 41.98 A
Item 4 465 675 313875 33.32 75.29 B
Item 3 351 435 152685 16.21 91.5 C
Item 2 233 234 54522 5.79 97.29 C
Item 1 120 213 25560 2.71 100 C
---------------------------------------------------------------------------------
TOTAL 1734 942142
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:45:37

Module/submodel: Inventory/Production Order Quantity Model

Problem title: (untitled)
Order Quantity (0=EOQ): 0

Results ----------

Data
Demand rate(D) 10000
Setup/Ordering cost(S) 690
Holding cost(H) 50
Daily production rate(p)50
Days per year (D/d) 250
Daily demand rate 40
Unit cost 70

Results
Optimal production quantity (Q*) 1174.73
Maximum Inventory Level (Imax) 234.95
Average inventory 117.47
Production runs per period (year) 8.51
Annual Setup cost $5873.67
Annual Holding cost $5873.67
Unit costs (PD) $700000
Total Cost $711747.3

(untitled)
Inventory costs excluding unit costs

Cost

Total Cost

$11,747.34 Holding Cost

Setup cost

1174.73
Order Quantity, Q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 19:46:54

Module/submodel: Inventory/Back Order Inventory Model

Problem title: (untitled)

Results ----------

Data
Demand rate(D) 1000
Setup/Ordering cost(S) 400
Holding@20% 20
Backorder cost(B) 20
Unit cost

Results
Optimal order quantity (Q*) 282.84
Maximum Inventory Level (Imax) 141.42
Maximum Inventory Shortage (B) 141.42
Orders per period(year) 3.54
Annual Setup cost $1414.21
Annual Holding cost $707.11
Annual Shortage cost $707.11
Unit costs (PD) $100000
Total Cost $102828.4
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 20:06:05

Module/submodel: Inventory/Production with Backorders Model

Problem title: (untitled)

Results ----------

Data
Demand rate(D) 2500
Setup/Ordering cost(S) 200
Holding cost(H) 20
Daily production rate(p)400
Days per year (D/d) 250
Daily demand rate 10
Backorder cost(G) 20
Unit cost 100

Results
Optimal order quantity (Q*) 320.26
Maximum Inventory Level (Imax) 160.03
Maximum Inventory Shortage (B) 156.12
Orders per period(year) 7.81
Annual Setup cost $1561.25
Annual Holding cost $780.62
Annual Shortage cost $780.62
Unit costs (PD) $250000
Total Cost $255122.5
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 20:11:37

Module/submodel: Inventory/Quantity Discount (EOQ) Model

Problem title: (untitled)

Results ----------

Data
Demand rate(D) 1200
Setup/Ordering cost(S) 60
Holding cost(H) 80
Price Ranges From To Price
1 4 100
4 7 90

Results
Optimal order quantity (Q*) 42.43
Maximum Inventory Level (Imax) 42.43
Average inventory 21.21
Orders per period(year) 28.28
Annual Setup cost $1697.06
Annual Holding cost $1697.06
Unit costs (PD) $108000
Total Cost $111394.1

Details ----------

Setup Holding Unit Total

Range Quantity Cost Cost Cost Cost
1 to 4
4 to 7 42.43 1697.06 1697.06 108000 111394.1

(untitled)
Inventory costs including unit costs

Cost

$111,394.1 Total Cost

4 42.43
Order Quantity, Q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 20:13:43

Module/submodel: Inventory/Reorder Point/Safety Stock (Normal Distribution)

Problem title: (untitled)

Results ----------

Data
(Daily) Demand (d-bar) 12000
(Daily) Demand std dev (sigma-d)
0
Service level % 95
Lead time (in days) (L) 1
Lead time std dev (sigma L) 0

Results
Z value 1.64
Expected demand during lead time 12000
Safety Stock 0
Reorder point 12000
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 20:16:22

Module/submodel: Inventory/Reorder Point/Safety Stock (Discrete Distribution)

Problem title: (untitled)

Results ----------

Data
Reorder point w/o safety stock 12
Carrying cost per year 200
Stockout cost 154
Orders per year 2

Demand Table

Demand Probability
Value 1 12 .5
Value 2 15 .5

Results
Safety Stock Holding Cost Stockout Cost Total Cost
0 0 462 462
3 600 0 600

Original Reorder Point 12

Best Safety Stock 0
Revised reorder point 12
Minimal cost 462
MST-ALLFILES

1. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 10 80
2 2 10 60
3 3 10 70
4 4 10 56
5 5 10 41
6 6 10 37
7 7 10 82
8 8 10 93
9 9 10 100
10 10 10 51

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 10 80

10 6 37

10 5 41

10 4 56

10 2 60

10 3 70

10 7 82

10 8 93
Page 1
MST-ALLFILES

10 9 100

TOTAL LENGTH 619

2. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 4 11.20
2 10 6 13.10
3 8 5 14.80
4 7 9 15.60
5 9 1 16.90
6 4 3 17.30
7 3 8 19.01
8 5 6 21.34
9 6 4 41.98
10 2 7 18.31

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 4 11.20

1 9 16.90

9 7 15.60

4 3 17.30

7 2 18.31
Page 2
MST-ALLFILES

3 8 19.01

8 5 14.80

5 6 21.34

6 10 13.10

TOTAL LENGTH 147.56

3. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

6 NODES AND 6 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 2 11
2 2 2 13
3 4 3 15
4 3 1 17
5 5 4 23
6 6 5 26

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 2 11

1 3 17

3 4 15

4 5 23
Page 3
MST-ALLFILES

5 6 26

TOTAL LENGTH 92

4. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

6 NODES AND 6 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 4 2 11
2 2 2 13
3 5 3 15
4 3 1 17
5 5 4 23
6 6 5 26

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 3 17

3 5 15

5 4 23

4 2 11

5 6 26

TOTAL LENGTH 92

Page 4
MST-ALLFILES

5. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

6 NODES AND 6 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 6 5 10.3
2 2 1 11.2
3 5 2 13.4
4 4 3 15.6
5 3 2 16.9
6 1 1 17.8

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 2 11.2

2 5 13.4

5 6 10.3

2 3 16.9

3 4 15.6

TOTAL LENGTH 67.4

6. MINIMAL SPANNING TREE

*********************

Page 5
MST-ALLFILES
**** NETWORK DESCRIPTION ****

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 12
2 2 1 23
3 3 1 31
4 4 1 40
5 5 1 51
6 6 1 60
7 7 1 71
8 8 1 80
9 9 1 92
10 10 1 100

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 1 12

1 2 23

1 3 31

1 4 40

1 5 51

1 6 60

1 7 71

1 8 80

1 9 92

TOTAL LENGTH 460

Page 6
MST-ALLFILES

7. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

6 NODES AND 6 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 6 5 19.6
2 5 4 21.7
3 4 3 20.3
4 3 2 14.5
5 2 1 19.5
6 1 3 51.2

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 2 19.5

2 3 14.5

3 4 20.3

4 5 21.7

5 6 19.6

TOTAL LENGTH 95.6

8. MINIMAL SPANNING TREE

*********************

Page 7
MST-ALLFILES
**** NETWORK DESCRIPTION ****

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 1 12
2 2 1 23
3 3 2 31
4 4 3 40
5 5 4 51
6 6 5 60
7 7 6 71
8 8 7 77
9 9 8 88
10 10 9 100

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 1 12

1 2 23

2 3 31

3 4 40

4 5 51

5 6 60

6 7 71

7 8 77

8 9 88

TOTAL LENGTH 453

Page 8
MST-ALLFILES

9. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 2 12
2 2 3 23
3 3 4 31
4 4 5 40
5 5 6 51
6 6 7 60
7 7 8 71
8 8 9 77
9 9 10 88
10 10 10 100

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 2 12

2 3 23

3 4 31

4 5 40

5 6 51

6 7 60

7 8 71

8 9 77

9 10 88
Page 9
MST-ALLFILES

TOTAL LENGTH 453

10. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 3 12
2 2 1 23
3 3 4 31
4 4 7 40
5 5 9 51
6 6 10 60
7 7 8 71
8 8 5 77
9 9 3 88
10 10 1 100

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 3 12

1 2 23

3 4 31

4 7 40

7 8 71

8 5 77
Page 10
MST-ALLFILES

5 9 51

1 10 100

10 6 60

TOTAL LENGTH 465

11. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

20 NODES AND 40 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 20 15
2 2 2 15
3 5 6 21
4 8 3 36
5 12 5 39
6 3 1 40
7 5 4 41
8 4 8 51
9 6 7 65
10 9 9 66
11 7 11 78
12 8 10 91
13 10 14 11
14 11 13 10
15 13 12 20
16 15 11 31
17 17 10 4
18 16 19 12
19 14 15 6
20 20 17 8
21 19 18 9
22 8 15 17
23 10 14 23
24 10 17 34
Page 11
MST-ALLFILES
25 11 19 52
26 13 20 56
27 18 1 72
28 19 2 26
29 17 5 41
30 13 4 81
31 14 2 89
32 18 1 11
33 18 18 120
34 19 16 121
35 20 15 134
36 4 17 151
37 3 17 169
38 9 2 312
39 6 9 465
40 4 18 51

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 18 11

18 19 9

1 20 15

20 17 8

19 2 26

17 10 34

10 14 23

14 15 6

15 8 17

15 11 31

11 13 10

Page 12
MST-ALLFILES
13 12 20

8 3 36

12 5 39

5 6 21

5 4 41

6 7 65

19 16 121

2 9 312

TOTAL LENGTH 845

12. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 6 10
2 2 4 15
3 3 9 20
4 4 6 23
5 5 2 25
6 6 1 36
7 7 2 38
8 8 3 45
9 9 4 47
10 10 1 49

MINIMAL SPANNING TREE

Page 13
MST-ALLFILES
*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 6 36

6 4 23

4 2 15

2 5 25

2 7 38

4 9 47

9 3 20

3 8 45

1 10 49

TOTAL LENGTH 298

13. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 1 10 100
2 2 9 123
3 5 3 141
4 4 7 151
5 8 1 124
6 9 5 161
7 10 7 189
8 6 8 190
9 4 3 213
Page 14
MST-ALLFILES
10 1 5 211

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 10 100

1 8 124

10 7 189

7 4 151

8 6 190

1 5 211

5 3 141

5 9 161

9 2 123

TOTAL LENGTH 1390

14. MINIMAL SPANNING TREE

*********************

NETWORK DESCRIPTION

10 NODES AND 10 ARCS

ARC START NODE END NODE DISTANCE

--- ---------- -------- --------
1 10 6 10.50
2 9 4 12.30
3 8 9 13.50
Page 15
MST-ALLFILES
4 7 6 14.70
5 1 2 15.40
6 2 1 21.00
7 4 2 23.00
8 6 3 25.00
9 5 4 31.80
10 3 1 8.31

MINIMAL SPANNING TREE

*********************

START NODE END NODE DISTANCE

---------- -------- --------
1 3 8.31

1 2 21.00

2 4 23.00

4 9 12.30

9 8 13.50

3 6 25.00

6 10 10.50

6 7 14.70

4 5 31.80

TOTAL LENGTH 160.11

Page 16
CPM/PERT

1.PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE EXPECTED
ACTIVITY PREDECESSORS TIME
--------------------------------------------------
A - 10
B A 12
C B 14
D A,B,C 20
E C 22
F D 23
G E 19
H G 24
I G,H 31
J H,I 29
--------------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 10 10 0 YES
B 10 10 22 22 0 YES
C 22 22 36 36 0 YES
D 36 118 56 138 82
E 36 36 58 58 0 YES
F 56 138 79 161 82
G 58 58 77 77 0 YES
H 77 77 101 101 0 YES
I 101 101 132 132 0 YES
J 132 132 161 161 0 YES

----------------------------------------------------------------------------

5. PROJECT SCHEDULING WITH PERT/CPM

********************************

Page 4
CPM-ALLFILES
*** PROJECT ACTIVITY LIST ***

IMMEDIATE EXPECTED
ACTIVITY PREDECESSORS TIME
--------------------------------------------------
A - 1
B - 9
C A 19
D B,C 28
E A,D 32
F D,E 41
G D,E,F 13
H A,F,G 53
I C,F,H 62
J A,D,I 70
--------------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 1 1 0 YES
B 0 11 9 20 11
C 1 1 20 20 0 YES
D 20 20 48 48 0 YES
E 48 48 80 80 0 YES
F 80 80 121 121 0 YES
G 121 121 134 134 0 YES
H 134 134 187 187 0 YES
I 187 187 249 249 0 YES
J 249 249 319 319 0 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-J

PROJECT COMPLETION TIME = 319

6. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

* PROJECT ACTIVITY LIST *

IMMEDIATE EXPECTED
ACTIVITY PREDECESSORS TIME
Page 8
CPM-ALLFILES
--------------------------------------------------
A - 100
B A 100
C B 100
D C 100
E A,C 100
F B,E 100
G A,E,F 100
H A,F,G 100
I A,G,H 100
J A,E,G,I 100
--------------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 9 9 0 YES
B 9 9 22 22 0 YES
C 22 22 32 32 0 YES
D 32 32 37 37 0 YES
E 37 37 43 43 0 YES
F 43 43 55 55 0 YES
G 55 55 69 69 0 YES
H 69 69 84 84 0 YES
I 84 84 103 103 0 YES
J 103 103 124 124 0 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-F-J

PROJECT COMPLETION TIME = 124

19. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 5 5 5
B A 5 5 5
C A,B 5 5 5
D B,C 5 5 5
E B,C,D 5 5 5
-----------------------------------------------------------------------------

Page 18
CPM-ALLFILES

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 5 0.00
B 5 0.00
C 5 0.00
D 5 0.00
E 5 0.00
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 5 5 0 YES
B 5 5 10 10 0 YES
C 10 10 15 15 0 YES
D 15 15 20 20 0 YES
E 20 20 25 25 0 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-B-E

EXPECTED PROJECT COMPLETION TIME = 25

VARIANCE OF PROJECT COMPLETION TIME = 0

Page 19
PERT-ALLFILES

1. PROJECT SCHEDULING WITH

PERT/CPM
********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE

PESSIMISTIC ACTIVITY PREDECESSORS TIME
TIME TIME
------------------------------------------------------------------------
-A - 1 2 5
B A 2 3
6C B 3
7 9 D A,C
2 5 10 E A,D
2 4 6 F
A,B,E 1 3 8 G
D,F 1 2 5 H
F,G 5 10 15 I C,F,H
1 2 3 J
B,C,G,I 1 1 1 K
I,J 5 5 6 L
G,K 2 2 4 M
F,I 6 10 12 N D,L
18 20 22 O K,M 21
23 25 P E,J,N,O 2
6 12 Q C,H,L,P 12
14 17 R A,B 11 22
33 S A 10 10 20
T L,P,R,S 11 21 21
U P,R,T 10 20 60
V P,S,U 8 9 30
W A,D,K,M,V 1 5 15
X L,R,V,W 1 9 10
Y A,B,G,J,K,Q,U,X 5 5
5
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

Page 1
PERT-ALLFILES
-------------------------------------------
A 2.33 0.44
B 3.33 0.44
C 6.67 1.00
D 5.33 1.78
E 4.00 0.44
F 3.50 1.36
G 2.33 0.44
H 10.00 2.78
I 2.00 0.11
J 1.00 0.00
K 5.17 0.03
L 2.33 0.11
M 9.67 1.00
N 20.00 0.44
O 23.00 0.44
P 6.33 2.78
Q 14.17 0.69
R 22.00 13.44
S 11.67 2.78
T 19.33 2.78
U 25.00 69.44
V 12.33 13.44
W 6.00 5.44
X 7.83 2.25
Y 5.00 0.00
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 2.33 2.33 0.00 YES

B 2.33 2.33 5.67 5.67 0.00 YES
C 5.67 5.67 12.33 12.33 0.00 YES
D 12.33 12.33 17.67 17.67 0.00 YES
E 17.67 17.67 21.67 21.67 0.00 YES
F 21.67 21.67 25.17 25.17 0.00 YES
G 25.17 25.17 27.50 27.50 0.00 YES
H 27.50 27.50 37.50 37.50 0.00 YES
I 37.50 37.50 39.50 39.50 0.00 YES

J 39.50 43.00 40.50 44.00 3.50

K 40.50 44.00 45.67 49.17 3.50
L 45.67 49.83 48.00 52.17 4.17
Page 2
PERT-ALLFILES
M 39.50 39.50 49.17 49.17 0.00 YES
N 48.00 52.17 68.00 72.17 4.17
O 49.17 49.17 72.17 72.17 0.00 YES
P 72.17 72.17 78.50 78.50 0.00 YES

Q 78.50 134.83 92.67 149.00 56.33

R 5.67 56.50 27.67 78.50 50.83
S 2.33 66.83 14.00 78.50 64.50

T 78.50 78.50 97.83 97.83 0.00 YES

U 97.83 97.83 122.83 122.83 0.00 YES
V 122.83 122.83 135.17 135.17 0.00 YES
W 135.17 135.17 141.17 141.17 0.00 YES
X 141.17 141.17 149.00 149.00 0.00 YES
Y 149.00 149.00 154.00 154.00 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-Y

EXPECTED PROJECT COMPLETION TIME = 154

VARIANCE OF PROJECT COMPLETION TIME = 0.44

2. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 5.50 7.50 9.50
B A 12.50 13.50 14.50
C B 12.40 13.50 14.60
D A,C 12.01 13.02 14.03
E B,C,D 14.20 16.40 18.60
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
Page 3
PERT-ALLFILES
A 7.50 0.44
B 13.50 0.11
C 13.50 0.13
D 13.02 0.11
E 16.40 0.54
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 7.50 7.50 0.00 YES

B 7.50 7.50 21.00 21.00 0.00 YES
C 21.00 21.00 34.50 34.50 0.00 YES
D 34.50 34.50 47.52 47.52 0.00 YES
E 47.52 47.52 63.92 63.92 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-B-E

EXPECTED PROJECT COMPLETION TIME = 63.92

VARIANCE OF PROJECT COMPLETION TIME = 1.09

3. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 10.00 10.50 11.00
B A 11.00 11.50 12.00
C A,B 12.00 12.50 13.00
D A,B,C 13.00 13.50 14.00
E A,B,C,D 14.00 14.50 15.00

-----------------------------------------------------------------------------
Page 4
PERT-ALLFILES

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 10.50 0.03
B 11.50 0.03
C 12.50 0.03
D 13.50 0.03
E 14.50 0.03
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 10.50 10.50 0.00 YES

B 10.50 10.50 22.00 22.00 0.00 YES
C 22.00 22.00 34.50 34.50 0.00 YES
D 34.50 34.50 48.00 48.00 0.00 YES
E 48.00 48.00 62.50 62.50 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-E

EXPECTED PROJECT COMPLETION TIME = 62.5

VARIANCE OF PROJECT COMPLETION TIME = 0.06

4. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
Page 5
PERT-ALLFILES
A - 0.00 0.50 1.30
B - 1.00 1.50 2.00
C - 3.00 3.30 12.50 D
C 10.00 12.00 14.50 E
C,D 11.00 12.40 14.90
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 0.55 0.05
B 1.50 0.03
C 4.78 2.51
D 12.08 0.56
E 12.58 0.42
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 28.90 0.55 29.45 28.90

B 0.00 27.95 1.50 29.45 27.95

C 0.00 0.00 4.78 4.78 0.00 YES

D 4.78 4.78 16.87 16.87 0.00 YES
E 16.87 16.87 29.45 29.45 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: C-E

EXPECTED PROJECT COMPLETION TIME = 29.45

VARIANCE OF PROJECT COMPLETION TIME = 2.93

5. PROJECT SCHEDULING WITH PERT/CPM

********************************
Page 6
PERT-ALLFILES

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 111.00 222.00 333.00
B A 121.00 131.00 141.50
C A,B 123.00 123.00 123.00
D A,C 212.00 213.00 312.70
E C,D 211.50 211.60 211.70
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 222.00 1369.00
B 131.08 11.67
C 123.00 0.00
D 229.45 281.68
E 211.60 0.00

-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 222.00 222.00 0.00 YES

B 222.00 222.00 353.08 353.08 0.00 YES
C 353.08 353.08 476.08 476.08 0.00 YES
D 476.08 476.08 705.53 705.53 0.00 YES
E 705.53 705.53 917.13 917.13 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-C-E

EXPECTED PROJECT COMPLETION TIME = 917.13

Page 7
PERT-ALLFILES

VARIANCE OF PROJECT COMPLETION TIME = 1369

6. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 12.80 13.90 14.00
B A 21.30 31.20 41.30
C B 12.00 13.00 14.00
D C 21.80 31.90 41.60
E D 4.50 5.60 6.70
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 13.73 0.04
B 31.23 11.11
C 13.00 0.11
D 31.83 10.89
E 5.60 0.13
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 13.73 13.73 0.00 YES

B 13.73 13.73 44.97 44.97 0.00 YES
C 44.97 44.97 57.97 57.97 0.00 YES
D 57.97 57.97 89.80 89.80 0.00 YES
E 89.80 89.80 95.40 95.40 0.00 YES

Page 8
PERT-ALLFILES

----------------------------------------------------------------------------

CRITICAL PATH: A-B-C-D-E

EXPECTED PROJECT COMPLETION TIME = 95.4

VARIANCE OF PROJECT COMPLETION TIME = 22.29

7. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 1.00 9.00 21.00
B - 2.00 10.00 22.00
C A,B 3.00 11.00 23.00
D A,B,C 4.00 12.00 24.00
E A,B,D 5.00 12.00 25.00
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 9.67 11.11
B 10.67 11.11
C 11.67 11.11
D 12.67 11.11
E 13.00 11.11
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
Page 9
PERT-ALLFILES
-----------------------------------------------------------------------------

A 0.00 1.00 9.67 10.67 1.00

B 0.00 0.00 10.67 10.67 0.00 YES
C 10.67 10.67 22.33 22.33 0.00 YES
D 22.33 22.33 35.00 35.00 0.00 YES
E 35.00 35.00 48.00 48.00 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: B-E

EXPECTED PROJECT COMPLETION TIME = 48

VARIANCE OF PROJECT COMPLETION TIME = 22.22

8. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 9.00 11.00 21.00
B A 12.00 13.00 16.00
C B 14.00 15.00 16.70
D A,C 12.40 13.60 14.80
E A,C,D 21.00 22.00 23.00
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 12.33 4.00
B 13.33 0.44
C 15.12 0.20
D 13.60 0.16
E 22.00 0.11
-------------------------------------------
Page 10
PERT-ALLFILES

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 12.33 12.33 0.00 YES

B 12.33 12.33 25.67 25.67 0.00 YES
C 25.67 25.67 40.78 40.78 0.00 YES
D 40.78 40.78 54.38 54.38 0.00 YES
E 54.38 54.38 76.38 76.38 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-E

EXPECTED PROJECT COMPLETION TIME = 76.38

VARIANCE OF PROJECT COMPLETION TIME = 4.11

9. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 19.00 19.00 20.00
B A 20.00 20.00 21.00
C B 21.00 21.00 22.00
D A,B 23.00 23.00 24.00
E C,D 21.00 22.00 23.00
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

Page 11
PERT-ALLFILES
-------------------------------------------
A 19.17 0.03
B 20.17 0.03
C 21.17 0.03
D 23.17 0.03
E 22.00 0.11
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 19.17 19.17 0.00 YES

B 19.17 19.17 39.33 39.33 0.00 YES

C 39.33 41.33 60.50 62.50 2.00

D 39.33 39.33 62.50 62.50 0.00 YES
E 62.50 62.50 84.50 84.50 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-D-E

EXPECTED PROJECT COMPLETION TIME = 84.5

VARIANCE OF PROJECT COMPLETION TIME = 0.17

10.PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 9.00 11.00 13.00
B A 13.00 17.00 23.00
C A 23.00 27.00 31.00
D A,B,C 5.00 6.00 7.50
E A,D 7.00 9.00 10.20
-----------------------------------------------------------------------------
Page 12
PERT-ALLFILES

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 11.00 0.44
B 17.33 2.78
C 27.00 1.78
D 6.08 0.17
E 8.87 0.28
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 11.00 11.00 0.00 YES

B 11.00 20.67 28.33 38.00 9.67
C 11.00 11.00 38.00 38.00 0.00 YES
D 38.00 38.00 44.08 44.08 0.00 YES
E 44.08 44.08 52.95 52.95 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-E

EXPECTED PROJECT COMPLETION TIME = 52.95

VARIANCE OF PROJECT COMPLETION TIME = 0.73

11. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
Page 13
PERT-ALLFILES
-------------------------------------------------------------------------
A - 1.00 100.00 1000.00
B - 2.00 20.00 200.00
C B 3.00 30.00 300.00
D B,C 4.00 40.00 400.00
E A,D 5.00 50.00 500.00

-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 233.50 27722.25
B 47.00 1089.00
C 70.50 2450.25
D 94.00 4356.00
E 117.50 6806.25

-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 233.50 233.50 0.00 YES

B 0.00 22.00 47.00 69.00 22.00
C 47.00 69.00 117.50 139.50 22.00
D 117.50 139.50 211.50 233.50 22.00
E 233.50 233.50 351.00 351.00 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-E

EXPECTED PROJECT COMPLETION TIME = 351

VARIANCE OF PROJECT COMPLETION TIME = 34528.5

12. PROJECT SCHEDULING WITH PERT/CPM

********************************
Page 14
PERT-ALLFILES

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 0 1 3
B - 0 4 5
C A 10 11 13
D B,C 12 15 18
E B,D 9 13 16
F E 11 15 19
G - 10 14 20
H C,G 15 16 17
I D 18 29 40
J I 1 2 3
K E,J 5 10 17
L I,J,K 2 2 10
M A,D,G,I,K,L 16 18 20
N G,J,M 8 9 13
O G,L,N 8 16 24
P C,F,H,K,M,O 7 20 21
Q A,C,G,K,N,P 5 6 7
R A,B 15 16 18
S D,H,M,P,R 8 9 23
T Q,R,S 6 8 10
U G,L,P 14 22 23
V A,M,T 28 32 35
W P,Q,R,S,V 11 50 100
X G,L,T,W 11 19 28
Y A,D,P,T,X 15 15 25
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 1.17 0.25
B 3.50 0.69
C 11.17 0.25
Page 15
PERT-ALLFILES
D 15.00 1.00
E 12.83 1.36
F 15.00 1.78
G 14.33 2.78
H 16.00 0.11
I 29.00 13.44
J 2.00 0.11
K 10.33 4.00
L 3.33 1.78
M 18.00 0.44
N 9.50 0.69
O 16.00 7.11
P 18.00 5.44
Q 6.00 0.11
R 16.17 0.25
S 11.17 6.25
T 8.00 0.44
U 20.83 2.25
V 31.83 1.36
W 51.83 220.03
X 19.17 8.03
Y 16.67 2.78
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 1.17 1.17 0.00 YES

B 0.00 8.83 3.50 12.33 8.83
C 1.17 1.17 12.33 12.33 0.00 YES
D 12.33 12.33 27.33 27.33 0.00 YES

E 27.33 45.50 40.17 58.33 18.17

F 40.17 100.50 55.17 115.50 60.33
G 0.00 57.67 14.33 72.00 57.67
H 14.33 99.50 30.33 115.50 85.17

I 27.33 27.33 56.33 56.33 0.00 YES

J 56.33 56.33 58.33 58.33 0.00 YES
K 58.33 58.33 68.67 68.67 0.00 YES
L 68.67 68.67 72.00 72.00 0.00 YES
M 72.00 72.00 90.00 90.00 0.00 YES
N 90.00 90.00 99.50 99.50 0.00 YES
O 99.50 99.50 115.50 115.50 0.00 YES
P 115.50 115.50 133.50 133.50 0.00 YES
Page 16
PERT-ALLFILES
Q 133.50 138.67 139.50 144.67 5.17
R 3.50 117.33 19.67 133.50 113.83
S 133.50 133.50 144.67 144.67 0.00 YES
T 144.67 144.67 152.67 152.67 0.00 YES

U 133.50 251.33 154.33 272.17 117.83

V 152.67 152.67 184.50 184.50 0.00 YES
W 184.50 184.50 236.33 236.33 0.00 YES
X 236.33 236.33 255.50 255.50 0.00 YES
Y 255.50 255.50 272.17 272.17 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-Y

EXPECTED PROJECT COMPLETION TIME = 272.17

VARIANCE OF PROJECT COMPLETION TIME = 3.03

13. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 10.00 10.10 10.20
B - 15.00 15.20 15.30
C B 20.00 20.30 20.50
D A,B,C 30.00 30.40 30.60
E B,C,D 40.00 40.40 40.80
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 10.10 0.00
B 15.18 0.00
C 20.28 0.01
D 30.37 0.01
Page 17
PERT-ALLFILES
E 40.40 0.02
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 25.37 10.10 35.47 25.37

B 0.00 0.00 15.18 15.18 0.00 YES
C 15.18 15.18 35.47 35.47 0.00 YES
D 35.47 35.47 65.83 65.83 0.00 YES
E 65.83 65.83 106.23 106.23 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: B-E

EXPECTED PROJECT COMPLETION TIME = 106.23

VARIANCE OF PROJECT COMPLETION TIME = 0.02

14. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 10 10 12
B A 12 14 15
C A,B 12 13 15
D A,B,C 13 14 17
E A,B,C,D 14 15 15
F A,B,C,D,E 15 16 18
G A,B,C,D,E,F 16 17 17
H A,B,C,D,E,F,G 17 19 21
I A,B,C,D,E,F,G,H 18 20 22
J A,B,C,D,E,F,G,H,I 19 19 21
K A,B,C,D,E,F,G,H,I,J 20 21 22
Page 18
PERT-ALLFILES
L A,B,C,D,E,F,G,H,I,J,K 22 23 24
M A,B,C,D,E,F,G,H,I,J,K,L 20 20 23
N A,B,C,D,E,F,G,H,I,J,K,L,M 12 15 18
OA,B,C,D,E,F,G,H,I,J,K,L,M,N 13 14 17
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 10.33 0.11
B 13.83 0.25
C 13.17 0.25
D 14.33 0.44
E 14.83 0.03
F 16.17 0.25
G 16.83 0.03
H 19.00 0.44
I 20.00 0.44
J 19.33 0.11
K 21.00 0.11
L 23.00 0.11
M 20.50 0.25
N 15.00 1.00
O 14.33 0.44
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 10.33 10.33 0.00 YES

B 10.33 10.33 24.17 24.17 0.00 YES
C 24.17 24.17 37.33 37.33 0.00 YES
D 37.33 37.33 51.67 51.67 0.00 YES
E 51.67 51.67 66.50 66.50 0.00 YES
F 66.50 66.50 82.67 82.67 0.00 YES
G 82.67 82.67 99.50 99.50 0.00 YES

Page 19
PERT-ALLFILES
H 99.50 99.50 118.50 118.50 0.00 YES
I 118.50 118.50 138.50 138.50 0.00 YES
J 138.50 138.50 157.83 157.83 0.00 YES
K 157.83 157.83 178.83 178.83 0.00 YES
L 178.83 178.83 201.83 201.83 0.00 YES
M 201.83 201.83 222.33 222.33 0.00 YES
N 222.33 222.33 237.33 237.33 0.00 YES
O 237.33 237.33 251.67 251.67 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-O

EXPECTED PROJECT COMPLETION TIME = 251.67

VARIANCE OF PROJECT COMPLETION TIME = 0.56

15. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 10 10 10
B - 10 10 10
C A 10 10 10
D C 10 10 10
E A,B,C,D 10 10 10
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 10 0.00
B 10 0.00
C 10 0.00
D 10 0.00
E 10 0.00
Page 20
PERT-ALLFILES
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 10 10 0 YES
B 0 20 10 30 20
C 10 10 20 20 0 YES
D 20 20 30 30 0 YES
E 30 30 40 40 0 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-E

EXPECTED PROJECT COMPLETION TIME = 40

VARIANCE OF PROJECT COMPLETION TIME = 0

16. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 1 1 3
B A 3 4 12
C B 1 9 11
D C 12 13 20
E D 9 16 24
F E 1 2 5
G F 9 11 13
H G 11 14 16
I H 10 13 17
J I 0 0 10
K J 1 10 20
L K 1 5 17
Page 21
PERT-ALLFILES
M L 0 0 0
N M 7 19 20
O N 6 7 10
P O 5 16 29
Q P 14 28 39
R Q 1 10 30
S R 1 1 16
T S 2 8 12
U T 5 9 14
V U 2 2 2
W V 8 8 8
X W 4 6 8
Y X 10 12 19
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 1.33 0.11
B 5.17 2.25
C 8.00 2.78
D 14.00 1.78
E 16.17 6.25
F 2.33 0.44
G 11.00 0.44
H 13.83 0.69
I 13.17 1.36
J 1.67 2.78
K 10.17 10.03
L 6.33 7.11
M 0.00 0.00
N 17.17 4.69
O 7.33 0.44
P 16.33 16.00
Q 27.50 17.36
R 11.83 23.36
S 3.50 6.25
T 7.67 2.78
U 9.17 2.25
V 2.00 0.00
W 8.00 0.00
Page 22
PERT-ALLFILES
X 6.00 0.44
Y 12.83 2.25
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 1.33 1.33 0.00 YES

B 1.33 1.33 6.50 6.50 0.00 YES
C 6.50 6.50 14.50 14.50 0.00 YES
D 14.50 14.50 28.50 28.50 0.00 YES
E 28.50 28.50 44.67 44.67 0.00 YES
F 44.67 44.67 47.00 47.00 0.00 YES
G 47.00 47.00 58.00 58.00 0.00 YES
H 58.00 58.00 71.83 71.83 0.00 YES
I 71.83 71.83 85.00 85.00 0.00 YES
J 85.00 85.00 86.67 86.67 0.00 YES
K 86.67 86.67 96.83 96.83 0.00 YES
L 96.83 96.83 103.17 103.17 0.00 YES
M 103.17 103.17 103.17 103.17 0.00 YES
N 103.17 103.17 120.33 120.33 0.00 YES
O 120.33 120.33 127.67 127.67 0.00 YES
P 127.67 127.67 144.00 144.00 0.00 YES
Q 144.00 144.00 171.50 171.50 0.00 YES
R 171.50 171.50 183.33 183.33 0.00 YES
S 183.33 183.33 186.83 186.83 0.00 YES
T 186.83 186.83 194.50 194.50 0.00 YES
U 194.50 194.50 203.67 203.67 0.00 YES
V 203.67 203.67 205.67 205.67 0.00 YES
W 205.67 205.67 213.67 213.67 0.00 YES
X 213.67 213.67 219.67 219.67 0.00 YES
Y 219.67 219.67 232.50 232.50 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y

EXPECTED PROJECT COMPLETION TIME = 232.5

VARIANCE OF PROJECT COMPLETION TIME = 111.86

Page 23
PERT-ALLFILES
17. PROJECT SCHEDULING WITH PERT/CPM
********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 1 1 1
B A 1 1 1
C A,B 1 1 1
D B,C 1 1 1
E B,C,D 1 1 1
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 1 0.00
B 1 0.00
C 1 0.00
D 1 0.00
E 1 0.00
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0 0 1 1 0 YES
B 1 1 2 2 0 YES
C 2 2 3 3 0 YES
D 3 3 4 4 0 YES
E 4 4 5 5 0 YES

----------------------------------------------------------------------------

Page 24
PERT-ALLFILES
CRITICAL PATH: A-B-E

EXPECTED PROJECT COMPLETION TIME = 5

VARIANCE OF PROJECT COMPLETION TIME = 0

18. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 1.0 8.0 12.0
B A 5.0 9.0 13.0
C B 0.5 1.5 2.5
D B,C 6.0 7.0 19.0
E B,C,D 5.5 6.0 9.5
F C,D,E 7.5 9.5 11.5
G D,E,F 10.0 10.5 11.0
H B,F 12.0 12.5 13.5
I A,G,H 1.5 1.5 1.5
J C,G,I 18.5 20.0 21.5
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 7.50 3.36
B 9.00 1.78
C 1.50 0.11
D 8.83 4.69
E 6.50 0.44
F 9.50 0.44
G 10.50 0.03
H 12.58 0.06
I 1.50 0.00
J 20.00 0.25
-------------------------------------------

Page 25
PERT-ALLFILES

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 7.50 7.50 0.00 YES

B 7.50 7.50 16.50 16.50 0.00 YES
C 16.50 16.50 18.00 18.00 0.00 YES
D 18.00 18.00 26.83 26.83 0.00 YES
E 26.83 26.83 33.33 33.33 0.00 YES
F 33.33 33.33 42.83 42.83 0.00 YES

G 42.83 44.92 53.33 55.42 2.08

H 42.83 42.83 55.42 55.42 0.00 YES
I 55.42 55.42 56.92 56.92 0.00 YES
J 56.92 56.92 76.92 76.92 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: A-B-C-J

EXPECTED PROJECT COMPLETION TIME = 76.92

VARIANCE OF PROJECT COMPLETION TIME = 5.5

19. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 1.4 8.9 11.5
B - 2.5 3.9 13.8
C - 10.5 21.5 62.5
D A,C 16.5 27.8 39.1
E C,D 15.5 36.5 59.5
F A,E 27.5 49.5 71.5
G A,F 9.1 10.2 11.3
H A,E,G 12.9 13.0 13.1
I C,E,G,H 41.5 51.5 61.5
Page 26
PERT-ALLFILES
J C,G,I 9.5 11.5 15.5
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 8.08 2.83
B 5.32 3.55
C 26.50 75.11
D 27.80 14.19
E 36.83 53.78
F 49.50 53.78
G 10.20 0.13
H 13.00 0.00
I 51.50 11.11
J 11.83 1.00
-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 18.42 8.08 26.50 18.42

B 0.00 221.85 5.32 227.17 221.85

C 0.00 0.00 26.50 26.50 0.00 YES

D 26.50 26.50 54.30 54.30 0.00 YES
E 54.30 54.30 91.13 91.13 0.00 YES
F 91.13 91.13 140.63 140.63 0.00 YES
G 140.63 140.63 150.83 150.83 0.00 YES
H 150.83 150.83 163.83 163.83 0.00 YES
I 163.83 163.83 215.33 215.33 0.00 YES
J 215.33 215.33 227.17 227.17 0.00 YES

----------------------------------------------------------------------------

CRITICAL PATH: C-J

EXPECTED PROJECT COMPLETION TIME = 227.17

Page 27
PERT-ALLFILES
VARIANCE OF PROJECT COMPLETION TIME = 76.11

20. PROJECT SCHEDULING WITH PERT/CPM

********************************

* PROJECT ACTIVITY LIST *

IMMEDIATE OPTIMISTIC MOST PROBABLE PESSIMISTIC

ACTIVITY PREDECESSORS TIME TIME TIME
-------------------------------------------------------------------------
A - 10.5 12.4 13.1
B A 11.5 23.4 33.6
C B 110.5 221.5 316.3
D B,C 216.5 227.8 339.1
E C,D 115.5 236.5 259.5
F D,E 127.5 149.5 171.5
G D,E,F 29.1 30.2 41.3
H C,F,G 112.9 113.8 213.1
I F,G,H 241.5 251.5 261.5
J F,I 19.5 21.5 35.5
-----------------------------------------------------------------------------

EXPECTED TIMES AND VARIANCES FOR ACTIVITIES

ACTIVITY EXPECTED TIME VARIANCE

-------------------------------------------
A 12.20 0.19
B 23.12 13.57
C 218.80 1176.49
D 244.47 417.52
E 220.17 576.00
F 149.50 53.78
G 31.87 4.13
H 130.20 278.89
I 251.50 11.11
J 23.50 7.11

-------------------------------------------

* ACTIVITY SCHEDULE *

EARLIEST LATEST EARLIEST LATEST CRITICAL

Page 28
PERT-ALLFILES
ACTIVITY START START FINISH FINISH SLACK ACTIVITY
-----------------------------------------------------------------------------

A 0.00 0.00 12.20 12.20 0.00 YES

B 12.20 12.20 35.32 35.32 0.00 YES
C 35.32 35.32 254.12 254.12 0.00 YES
D 254.12 254.12 498.58 498.58 0.00 YES
E 498.58 498.58 718.75 718.75 0.00 YES
F 718.75 718.75 868.25 868.25 0.00 YES
G 868.25 868.25 900.12 900.12 0.00 YES
H 900.12 900.12 1030.32 1030.32 0.00 YES
I 1030.32 1030.32 1281.82 1281.82 0.00 YES
J 1281.82 1281.82 1305.32 1305.32 0.00 YES
----------------------------------------------------------------------------

CRITICAL PATH: A-B-D-F-J

EXPECTED PROJECT COMPLETION TIME = 1305.32

VARIANCE OF PROJECT COMPLETION TIME = 492.16

Page 29
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 17:24:50

Module/submodel: Project Management (PERT/CPM)/Single time estimate

Problem title: (untitled)
Method: Single time estimate
Network type: Immediate predecessor list

Results ----------

Activity Precedences
A
B A
C B
D C, A
E D, B, A

Project completion time = 65

Activity Early Early Late

time Start Finish Late Start Finish Slack
-------------------------------------------------------------------------------
A 10 0 10 0 10 0
B 12 10 22 10 22 0
C 14 22 36 22 36 0
D 16 36 52 36 52 0
E 13 52 65 52 65 0

(untitled)
Gantt chart (Early times)

10
A

ES EF
22
B

36
C

52
D

65
E

Critical
1 3 5 7 9 11 14 17 20 23 26 29 32 35 38 41 44 47 50 53 56 59 62 65
Time
(untitled)
Gantt chart (Late times)

10
A

22
B

36
C

52 LS LF
D

65
E

Critical
1 3 5 7 9 11 14 17 20 23 26 29 32 35 38 41 44 47 50 53 56 59 62 65
Time
(untitled)
Gantt chart (Early and Late times)

A 10

10
ES EF
B 22

C 36

36
LS LF
D 52

E 65

Critical
1 3 5 7 9 11 14 17 20 23 26 29 32 35 38 41 44 47 50 53 56 59 62 65
Time
(untitled)
Precedence Graph

12 14 16 13

B C D E

A
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 17:57:29

Module/submodel: Project Management (PERT/CPM)/Triple time estimate

Problem title: (untitled)
Method: Triple time estimate
Network type: Immediate predecessor list

Results ----------

Activity Precedences
A
B A
C A, B
D A, C
E D, C

Project completion time = 23.16667

Project standard deviation = .83

Activity Early Early Late Standard

time Start Finish Late Start Finish Slack Deviation
------------------------------------------------------------------------------------------
A 2 0 2 0 2 0 .33
B 6.17 2 8.17 2 8.17 0 .5
C 3 8.17 11.17 8.17 11.17 0 .33
D 4 11.17 15.17 11.17 15.17 0 .33
E 8 15.17 23.17 15.17 23.17 0 .33

Activity time computations ----------

Optimistic MostPessimistic Activity Standard

Activity timeLikely time time time deviation Variance
-------------------------------------------------------------------------------
A 1 2 3 2 .33 .11
B 5 6 8 6.17 .5 .25
C 2 3 4 3 .33 .11
D 3 4 5 4 .33 .11
E 7 8 9 8 .33 .11
Project resu
Sum of crit .69
Sq root of s .83
(untitled)
Gantt chart (Early times)

2
A

ES EF
8.166666
B

11.16667
C

15.16667
D

23.16667
E

Critical
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
Time

(untitled)
Gantt chart (Late times)

2
A

8.166666
B

11.16667
C

15.16667 LS LF
D

23.16667
E

Critical
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
Time
(untitled)
Gantt chart (Early and Late times)

A 2

2
ES EF
B 8.166666

8.166666

C 11.16667

11.16667
LS LF
D 15.16667

15.16667

E 23.16667

23.16667

Critical
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
Time
(untitled)
Precedence Graph

6.17 3 4 8

B C D E

A
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 18:03:33

Module/submodel: Project Management (PERT/CPM)/Crashing

Problem title: (untitled)
Method: Crashing
Network type: Start/end node numbers

Results ----------

Project completion time = 90

Normal cost = 174

Minimum project completion time = 64

Crash cost = 80

Normal Normal Crash

Start node End node time Crash time Cost Crash Cost cost/pd Crash by
-----------------------------------------------------------------------------------------------------
A 1 2 11 10 24 35 11 1
B 2 3 14 4 26 46 2 10
C 3 4 17 6 38 47 .82 11
D 4 5 23 16 41 48 1 7
E 5 6 25 28 45 78 -11 -3
-----------------------------------------------------------------------------------------------------
TOTALS 174 0

Crashing
cost
------------------------
A 11
B 20
C 9
D 7
E 33
------------------------
TOTALS 80

Crash schedule ----------

Project Period Cumltv

time cost cost A B C D E
---------------------------------------------------------------------------------------
90 33 33
89 3.27 36.27 4
88 .82 37.09 5
87 .82 37.91 6
86 .82 38.73 7
85 .82 39.55 8
84 .82 40.36 9
83 .82 41.18 10
82 .82 42 11
81 1 43 11 1
80 1 44 11 2
79 1 45 11 3
78 1 46 11 4
77 1 47 11 5
76 1 48 11 6
75 1 49 11 7
74 2 51 1 11 7
73 2 53 2 11 7
72 2 55 3 11 7
71 2 57 4 11 7
70 2 59 5 11 7
69 2 61 6 11 7
68 2 63 7 11 7
67 2 65 8 11 7
66 2 67 9 11 7
65 2 69 10 11 7
64 11 80 1 10 11 7
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 18:05:49

Module/submodel: Project Management (PERT/CPM)/Cost Budgeting

Problem title: (untitled)
Method: Cost Budgeting
Network type: Start/end node numbers

Results ----------

Project completion time = 111

Activity Activity Early Early Late

Start node End node time Cost Start Finish Late Start Finish
-----------------------------------------------------------------------------------------------------
A 1 3 11 12 0 11 100 111
B 2 4 23 15 0 23 0 23
C 4 6 35 23 23 58 23 58
D 5 6 44 34 0 44 14 58
E 6 8 53 56 58 111 58 111

Slack
------------------------
A 100
B 0
C 0
D 14
E 0

Early Start Budget ----------

Period 1 Period 2 Period 3 Period 4 Period 5 Period 6 Period 7

--------------------------------------------------------------------------------------------
A 1.09 1.09 1.09 1.09 1.09 1.09 1.09
B .65 .65 .65 .65 .65 .65 .65
C
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 2.52 2.52 2.52 2.52 2.52 2.52 2.52
Cum budget 2.52 5.03 7.55 10.06 12.58 15.09 17.61

Period 8 Period 9 Period 10 Period 11 Period 12 Period 13 Period 14

--------------------------------------------------------------------------------------------
A 1.09 1.09 1.09 1.09
B .65 .65 .65 .65 .65 .65 .65
C
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 2.52 2.52 2.52 2.52 1.42 1.42 1.42
Cum budget 20.13 22.64 25.16 27.67 29.1 30.52 31.95

Period 15 Period 16 Period 17 Period 18 Period 19 Period 20 Period 21

--------------------------------------------------------------------------------------------
A
B .65 .65 .65 .65 .65 .65 .65
C
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 1.42 1.42 1.42 1.42 1.42 1.42 1.42
Cum budget 33.37 34.8 36.22 37.65 39.07 40.5 41.92

Period 22 Period 23 Period 24 Period 25 Period 26 Period 27 Period 28

--------------------------------------------------------------------------------------------
A
B .65 .65
C .66 .66 .66 .66 .66
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 1.42 1.42 1.43 1.43 1.43 1.43 1.43
Cum budget 43.35 44.77 46.2 47.63 49.06 50.49 51.92

Period 29 Period 30 Period 31 Period 32 Period 33 Period 34 Period 35

--------------------------------------------------------------------------------------------
A
B
C .66 .66 .66 .66 .66 .66 .66
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 1.43 1.43 1.43 1.43 1.43 1.43 1.43
Cum budget 53.35 54.78 56.21 57.64 59.07 60.5 61.93

Period 36 Period 37 Period 38 Period 39 Period 40 Period 41 Period 42

Period 43 Period 44 Period 45 Period 46 Period 47 Period 48 Period 49

--------------------------------------------------------------------------------------------
A
B
C .66 .66 .66 .66 .66 .66 .66
D .77 .77
E
Period budget 1.43 1.43 .66 .66 .66 .66 .66
Cum budget 73.37 74.8 75.46 76.11 76.77 77.43 78.09

Period 50 Period 51 Period 52 Period 53 Period 54 Period 55 Period 56

--------------------------------------------------------------------------------------------
A
B
C .66 .66 .66 .66 .66 .66 .66
D
E
Period budget .66 .66 .66 .66 .66 .66 .66
Cum budget 78.74 79.4 80.06 80.71 81.37 82.03 82.69

Period 57 Period 58 Period 59 Period 60 Period 61 Period 62 Period 63

--------------------------------------------------------------------------------------------
A
B
C .66 .66
D
E 1.06 1.06 1.06 1.06 1.06
Period budget .66 .66 1.06 1.06 1.06 1.06 1.06
Cum budget 83.34 84 85.06 86.11 87.17 88.23 89.28

Period 64 Period 65 Period 66 Period 67 Period 68 Period 69 Period 70

Period 71 Period 72 Period 73 Period 74 Period 75 Period 76 Period 77

--------------------------------------------------------------------------------------------
A
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Cum budget 97.74 98.79 99.85 100.91 101.96 103.02 104.08
Period 78 Period 79 Period 80 Period 81 Period 82 Period 83 Period 84
--------------------------------------------------------------------------------------------
A
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Cum budget 105.13 106.19 107.25 108.3 109.36 110.42 111.47

Period 85 Period 86 Period 87 Period 88 Period 89 Period 90 Period 91

Period 92 Period 93 Period 94 Period 95 Period 96 Period 97 Period 98

Period 99 Period 100 Period 101 Period 102 Period 103 Period 104 Period 105
--------------------------------------------------------------------------------------------
A
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Cum budget 127.32 128.38 129.43 130.49 131.55 132.6 133.66

Period 106 Period 107 Period 108 Period 109 Period 110 Period 111
---------------------------------------------------------------------------------
A
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 1.06 1.06 1.06 1.06 1.06 1.06
Cum budget 134.72 135.77 136.83 137.89 138.94 140

Late Start Budget ----------

Period 1 Period 2 Period 3 Period 4 Period 5 Period 6 Period 7

Period 8 Period 9 Period 10 Period 11 Period 12 Period 13 Period 14

--------------------------------------------------------------------------------------------
A
B .65 .65 .65 .65 .65 .65 .65
C
D
E
Period budget .65 .65 .65 .65 .65 .65 .65
Cum budget 5.22 5.87 6.52 7.17 7.83 8.48 9.13
Period 15 Period 16 Period 17 Period 18 Period 19 Period 20 Period 21
--------------------------------------------------------------------------------------------
A
B .65 .65 .65 .65 .65 .65 .65
C
D .77 .77 .77 .77 .77 .77 .77
E
Period budget 1.42 1.42 1.42 1.42 1.42 1.42 1.42
Cum budget 10.56 11.98 13.41 14.83 16.25 17.68 19.1

Period 22 Period 23 Period 24 Period 25 Period 26 Period 27 Period 28

Period 29 Period 30 Period 31 Period 32 Period 33 Period 34 Period 35

Period 36 Period 37 Period 38 Period 39 Period 40 Period 41 Period 42

Period 43 Period 44 Period 45 Period 46 Period 47 Period 48 Period 49

Period 50 Period 51 Period 52 Period 53 Period 54 Period 55 Period 56

Period 57 Period 58 Period 59 Period 60 Period 61 Period 62 Period 63

--------------------------------------------------------------------------------------------
A
B
C .66 .66
D .77 .77
E 1.06 1.06 1.06 1.06 1.06
Period budget 1.43 1.43 1.06 1.06 1.06 1.06 1.06
Cum budget 70.57 72 73.06 74.11 75.17 76.23 77.28

Period 64 Period 65 Period 66 Period 67 Period 68 Period 69 Period 70

Period 71 Period 72 Period 73 Period 74 Period 75 Period 76 Period 77

Period 78 Period 79 Period 80 Period 81 Period 82 Period 83 Period 84

Period 85 Period 86 Period 87 Period 88 Period 89 Period 90 Period 91

Period 92 Period 93 Period 94 Period 95 Period 96 Period 97 Period 98

Period 99 Period 100 Period 101 Period 102 Period 103 Period 104 Period 105
--------------------------------------------------------------------------------------------
A 1.09 1.09 1.09 1.09 1.09
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 1.06 1.06 2.15 2.15 2.15 2.15 2.15
Cum budget 115.32 116.38 118.52 120.67 122.82 124.97 127.11

Period 106 Period 107 Period 108 Period 109 Period 110 Period 111
---------------------------------------------------------------------------------
A 1.09 1.09 1.09 1.09 1.09 1.09
B
C
D
E 1.06 1.06 1.06 1.06 1.06 1.06
Period budget 2.15 2.15 2.15 2.15 2.15 2.15
Cum budget 129.26 131.41 133.56 135.7 137.85 140
(untitled)
Gantt chart (Early times)

11
A

ES EF
23
B

58
C

44
D

111
E

Critical
1 4 7 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 107
Time

(untitled)
Gantt chart (Late times)

111
A

23
B

58
C

58 LS LF
D

111
E

Critical
1 4 7 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 107
Time
(untitled)
Gantt chart (Early and Late times)

A 11

111
ES EF
B 23

C 58

58
LS LF
D 44

E 111

111

Critical
1 4 7 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 107
Time
(untitled)
Precedence Graph

11.
1 3

53.
2 6 8

23. 44. 35.

5 4
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 18:08:29

Module/submodel: Project Management (PERT/CPM)/Mean, Std dev given

Problem title: (untitled)
Method: Mean, Std dev given
Network type: Start/end node numbers

Results ----------

Project completion time = 136

Project standard deviation = 17.15

Activity Early Early Late

Start node End node time Start Finish Late Start Finish Slack
-----------------------------------------------------------------------------------------------------
A 1 4 12 0 12 0 12 0
B 2 3 32 0 32 104 136 104
C 4 7 53 12 65 12 65 0
D 5 8 62 0 62 74 136 74
E 7 9 71 65 136 65 136 0

Standard
Deviation
------------------------
A 5
B 12
C 10
D 9
E 13

(untitled)
Gantt chart (Early times)

12
A

ES EF
32
B

65
C

62
D

136
E

Critical
1 5 9 13 19 25 31 37 43 49 55 61 67 73 79 85 91 97 103 111 119 127 135
Time
(untitled)
Gantt chart (Late times)

12
A

136
B

65
C

LS
136 LF
D

136
E

Critical
1 5 9 13 19 25 31 37 43 49 55 61 67 73 79 85 91 97 103 111 119 127 135
Time
(untitled)
Gantt chart (Early and Late times)

A 12

12
ES EF
B 32

136

C 65

65
LS LF
D 62

136

E 136

136

Critical
1 5 9 13 19 25 31 37 43 49 55 61 67 73 79 85 91 97 103 111 119 127 135
Time
(untitled)
Precedence Graph

STATE PROBABILITY
***** ***********

1 0.189
2 0.040
3 0.121
4 0.042
5 0.088
6 0.057
7 0.166
8 0.104
9 0.079
10 0.115

Page 7
WAITING LINES

1. WAITING LINES
*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 0.5

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 1 PER CHANNEL

COST FOR UNITS IN THE SYSTEM = $8 PER TIME PERIOD

COST FOR A CHANNEL = $7 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.6000

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0333

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.5333

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0667

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 1.0667

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.1000

THE TOTAL COST PER TIME PERIOD $18.27

Number of Units in the System Probability

----------------------------- -----------

0 0.6000

1 0.3000

2 0.0750

3 0.0188

Page 1
WAITLINE-ALLFILES
4 OR MORE 0.0063

2. WAITING LINES
*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 15

ARBITRARY SERVICE TIMES WITH MEAN RATE = 18

STANDARD DEVIATION FOR THE SERVICE TIME = 0.2

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

COST FOR A CHANNEL = $6 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.1667

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 29.0833

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 29.9167

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 1.9389

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 1.9944

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.8333

THE TOTAL COST PER TIME PERIOD $305.17

OR MORE

3. WAITING LINES
*************

NUMBER OF CHANNELS = 1
Page 2
WAITLINE-ALLFILES

POISSON ARRIVALS WITH MEAN RATE = 10

DETERMINISTIC SERVICE TIMES WITH MEAN RATE = 13

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

COST FOR A CHANNEL = $3 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.2308

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 1.2821

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 2.0513

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.1282

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.2051

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.7692

THE TOTAL COST PER TIME PERIOD $13.26

4. WAITING LINES
*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 7

DETERMINISTIC SERVICE TIMES WITH MEAN RATE = 9

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

COST FOR A CHANNEL = $2 PER TIME PERIOD

OPERATING CHARACTERISTICS
Page 3
WAITLINE-ALLFILES
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.2222

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 1.3611

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 2.1389

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.1944

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.3056

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.7778

THE TOTAL COST PER TIME PERIOD $12.69

OR MORE

5. WAITING LINES
*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 4

DETERMINISTIC SERVICE TIMES WITH MEAN RATE = 6

COST FOR UNITS IN THE SYSTEM = $15 PER TIME PERIOD

COST FOR A CHANNEL = $12 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.3333

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.6667

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.3333

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.1667

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.3333

Page 4
WAITLINE-ALLFILES

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.6667

THE TOTAL COST PER TIME PERIOD $32.00

6. WAITING LINES
*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 16

DETERMINISTIC SERVICE TIMES WITH MEAN RATE = 17

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

COST FOR A CHANNEL = $6 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0588

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 7.5294

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 8.4706

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.4706

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.5294

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.9412

THE TOTAL COST PER TIME PERIOD $90.71

7. WAITING LINES
*************

NUMBER OF CHANNELS = 1
Page 5
WAITLINE-ALLFILES

POISSON ARRIVALS WITH MEAN RATE = 14

DETERMINISTIC SERVICE TIMES WITH MEAN RATE = 17

COST FOR UNITS IN THE SYSTEM = $9 PER TIME PERIOD

COST FOR A CHANNEL = $5 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.1765

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 1.9216

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 2.7451

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.1373

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.1961

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.8235

THE TOTAL COST PER TIME PERIOD $29.71

8. WAITING LINES
*************

NUMBER OF CHANNELS = 3

POISSON ARRIVALS WITH MEAN RATE = 5

ARBITRARY SERVICE TIMES WITH MEAN RATE = 4

NO WAITING LINE (BLOCKED CUSTOMERS CLEARED)

OPERATING CHARACTERISTICS
-------------------------

Page 6
WAITLINE-ALLFILES
THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.2979

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.1288

THE PROBABILITY THAT AN ARRIVING UNIT IS BLOCKED 0.0970

Number of Channels Busy Probability

----------------------- -----------

0 0.2979

1 0.3724

2 0.2327

3 0.0970

9. WAITING LINES
*************

NUMBER OF CHANNELS = 3

POISSON ARRIVALS WITH MEAN RATE = 3

ARBITRARY SERVICE TIMES WITH MEAN RATE = 4

NO WAITING LINE (BLOCKED CUSTOMERS CLEARED)

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.4758

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.7249

THE PROBABILITY THAT AN ARRIVING UNIT IS BLOCKED 0.0335

Number of Channels Busy Probability

Page 7
WAITLINE-ALLFILES
----------------------- -----------

0 0.4758

1 0.3569

2 0.1338

3 0.0335

10. WAITING LINES

*************

NUMBER OF CHANNELS = 4

POISSON ARRIVALS WITH MEAN RATE = 15

ARBITRARY SERVICE TIMES WITH MEAN RATE = 12

NO WAITING LINE (BLOCKED CUSTOMERS CLEARED)

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.2891

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.2132

THE PROBABILITY THAT AN ARRIVING UNIT IS BLOCKED 0.0294

Number of Channels Busy Probability

----------------------- -----------

0 0.2891

1 0.3614

2 0.2259

3 0.0941
Page 8
WAITLINE-ALLFILES

4 0.0294

11. WAITING LINES

*************

NUMBER OF CHANNELS = 5

POISSON ARRIVALS WITH MEAN RATE = 22

ARBITRARY SERVICE TIMES WITH MEAN RATE = 25

NO WAITING LINE (BLOCKED CUSTOMERS CLEARED)

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.4149

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.8784

THE PROBABILITY THAT AN ARRIVING UNIT IS BLOCKED 0.0018

Number of Channels Busy Probability

----------------------- -----------

0 0.4149

1 0.3651

2 0.1607

3 0.0471

4 0.0104

5 0.0018

Page 9
WAITLINE-ALLFILES

12. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 0.65

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 1.2 PER CHANNEL

COST FOR UNITS IN THE SYSTEM = $9 PER TIME PERIOD

COST FOR A CHANNEL = $6 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.5738

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0429

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.5845

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0660

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.8993

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.1154

THE TOTAL COST PER TIME PERIOD $17.26

Number of Units in the System Probability

----------------------------- -----------

0 0.5738

1 0.3108

2 0.0842

3 0.0228

4 OR MORE 0.0085

Page 10
WAITLINE-ALLFILES

13. WAITING LINES

*************

NUMBER OF CHANNELS = 3

POISSON ARRIVALS WITH MEAN RATE = 21

ARBITRARY SERVICE TIMES WITH MEAN RATE = 20

NO WAITING LINE (BLOCKED CUSTOMERS CLEARED)

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.3579

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.9775

THE PROBABILITY THAT AN ARRIVING UNIT IS BLOCKED 0.0690

Number of Channels Busy Probability

----------------------- -----------

0 0.3579

1 0.3758

2 0.1973

3 0.0690

14. WAITING LINES

*************

NUMBER OF CHANNELS = 3

POISSON ARRIVALS WITH MEAN RATE = 10

Page 11
WAITLINE-ALLFILES

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 12 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 6

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

COST FOR A CHANNEL = $9 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0225

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.5581

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 3.0317

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0188

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.1021

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.6309

THE TOTAL COST PER TIME PERIOD $57.32

Number of Units in the System Probability

----------------------------- -----------

0 0.0225

1 0.1124

2 0.2342

3 0.2602

4 0.2168

5 0.1205

6 0.0335

Page 12
WAITLINE-ALLFILES

15. WAITING LINES

*************

NUMBER OF CHANNELS = 4

POISSON ARRIVALS WITH MEAN RATE = 12

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 14 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 6

COST FOR UNITS IN THE SYSTEM = $12 PER TIME PERIOD

COST FOR A CHANNEL = $7 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0238

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.1178

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 2.8327

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0031

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.0745

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.2926

THE TOTAL COST PER TIME PERIOD $61.99

Number of Units in the System Probability

----------------------------- -----------

0 0.0238

1 0.1223

2 0.2620

3 0.2994
Page 13
WAITLINE-ALLFILES

4 0.1925

5 0.0825

6 0.0177

16. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 11

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 16 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 8

COST FOR UNITS IN THE SYSTEM = $9 PER TIME PERIOD

COST FOR A CHANNEL = $4 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0035

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 3.1552

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 5.1290

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0999

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.1624

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.9773

THE TOTAL COST PER TIME PERIOD $54.16

Number of Units in the System Probability

----------------------------- -----------
Page 14
WAITLINE-ALLFILES

0 0.0035

1 0.0192

2 0.0462

3 0.0953

4 0.1638

5 0.2252

6 0.2322

7 0.1597

8 0.0549

17. WAITING LINES

*************

NUMBER OF CHANNELS = 5

POISSON ARRIVALS WITH MEAN RATE = 21

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 26 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 7

COST FOR UNITS IN THE SYSTEM = $19 PER TIME PERIOD

COST FOR A CHANNEL = $11 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0157

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0485

Page 15
WAITLINE-ALLFILES
THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 3.1545

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0006

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.0391

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.1560

THE TOTAL COST PER TIME PERIOD $114.94

Number of Units in the System Probability

----------------------------- -----------

0 0.0157

1 0.0889

2 0.2153

3 0.2899

4 0.2341

5 0.1135

6 0.0367

7 0.0059

18. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 11

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 6 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 4

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

COST FOR A CHANNEL = $5 PER TIME PERIOD

Page 16
WAITLINE-ALLFILES

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0101

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 1.0543

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 2.9603

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0922

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.2589

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.9161

THE TOTAL COST PER TIME PERIOD $39.60

Number of Units in the System Probability

----------------------------- -----------

0 0.0101

1 0.0738

2 0.2030

3 0.3721

4 0.3411

19. WAITING LINES

*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 4

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 5

FINITE CALLING POPULATION OF SIZE = 3

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

Page 17
WAITLINE-ALLFILES

COST FOR A CHANNEL = $1 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0970

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.9682

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.8712

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.2144

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.4144

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.9030

THE TOTAL COST PER TIME PERIOD $10.36

Number of Units in the System Probability

----------------------------- -----------

0 0.0970

1 0.2327

2 0.3724

3 0.2979

20. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 10

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 6 PER CHANNEL

FINITE CALLING POPULATION OF SIZE = 3

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

Page 18
WAITLINE-ALLFILES

COST FOR A CHANNEL = $1 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0470

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.3264

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.9974

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0326

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.1992

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.7180

THE TOTAL COST PER TIME PERIOD $11.99

Number of Units in the System Probability

----------------------------- -----------

0 0.0470

1 0.2350

2 0.3916

3 0.3264

4 OR MORE

21. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 11

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 11 PER CHANNEL

Page 19
WAITLINE-ALLFILES
FINITE CALLING POPULATION OF SIZE = 3

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

COST FOR A CHANNEL = $1 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.1176

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.1765

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1.5882

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0114

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.1023

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.5294

THE TOTAL COST PER TIME PERIOD $9.94

Number of Units in the System Probability

----------------------------- -----------

0 0.1176

1 0.3529

2 0.3529

3 0.1765

21. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 0.8

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 1.25 PER CHANNEL

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

Page 20
WAITLINE-ALLFILES

COST FOR A CHANNEL = $8 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.5152

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0730

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.7130

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0913

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.8913

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.1552

THE TOTAL COST PER TIME PERIOD $23.13

Number of Units in the System Probability

----------------------------- -----------

0 0.5152

1 0.3297

2 0.1055

3 0.0338

4 0.0108

5 OR MORE 0.0051

22. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 0.4

Page 21
WAITLINE-ALLFILES
EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 1.1 PER CHANNEL

COST FOR UNITS IN THE SYSTEM = $12 PER TIME PERIOD

COST FOR A CHANNEL = $9 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.6923

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0124

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.3761

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.0311

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 0.9402

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.0559

THE TOTAL COST PER TIME PERIOD $22.51

Number of Units in the System Probability

----------------------------- -----------

0 0.6923

1 0.2517

2 0.0458

3 0.0083

4 OR MORE 0.0018

23. WAITING LINES

*************

NUMBER OF CHANNELS = 2

POISSON ARRIVALS WITH MEAN RATE = 0.7

Page 22
WAITLINE-ALLFILES

EXPONENTIAL SERVICE TIMES WITH MEAN RATE = 1 PER CHANNEL

COST FOR UNITS IN THE SYSTEM = $9 PER TIME PERIOD

COST FOR A CHANNEL = $7 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.4815

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 0.0977

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 0.7977

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 0.1396

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 1.1396

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.1815

THE TOTAL COST PER TIME PERIOD $21.18

Number of Units in the System Probability

----------------------------- -----------

0 0.4815

1 0.3370

2 0.1180

3 0.0413

4 0.0145

5 OR MORE 0.0078

24. WAITING LINES

*************

Page 23
WAITLINE-ALLFILES
NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 15

ARBITRARY SERVICE TIMES WITH MEAN RATE = 22

STANDARD DEVIATION FOR THE SERVICE TIME = 0.6

COST FOR UNITS IN THE SYSTEM = $10 PER TIME PERIOD

COST FOR A CHANNEL = $6 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.3182

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 128.0162

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 128.6981

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 8.5344

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 8.5799

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.6818

THE TOTAL COST PER TIME PERIOD $1,292.98

26. WAITING LINES

*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 12

ARBITRARY SERVICE TIMES WITH MEAN RATE = 19

STANDARD DEVIATION FOR THE SERVICE TIME = 3

COST FOR UNITS IN THE SYSTEM = $13 PER TIME PERIOD

Page 24
WAITLINE-ALLFILES

COST FOR A CHANNEL = $9 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.3684

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 1,759.3985

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 1,760.0301

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 146.6165

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 146.6692

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.6316

THE TOTAL COST PER TIME PERIOD $22,889.39

27. WAITING LINES

*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 10

ARBITRARY SERVICE TIMES WITH MEAN RATE = 11

STANDARD DEVIATION FOR THE SERVICE TIME = 0.8

COST FOR UNITS IN THE SYSTEM = $5 PER TIME PERIOD

COST FOR A CHANNEL = $4 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.0909

Page 25
WAITLINE-ALLFILES
THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 356.5455

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 357.4545

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 35.6545

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 35.7455

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.9091

THE TOTAL COST PER TIME PERIOD $1,791.27

28. WAITING LINES

*************

NUMBER OF CHANNELS = 1

POISSON ARRIVALS WITH MEAN RATE = 20

ARBITRARY SERVICE TIMES WITH MEAN RATE = 32

STANDARD DEVIATION FOR THE SERVICE TIME = 0.9

COST FOR UNITS IN THE SYSTEM = $15 PER TIME PERIOD

COST FOR A CHANNEL = $7 PER TIME PERIOD

OPERATING CHARACTERISTICS
-------------------------

THE PROBABILITY OF NO UNITS IN THE SYSTEM 0.3750

THE AVERAGE NUMBER OF UNITS IN THE WAITING LINE 432.5208

THE AVERAGE NUMBER OF UNITS IN THE SYSTEM 433.1458

THE AVERAGE TIME A UNIT SPENDS IN THE WAITING LINE 21.6260

THE AVERAGE TIME A UNIT SPENDS IN THE SYSTEM 21.6573

THE PROBABILITY THAT AN ARRIVING UNIT HAS TO WAIT 0.6250

Page 26
WAITLINE-ALLFILES
THE TOTAL COST PER TIME PERIOD $6,504.19

Page 27
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:01:22

Module/submodel: Waiting Lines/M/M/1 (exponential service times)

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .75
Service rate(mu) 1
Number of servers 1

Results

Result Value
---------------------------------------------
Average server utilization .75
Average number in the queue(Lq) 2.25
Average number in the system(L) 3
Average time in the queue(Wq) 3
--- Minutes 180
--- Seconds 10800
Average time in the system(W) 4
--- Minutes 240
--- Seconds 14400

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .25 .25 .75
1 .19 .44 .56
2 .14 .58 .42
3 .11 .68 .32
4 .08 .76 .24
5 .06 .82 .18
6 .04 .87 .13
7 .03 .9 .1
8 .03 .92 .08
9 .02 .94 .06
10 .01 .96 .04
11 .01 .97 .03
12 .01 .98 .02
13 .01 .98 .02
14 .0 .99 .01
15 .0 .99 .01
16 .0 1 .01
17 .0 1 .01
18 .0 1 .0
19 .0 1 .0
20 0 1 .0
21 0 1 .0
22 0 1 .0
23 0 1 .0
24 0 1 0
25 0 1 0
26 0 1 0
27 0 1 0
28 0 1 0
Remaining probabilities are < .0001
(untitled)
Probabilities P(N = k)

Probability
.25

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:04:11

Module/submodel: Waiting Lines/M/M/1 (exponential service times)

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .75
Service rate(mu) 1
Number of servers 1
Server cost $/time 10
Waiting cost $/time 7

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

(untitled)
Probabilities P(N = k)

Probability
.25

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:07:05

Module/submodel: Waiting Lines/M/M/1 (exponential service times)

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .5
Service rate(mu) .75
Number of servers 1

Results

Result Value
---------------------------------------------
Average server utilization .67
Average number in the queue(Lq) 1.33
Average number in the system(L) 2
Average time in the queue(Wq) 2.67
--- Minutes 160
--- Seconds 9600
Average time in the system(W) 4
--- Minutes 240
--- Seconds 14400

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .33 .33 .67
1 .22 .56 .44
2 .15 .7 .3
3 .1 .8 .2
4 .07 .87 .13
5 .04 .91 .09
6 .03 .94 .06
7 .02 .96 .04
8 .01 .97 .03
9 .01 .98 .02
10 .01 .99 .01
11 .0 1 .01
12 .0 1 .01
13 .0 1 .0
14 .0 1 .0
15 0 1 .0
16 0 1 .0
17 0 1 0
18 0 1 0
19 0 1 0
20 0 1 0
21 0 1 0
Remaining probabilities are < .0001
(untitled)
Probabilities P(N = k)

Probability
.33

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:39:26

Module/submodel: Waiting Lines/M/M/1 (exponential service times)

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .5
Service rate(mu) .75
Number of servers 1
Server cost $/time 10
Waiting cost $/time 6

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

Probability
.33

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .8
Service rate(mu) 1.2
Number of servers 2

Results

Result Value
---------------------------------------------
Average server utilization .33
Average number in the queue(Lq) .08
Average number in the system(L) .75
Average time in the queue(Wq) .1
--- Minutes 6.25
--- Seconds 375
Average time in the system(W) .94
--- Minutes 56.25
--- Seconds 3375

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .33 .83 .17
2 .11 .94 .06
3 .04 .98 .02
4 .01 1 .01
5 .0 1 .0
6 .0 1 0
7 0 1 0
8 0 1 0
Remaining probabilities are < .0001

Sensitivity to num servers ----------

1 2 3 4 5
----------------------------------------------------------------------------------------
Value .67 .33 .22 .17 .13
Average server utilization 1.33 .08 .01 .0 0
Average number in the queue(Lq) 2 .75 .68 .67 .67
Average number in the system(L) 1.67 .1 .01 .0 0
Average time in the queue(Wq) 2.5 .94 .84 .83 .83
(untitled)
Probabilities P(N = k)

Probability .5
0.5
.5

.3333

.1111

.037

0
0 1 2 3 4 5 6 7 8 9
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1 .9815 .9938 .9979 .9993 .9998 .9999 1.
.9444

.8333

.5
0.5

0
0 1 2 3 4 5 6 7 8 9
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.5
0.5

.1667

.0556
0
0 1 2 3 4 5 6 7 8 9
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:02:51

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .8
Service rate(mu) 1.2
Number of servers 2
Server cost $/time 9
Waiting cost $/time 7

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .33 .83 .17
2 .11 .94 .06
3 .04 .98 .02
4 .01 1 .01
5 .0 1 .0
6 .0 1 0
7 0 1 0
8 0 1 0
Remaining probabilities are < .0001

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 18.33 23
2 18.58 23.25
3 27.07 31.73
4 36.01 40.67
5 45 49.67

Sensitivity to num servers ----------

(untitled)
Probabilities P(N = k)

Probability .5
0.5
.5

.3333

.1111

.037

0
0 1 2 3 4 5 6 7 8 9
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1 .9815 .9938 .9979 .9993 .9998 .9999 1.
.9444

.8333

.5
0.5

0
0 1 2 3 4 5 6 7 8 9
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.5
0.5

.1667

.0556
0
0 1 2 3 4 5 6 7 8 9
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:09:48

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.1
Service rate(mu) 1.6
Number of servers 5

Results

Result Value
---------------------------------------------
Average server utilization .14
Average number in the queue(Lq) 0
Average number in the system(L) .69
Average time in the queue(Wq) 0
--- Minutes .01
--- Seconds .39
Average time in the system(W) .63
--- Minutes 37.51
--- Seconds 2250.39

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .35 .85 .15
2 .12 .97 .03
3 .03 1 .01
4 .0 1 0
5 0 1 0
Remaining probabilities are < .0001

Sensitivity to num servers ----------

1 2 3 4 5
----------------------------------------------------------------------------------------
Value .69 .34 .23 .17 .14
Average server utilization 1.51 .09 .01 .0 0
Average number in the queue(Lq) 2.2 .78 .7 .69 .69
Average number in the system(L) 1.38 .08 .01 .0 0
Average time in the queue(Wq) 2 .71 .63 .63 .63
(untitled)
Probabilities P(N = k)

Probability .5028
.5
0.5

.3457

.1188

.0272
0
0 1 2 3 4 5 6
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability .9946 .9993 .9999 1.

1 .9673

.8485

.5028
0.5

0
0 1 2 3 4 5 6
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5 .4972

.1515

0
0 1 2 3 4 5 6
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:10:51

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.1
Service rate(mu) 1.6
Number of servers 3
Server cost $/time 10
Waiting cost $/time 5.5

Results

Result Value
---------------------------------------------
Average server utilization .23
Average number in the queue(Lq) .01
Average number in the system(L) .7
Average time in the queue(Wq) .01
--- Minutes .57
--- Seconds 34.28
Average time in the system(W) .63
--- Minutes 38.07
--- Seconds 2284.28
Cost (Labor + # waiting*wait cost) $30.06
Cost (Labor + # in system*wait cost) $33.84

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .34 .85 .15
2 .12 .96 .04
3 .03 1 .01
4 .01 1 .0
5 .0 1 0
6 0 1 0
Remaining probabilities are < .0001

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 18.32 22.1
2 20.51 24.29
3 30.06 33.84
4 40.01 43.79
5 50 53.78

Sensitivity to num servers ----------

Probability .5015
.5
0.5

.3448

.1185

.0272
0
0 1 2 3 4 5 6 7
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability .9919 .9981 .9996 .9999 1.

1 .9648

.8463

.5015
0.5

0
0 1 2 3 4 5 6 7
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.4985
0.5

.1537

0
0 1 2 3 4 5 6 7
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:13:08

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.35
Service rate(mu) 1.95
Number of servers 4

Results

Result Value
---------------------------------------------
Average server utilization .17
Average number in the queue(Lq) .0
Average number in the system(L) .69
Average time in the queue(Wq) 0
--- Minutes .05
--- Seconds 3.23
Average time in the system(W) .51
--- Minutes 30.82
--- Seconds 1849.39

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .35 .85 .15
2 .12 .97 .03
3 .03 1 .01
4 .0 1 .0
5 0 1 0
6 0 1 0
Remaining probabilities are < .0001

Sensitivity to num servers ----------

1 2 3 4 5
----------------------------------------------------------------------------------------
Value .69 .35 .23 .17 .14
Average server utilization 1.56 .09 .01 .0 0
Average number in the queue(Lq) 2.25 .79 .7 .69 .69
Average number in the system(L) 1.15 .07 .01 0 0
Average time in the queue(Wq) 1.67 .58 .52 .51 .51
(untitled)
Probabilities P(N = k)

Probability .5003
.5
0.5

.3464

.1199

.0277
0
0 1 2 3 4 5 6 7
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability .9942 .999 .9998 1. 1.

1 .9665

.8466

.5003
0.5

0
0 1 2 3 4 5 6 7
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.4997
0.5

.1534

0
0 1 2 3 4 5 6 7
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:14:06

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.35
Service rate(mu) 1.95
Number of servers 4
Server cost $/time 10.5
Waiting cost $/time 5.7

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .5 .5 .5
1 .35 .85 .15
2 .12 .97 .03
3 .03 1 .01
4 .0 1 .0
5 0 1 0
6 0 1 0
Remaining probabilities are < .0001

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 19.38 23.33
2 21.54 25.48
3 31.56 35.51
4 42.01 45.95
5 52.5 56.45

Sensitivity to num servers ----------

Probability .5003
.5
0.5

.3464

.1199

.0277
0
0 1 2 3 4 5 6 7
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability .9942 .999 .9998 1. 1.

1 .9665

.8466

.5003
0.5

0
0 1 2 3 4 5 6 7
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.4997
0.5

.1534

0
0 1 2 3 4 5 6 7
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:43:17

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 5.5
Service rate(mu) 8.6
Number of servers 1

Results

Result Value
---------------------------------------------
Average server utilization .64
Average number in the queue(Lq) 1.13
Average number in the system(L) 1.77
Average time in the queue(Wq) .21
--- Minutes 12.38
--- Seconds 742.69
Average time in the system(W) .32
--- Minutes 19.35
--- Seconds 1161.29

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .36 .36 .64
1 .23 .59 .41
2 .15 .74 .26
3 .09 .83 .17
4 .06 .89 .11
5 .04 .93 .07
6 .02 .96 .04
7 .02 .97 .03
8 .01 .98 .02
9 .01 .99 .01
10 .0 1 .01
11 .0 1 .0
12 .0 1 .0
13 .0 1 .0
14 0 1 .0
15 0 1 0
16 0 1 0
17 0 1 0
18 0 1 0
19 0 1 0
Remaining probabilities are < .0001

Sensitivity to num servers ----------

1 2 3 4 5
----------------------------------------------------------------------------------------
Value .64 .32 .21 .16 .13
Average server utilization 1.13 .07 .01 0 0
Average number in the queue(Lq) 1.77 .71 .65 .64 .64
Average number in the system(L) .21 .01 .0 0 0
Average time in the queue(Wq) .32 .13 .12 .12 .12
(untitled)
Probabilities P(N = k)

Probability
.36

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 11:44:17

Module/submodel: Waiting Lines/M/M/s

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 5.5
Service rate(mu) 8.6
Number of servers 1
Server cost $/time 9.5
Waiting cost $/time 6.5

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 16.88 21.03
2 19.47 23.63
3 28.55 32.71
4 38.01 42.16
5 47.5 51.66

Sensitivity to num servers ----------

(untitled)
Probabilities P(N = k)

Probability
.36

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:27:49

Module/submodel: Waiting Lines/M/M/1 with a Finite System Size

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.1
Service rate(mu) 1.8
Number of servers 1
Maximum system size 10

Results

Result Value
---------------------------------------------
Average server utilization .61
Average number in the queue(Lq) .91
Average number in the system(L) 1.52
Average time in the queue(Wq) .83
--- Minutes 49.94
--- Seconds 2996.51
Average time in the system(W) 1.39
--- Minutes 83.28
--- Seconds 4996.51
Effective arrival rate 1.1
Probability that system is full 0

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .39 .39 .61
1 .24 .63 .37
2 .15 .78 .22
3 .09 .86 .14
4 .05 .92 .08
5 .03 .95 .05
6 .02 .97 .03
7 .01 .98 .02
8 .01 1 .01
9 .0 1 .0
10 .0 1 0
(untitled)
Probabilities P(N = k)

Probability .3906
.39

.2387

.1459

.0891

.0545
.0333
.0203
0
0 1 2 3 4 5 6 7 8 9 10
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability 1.
1 .9849 .9925 .9972
.9521 .9725
.9188
.8644

.7752

.6293

0.5
.3906

0
0 1 2 3 4 5 6 7 8 9 10
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.6094

0.5

.3707

.2248

.1356
.0812

0
0 1 2 3 4 5 6 7 8 9 10
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:30:13

Module/submodel: Waiting Lines/M/M/1 with a Finite System Size

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.1
Service rate(mu) 1.8
Number of servers 1
Maximum system size 10
Server cost $/time 9
Waiting cost $/time 6.6

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .39 .39 .61
1 .24 .63 .37
2 .15 .78 .22
3 .09 .86 .14
4 .05 .92 .08
5 .03 .95 .05
6 .02 .97 .03
7 .01 .98 .02
8 .01 1 .01
9 .0 1 .0
10 .0 1 0
(untitled)
Probabilities P(N = k)

Probability .3906
.39

.2387

.1459

.0891

.0545
.0333
.0203
0
0 1 2 3 4 5 6 7 8 9 10
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability 1.
1 .9849 .9925 .9972
.9521 .9725
.9188
.8644

.7752

.6293

0.5
.3906

0
0 1 2 3 4 5 6 7 8 9 10
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.6094

0.5

.3707

.2248

.1356
.0812

0
0 1 2 3 4 5 6 7 8 9 10
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:32:24

Module/submodel: Waiting Lines/M/M/1 with a Finite System Size

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 2
Service rate(mu) 2.6
Number of servers 1
Maximum system size 15

Results

Result Value
---------------------------------------------
Average server utilization .77
Average number in the queue(Lq) 2.32
Average number in the system(L) 3.09
Average time in the queue(Wq) 1.17
--- Minutes 70.03
--- Seconds 4201.54
Average time in the system(W) 1.55
--- Minutes 93.1
--- Seconds 5586.15
Effective arrival rate 2
Probability that system is full 0

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .23 .23 .77
1 .18 .41 .59
2 .14 .55 .45
3 .11 .66 .34
4 .08 .74 .26
5 .06 .8 .2
6 .05 .85 .15
7 .04 .89 .11
8 .03 .92 .08
9 .02 .94 .06
10 .02 .96 .04
11 .01 .97 .03
12 .01 .98 .02
13 .01 .99 .01
14 .01 1 .0
15 .0 1 0
(untitled)
Probabilities P(N = k)

Probability
.23

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

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:31:25

Module/submodel: Waiting Lines/M/M/1 with a Finite System Size

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 2
Service rate(mu) 2.6
Number of servers 1
Maximum system size 15
Server cost $/time 10
Waiting cost $/time 7

Results

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

Probability
.23

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

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:34:59

Module/submodel: Waiting Lines/M/M/s with a Finite System Size

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 1.5
Service rate(mu) 2.5
Number of servers 1
Maximum system size 12

Results

Result Value
---------------------------------------------
Average server utilization .6
Average number in the queue(Lq) .88
Average number in the system(L) 1.48
Average time in the queue(Wq) .59
--- Minutes 35.37
--- Seconds 2122.3
Average time in the system(W) .99
--- Minutes 59.37
--- Seconds 3562.3
Effective arrival rate 1.5
Probability that system is full 0

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .4 .4 .6
1 .24 .64 .36
2 .14 .79 .21
3 .09 .87 .13
4 .05 .92 .08
5 .03 .95 .05
6 .02 .97 .03
7 .01 .98 .02
8 .01 1 .01
9 .0 1 .0
10 .0 1 .0
11 .0 1 0
12 0 1 0
(untitled)
Probabilities P(N = k)

Probability .4005
.4

.2403

.1442

.0865

.0519
.0311

0
0 1 2 3 4 5 6 7 8 9 10 11 12
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1 .9845 .9912 .9953 .9977 .9991 1.
.9546 .9733
.9234
.8715

.785

.6408

0.5
.4005

0
0 1 2 3 4 5 6 7 8 9 10 11 12
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

.5995

0.5

.3592

.215

.1285
.0766

0
0 1 2 3 4 5 6 7 8 9 10 11 12
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:35:49

Module/submodel: Waiting Lines/M/M/s with a Finite System Size

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) .5
Service rate(mu) 2.5
Number of servers 3
Maximum system size 18
Server cost $/time 11
Waiting cost $/time 8.4

Results

Result Value
---------------------------------------------
Average server utilization .07
Average number in the queue(Lq) 0
Average number in the system(L) .2
Average time in the queue(Wq) 0
--- Minutes .01
--- Seconds .6
Average time in the system(W) .4
--- Minutes 24.01
--- Seconds 1440.6
Effective arrival rate .5
Probability that system is full 0
Cost (Labor + # waiting*wait cost) $33
Cost (Labor + # in system*wait cost) $34.68

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .82 .82 .18
1 .16 .98 .02
2 .02 1 .0
3 .0 1 0
(untitled)
Probabilities P(N = k)

Probability
.82

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:36:35

Module/submodel: Waiting Lines/M/M/s with a Finite System Size

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arrival rate(lambda) 2.5
Service rate(mu) 2.5
Number of servers 4
Maximum system size 20

Results

Result Value
---------------------------------------------
Average server utilization .25
Average number in the queue(Lq) .01
Average number in the system(L) 1.01
Average time in the queue(Wq) .0
--- Minutes .16
--- Seconds 9.8
Average time in the system(W) .4
--- Minutes 24.16
--- Seconds 1449.8
Effective arrival rate 2.5
Probability that system is full 0

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 .37 .37 .63
1 .37 .73 .27
2 .18 .92 .08
3 .06 .98 .02
4 .02 1 .01
5 .0 1 .0
6 0 1 0
7 0 1 0
(untitled)
Probabilities P(N = k)

Probability
.37

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System

(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:37:59

Module/submodel: Waiting Lines/M/M/1 with a Finite Population

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 2
Service rate(mu) 3.5
Number of servers 1
Population size 30

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 27.25
Average number in the system(L) 28.25
Average time in the queue(Wq) 7.79
--- Minutes 467.14
--- Seconds 28028.57
Average time in the system(W) 8.07
--- Minutes 484.29
--- Seconds 29057.14
Prob(% of time) system is empty (P0) 0
Effective arrival rate 3.5

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 0 1
13 0 0 1
14 0 0 1
15 0 0 1
16 0 0 1
17 0 0 1
18 0 0 1
19 0 0 1
20 0 0 1
21 0 0 1
22 0 0 1
23 .0 .0 1
24 .01 .01 1
25 .02 .03 .97
26 .07 .1 .9
27 .16 .26 .74
28 .27 .52 .48
29 .3 .83 .17
30 .17 1 0

(untitled)
Probabilities P(N = k)

Probability
.3

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:39:00

Module/submodel: Waiting Lines/M/M/1 with a Finite Population

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 2.2
Service rate(mu) 4.2
Number of servers 1
Population size 25
Server cost $/time 12
Waiting cost $/time 8.9

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 22.09
Average number in the system(L) 23.09
Average time in the queue(Wq) 5.26
--- Minutes 315.58
--- Seconds 18935.06
Average time in the system(W) 5.5
--- Minutes 329.87
--- Seconds 19792.21
Prob(% of time) system is empty (P0) 0
Effective arrival rate 4.2
Cost (Labor + # waiting*wait cost) $208.61
Cost (Labor + # in system*wait cost) $217.51

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 0 1
13 0 0 1
14 0 0 1
15 0 0 1
16 0 0 1
17 0 0 1
18 .0 .0 1
19 .01 .01 .99
20 .03 .04 .96
21 .08 .13 .87
22 .17 .3 .7
23 .27 .57 .43
24 .28 .85 .15
25 .15 1 0

(untitled)
Probabilities P(N = k)

Probability
.28

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:40:21

Module/submodel: Waiting Lines/M/M/1 with a Finite Population

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 4.12
Service rate(mu) 5.13
Number of servers 1
Population size 30

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 27.75
Average number in the system(L) 28.75
Average time in the queue(Wq) 5.41
--- Minutes 324.62
--- Seconds 19477.09
Average time in the system(W) 5.61
--- Minutes 336.31
--- Seconds 20178.84
Prob(% of time) system is empty (P0) 0
Effective arrival rate 5.13

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 0 1
13 0 0 1
14 0 0 1
15 0 0 1
16 0 0 1
17 0 0 1
18 0 0 1
19 0 0 1
20 0 0 1
21 0 0 1
22 0 0 1
23 0 0 1
24 .0 .0 1
25 .01 .01 1
26 .03 .04 .96
27 .09 .13 .87
28 .22 .35 .65
29 .36 .71 .29
30 .29 1 0

(untitled)
Probabilities P(N = k)

Probability
.36

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:41:21

Module/submodel: Waiting Lines/M/M/1 with a Finite Population

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 5.19
Service rate(mu) 5.14
Number of servers 1
Population size 25
Server cost $/time 20
Waiting cost $/time 18

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 23.01
Average number in the system(L) 24.01
Average time in the queue(Wq) 4.48
--- Minutes 268.6
--- Seconds 16115.7
Average time in the system(W) 4.67
--- Minutes 280.27
--- Seconds 16816.09
Prob(% of time) system is empty (P0) 0
Effective arrival rate 5.14
Cost (Labor + # waiting*wait cost) $434.17
Cost (Labor + # in system*wait cost) $452.17

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 0 1
13 0 0 1
14 0 0 1
15 0 0 1
16 0 0 1
17 0 0 1
18 0 0 1
19 0 0 1
20 .0 .0 1
21 .01 .02 .98
22 .06 .08 .92
23 .18 .26 .74
24 .37 .63 .37
25 .37 1 0

(untitled)
Probabilities P(N = k)

Probability
.37

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:42:27

Module/submodel: Waiting Lines/M/M/s with a Finite Population

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 1.8
Service rate(mu) 2.85
Number of servers 5
Population size 30

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 17.08
Average number in the system(L) 22.08
Average time in the queue(Wq) 1.2
--- Minutes 71.93
--- Seconds 4315.79
Average time in the system(W) 1.55
--- Minutes 92.98
--- Seconds 5578.95
Prob(% of time) system is empty (P0) 0
Effective arrival rate 14.25

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 .0 1
13 .0 .0 1
14 .0 .01 1
15 .01 .02 .98
16 .02 .03 .97
17 .03 .06 .94
18 .05 .11 .89
19 .07 .18 .82
20 .1 .27 .73
21 .12 .4 .6
22 .14 .54 .46
23 .14 .68 .32
24 .12 .8 .2
25 .09 .9 .1
26 .06 .96 .04
27 .03 .99 .01
28 .01 1 .0
29 .0 1 0
30 0 1 0

(untitled)
Probabilities P(N = k)

Probability
.14

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:43:35

Module/submodel: Waiting Lines/M/M/s with a Finite Population

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 4.8
Service rate(mu) 5.85
Number of servers 6
Population size 20
Server cost $/time 10.7
Waiting cost $/time 6.2

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 6.71
Average number in the system(L) 12.7
Average time in the queue(Wq) .19
--- Minutes 11.49
--- Seconds 689.41
Average time in the system(W) .36
--- Minutes 21.75
--- Seconds 1304.79
Prob(% of time) system is empty (P0) 0
Effective arrival rate 35.04
Cost (Labor + # waiting*wait cost) $105.8
Cost (Labor + # in system*wait cost) $142.94

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 .0 .0 1
5 .0 .01 1
6 .01 .02 .98
7 .02 .03 .97
8 .03 .07 .93
9 .05 .12 .88
10 .08 .2 .8
11 .11 .31 .69
12 .14 .45 .55
13 .15 .6 .4
14 .14 .74 .26
15 .12 .85 .15
16 .08 .93 .07
17 .04 .98 .02
18 .02 1 .01
19 .0 1 0
20 0 1 0

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 120.94 127.14
2 117.89 130.29
3 114.83 133.43
4 111.78 136.58
5 108.73 139.72
6 105.8 142.94
7 103.56 146.53
8 103.21 151.16
9 105.86 157.44

(untitled)
Probabilities P(N = k)

Probability
.15

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:47:55

Module/submodel: Waiting Lines/M/M/s with a Finite Population

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 10
Service rate(mu) 11
Number of servers 10
Population size 30

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 9.01
Average number in the system(L) 19.01
Average time in the queue(Wq) .08
--- Minutes 4.92
--- Seconds 295.2
Average time in the system(W) .17
--- Minutes 10.37
--- Seconds 622.47
Prob(% of time) system is empty (P0) 0
Effective arrival rate 109.93

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 .0 .0 1
9 .0 .0 1
10 .0 .01 1
11 .01 .02 .98
12 .01 .03 .97
13 .02 .06 .94
14 .04 .09 .91
15 .05 .15 .85
16 .07 .22 .78
17 .09 .31 .69
18 .11 .42 .58
19 .12 .54 .46
20 .12 .66 .34
21 .11 .77 .23
22 .09 .86 .14
23 .06 .92 .08
24 .04 .96 .04
25 .02 .98 .02
26 .01 1 .0
27 .0 1 .0
28 .0 1 0
29 0 1 0
(untitled)
Probabilities P(N = k)

Probability
.12

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:45:00

Module/submodel: Waiting Lines/M/M/s with a Finite Population

Problem title: (untitled)
Cost analysis: No costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 3.4
Service rate(mu) 4.5
Number of servers 4
Population size 30

Results

Result Value
---------------------------------------------
Average server utilization 1
Average number in the queue(Lq) 20.71
Average number in the system(L) 24.71
Average time in the queue(Wq) 1.15
--- Minutes 69.02
--- Seconds 4141.18
Average time in the system(W) 1.37
--- Minutes 82.35
--- Seconds 4941.18
Prob(% of time) system is empty (P0) 0
Effective arrival rate 18

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 0 0 1
3 0 0 1
4 0 0 1
5 0 0 1
6 0 0 1
7 0 0 1
8 0 0 1
9 0 0 1
10 0 0 1
11 0 0 1
12 0 0 1
13 0 0 1
14 0 0 1
15 0 0 1
16 0 .0 1
17 .0 .0 1
18 .01 .01 1
19 .01 .02 .98
20 .02 .04 .96
21 .05 .09 .91
22 .08 .17 .83
23 .12 .28 .72
24 .15 .44 .56
25 .17 .61 .39
26 .16 .77 .23
27 .12 .9 .1
28 .07 .97 .03
29 .03 1 .01
30 .01 1 0

(untitled)
Probabilities P(N = k)

Probability
.17

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:45:54

Module/submodel: Waiting Lines/M/M/s with a Finite Population

Problem title: (untitled)
Cost analysis: Use Costs
Time unit (arrival, service rate): hours

Data and Results ----------

Data

Parameter Value
----------------------------------------
Arvl rt PER CUSTOMER 1.4
Service rate(mu) 4.1
Number of servers 6
Population size 30
Server cost $/time 19
Waiting cost $/time 12

Results

Result Value
---------------------------------------------
Average server utilization .99
Average number in the queue(Lq) 6.69
Average number in the system(L) 12.62
Average time in the queue(Wq) .27
--- Minutes 16.49
--- Seconds 989.44
Average time in the system(W) .52
--- Minutes 31.12
--- Seconds 1867.49
Prob(% of time) system is empty (P0) 0
Effective arrival rate 24.33
Cost (Labor + # waiting*wait cost) $194.24
Cost (Labor + # in system*wait cost) $265.46

Table of Probabilities ----------

k P(n=k) P(n<=k) P(n>k)

0 0 0 1
1 0 0 1
2 .0 .0 1
3 .0 .01 1
4 .01 .02 .98
5 .02 .04 .96
6 .03 .07 .93
7 .04 .11 .89
8 .05 .16 .84
9 .06 .22 .78
10 .08 .3 .7
11 .09 .39 .61
12 .09 .48 .52
13 .1 .58 .42
14 .09 .67 .33
15 .09 .76 .24
16 .07 .83 .17
17 .06 .89 .11
18 .04 .93 .07
19 .03 .96 .04
20 .02 .98 .02
21 .01 1 .01
22 .01 1 .0
23 .0 1 .0
24 0 1 0
25 0 1 0

Cost vs. Servers ----------

Cost Cost
Servers (Waiting) (System)
1 331.86 343.86
2 303.71 327.71
3 275.57 311.57
4 247.43 295.43
5 219.53 279.47
6 194.24 265.46
7 177.88 258.09
8 174.34 260.29
9 181.26 270.28

(untitled)
Probabilities P(N = k)

Probability
.1

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Cumulative probabilities P(N<=k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
(untitled)
Decumulative probabilities P(N>k)

Probability
1

0.5

0
0 1 2 3 4 5 6 7 8 9 10 12 14 16 18 20 22 24 26 28 30
Number in System
Decision Analysis

1. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 1 2 7 3 5
2 3 6 2 8 5
3 7 9 2 7 3
4 9 1 2 8 6
5 2 6 2 9 1

PROBABILITIES
OF STATES 0.300 0.100 0.200 0.200 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 3.50

2 4.50

3 5.40

4 6.00 YES

5 3.60

EXPECTED VALUE OF PERFECT INFORMATION IS 2.00

Page 1
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

STATE 1 2 3 4 5
***** ****** ****** ****** ****** ******
1 0.100 0.100 0.100 0.100 0.600
2 0.200 0.200 0.200 0.200 0.200
3 0.300 0.300 0.100 0.100 0.200
4 0.400 0.100 0.100 0.100 0.300
5 0.500 0.200 0.100 0.100 0.100

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 4 5.69 0.290

2 4 4.76 0.170

3 3 5.73 0.110

4 3 5.73 0.110

5 4 7.25 0.320

EXPECTED VALUE OF THE ABOVE STRATEGY 6.04

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.04

EFFICIENCY OF THE SAMPLE INFORMATION 2.0%

Page 2
DecisionAnalysis

2. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 10 12 14 16 18
20 22 24 26 5
2 11 13 16 17 19
23 24 25 26 28
3 5 15 16 11 12
14 18 19 22 23
4 7 17 12 18 9
10 21 22 23 32
5 6 8 10 12 21
23 25 31 42 45
6 8 5 6 9 10
12 13 21 24 31
7 9 10 17 34 36
38 28 26 45 27
8 11 2 1 13 14
15 21 5 12 31
9 13 15 16 23 25
27 22 26 24 29
10 10 6 7 8 9 10
23 24 36 67

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 10 12 14 16 18
20 22 24 26 5
Page 3
DecisionAnalysis
2 11 13 16 17 19
23 24 25 26 28
3 5 15 16 11 12
14 18 19 22 23
4 7 17 12 18 9
10 21 22 23 32
5 6 8 10 12 21
23 25 31 42 45
6 8 5 6 9 10
12 13 21 24 31
7 9 10 17 34 36
38 28 26 45 27
8 11 2 1 13 14
15 21 5 12 31
9 13 15 16 23 25
27 22 26 24 29
10 10 6 7 8 9 10
23 24 36 67

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 17.80

2 19.50

3 14.20

4 14.70

5 18.40

6 10.90

7 26.40 YES

8 11.80
Page 4
DecisionAnalysis

9 21.60

10 13.00

EXPECTED VALUE OF PERFECT INFORMATION IS 1.60

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

***** ****** ****** ****** ****** ****** ****** ****** ****** ******
******
1 0.100 0.100 0.100 0.100 0.100 0.100 0.100 0.100 0.100 0.100
2 0.200 0.000 0.000 0.000 0.200 0.200 0.200 0.200 0.000 0.000
3 0.300 0.100 0.100 0.200 0.000 0.000 0.000 0.000 0.200 0.100
4 0.400 0.000 0.000 0.100 0.300 0.100 0.100 0.000 0.000 0.000
5 0.500 0.000 0.000 0.000 0.000 0.100 0.100 0.100 0.100 0.100
6 0.300 0.100 0.100 0.100 0.100 0.100 0.200 0.000 0.000 0.000
7 0.100 0.900 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000
8 0.800 0.050 0.050 0.000 0.000 0.000 0.000 0.000 0.000 0.100
9 0.600 0.050 0.050 0.100 0.100 0.000 0.000 0.000 0.050 0.050
10 0.050 0.050 0.050 0.050 0.050 0.050 0.300 0.200 0.100 0.100

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 7 28.65 0.310

2 7 27.51 0.225

Page 5
DecisionAnalysis

3 7 25.56 0.045

4 7 25.50 0.060

5 7 25.88 0.080

6 7 25.00 0.070

7 7 27.89 0.090

8 9 17.00 0.040

9 7 19.75 0.040

10 7 22.00 0.040

EXPECTED VALUE OF THE ABOVE STRATEGY 26.43

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.03

EFFICIENCY OF THE SAMPLE INFORMATION 1.9%

3. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 100 120 140 150 160 220

222 224 226 205
2 15 13 16 17 19 23
Page 6
DecisionAnalysis
24 25 26 228
3 24 15 16 11 12
14 18 19 22 223
4 37 517 565 465 214
410 21 213 123 132
5 212 180 110 120 210 230
250 310 421 452
6 218 290 260 290 180 120
100 110 24 31
7 209 10 17 34 36
38 28 123 450 27
8 213 112 119 113 140 150
210 105 120 31
9 13 15 116 123 250 270
220 260 240 290
10 90 60 70 80 90 100
230 250 360 670

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 100 120 140 150 160 220

222 224 226 205
2 15 13 16 17 19
23 24 25 26 228
3 24 15 16 11 12
14 18 19 22 223
4 37 517 565 465 214
410 21 213 123 132
5 212 180 110 120 210 230
250 310 421 452
6 218 290 260 290 180 120
100 110 24 31
7 209 10 17 34 36
38 28 123 450 27
8 213 112 119 113 140 150
210 105 120 31
9 13 15 116 123 250 270
220 260 240 290
Page 7
DecisionAnalysis
10 90 60 70 80 90 100
230 250 360 670

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 177.80

2 19.90

3 16.10

4 287.30 YES

5 210.20

6 178.80

7 56.10

8 152.20

9 175.70

10 130.00

EXPECTED VALUE OF PERFECT INFORMATION IS 77.20

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

Page 8
DecisionAnalysis
**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

***** ****** ****** ****** ****** ****** ****** ****** ****** ******
******
1 0.400 0.100 0.100 0.100 0.050 0.050 0.050 0.050 0.050 0.050
2 0.200 0.600 0.050 0.050 0.000 0.000 0.000 0.050 0.000 0.050
3 0.100 0.100 0.100 0.200 0.100 0.100 0.100 0.000 0.100 0.100
4 0.400 0.050 0.050 0.100 0.200 0.100 0.100 0.000 0.000 0.000
5 0.500 0.050 0.050 0.000 0.000 0.000 0.100 0.100 0.100 0.100
6 0.300 0.100 0.100 0.100 0.100 0.100 0.050 0.050 0.050 0.050
7 0.050 0.050 0.200 0.300 0.050 0.050 0.050 0.050 0.100 0.100
8 0.700 0.050 0.050 0.100 0.000 0.000 0.000 0.000 0.000 0.100
9 0.200 0.050 0.050 0.100 0.100 0.400 0.000 0.000 0.050 0.050
10 0.050 0.050 0.050 0.050 0.050 0.050 0.500 0.100 0.050 0.050

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 4 288.30 0.300

2 4 399.28 0.125

3 4 221.05 0.100

4 4 225.89 0.135

5 4 362.23 0.065

6 4 343.55 0.055

7 4 307.91 0.055

Page 9
DecisionAnalysis
8 4 230.50 0.040

9 4 227.18 0.055

10 4 245.86 0.070

EXPECTED VALUE OF THE ABOVE STRATEGY 287.30

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.00

EFFICIENCY OF THE SAMPLE INFORMATION 0.0%

4. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 50 120 140 150 212 220

222 224 226 100
2 115 113 116 117 123 215
124 125 126 228
3 124 115 116 111 213 114
118 119 122 223
4 137 517 565 465 432
410 21 213 123 132
5 200 180 110 120 453 230
250 310 421 400
6 218 290 260 290 345 120
100 110 24 31
7 209 10 17 34
360 38 28 123 450 27
8 213 112 119 113 123 150
210 105 120 31
9 113 15 116 123 213 270
220 260 240 290
10 190 360 393 465 190 100
Page 10
DecisionAnalysis
230 250 360 670

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 50 120 140 150 212 220

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********
Page 11
DecisionAnalysis

1 178.00

2 138.70

3 126.20

4 319.10 YES

5 233.30

6 195.30

7 88.50

8 150.50

9 182.00

10 250.80

EXPECTED VALUE OF PERFECT INFORMATION IS 65.70

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

***** ****** ****** ****** ****** ****** ****** ****** ****** ******
******
1 0.050 0.050 0.100 0.100 0.050 0.050 0.050 0.050 0.400 0.100
2 0.200 0.500 0.050 0.050 0.050 0.050 0.000 0.050 0.000 0.050
3 0.100 0.100 0.100 0.200 0.100 0.100 0.050 0.050 0.100 0.100
4 0.200 0.050 0.050 0.100 0.200 0.100 0.100 0.050 0.050 0.100
5 0.900 0.050 0.050 0.000 0.000 0.000 0.000 0.000 0.000 0.000
6 0.100 0.100 0.100 0.100 0.100 0.100 0.050 0.050 0.300 0.000
7 0.100 0.000 0.200 0.300 0.000 0.000 0.050 0.050 0.200 0.100
Page 12
DecisionAnalysis
8 0.700 0.050 0.050 0.050 0.050 0.050 0.050 0.000 0.000 0.000
9 0.200 0.050 0.050 0.100 0.100 0.200 0.200 0.100 0.000 0.000
10 0.050 0.050 0.050 0.050 0.050 0.050 0.500 0.200 0.000 0.000

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 4 346.61 0.255

2 4 459.35 0.100

3 4 241.95 0.100

4 10 255.85 0.130

5 4 422.85 0.065

6 4 415.18 0.055

7 4 300.78 0.045

8 4 318.25 0.040

9 4 250.94 0.155

10 10 306.91 0.055

EXPECTED VALUE OF THE ABOVE STRATEGY 324.14

EXPECTED VALUE OF THE SAMPLE INFORMATION 5.03

EFFICIENCY OF THE SAMPLE INFORMATION 7.7%

Page 13
DecisionAnalysis

5. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 5 12 15 18 19
2 3 4 12 1 28
3 7 2 6 7 3
4 8 9 2 4 6
5 10 13 15 17 19

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.600
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 16.40

2 18.80 YES

3 4.00

4 5.90

5 16.90

EXPECTED VALUE OF PERFECT INFORMATION IS 3.60

Page 14
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

STATE 1 2 3 4 5
***** ****** ****** ****** ****** ******
1 0.100 0.100 0.100 0.200 0.500
2 0.200 0.100 0.200 0.300 0.200
3 0.300 0.100 0.100 0.100 0.400
4 0.400 0.100 0.200 0.100 0.200
5 0.500 0.200 0.100 0.100 0.100

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 2 22.28 0.400

2 2 22.25 0.160

3 5 16.58 0.120

4 5 15.77 0.130

5 5 14.95 0.190

EXPECTED VALUE OF THE ABOVE STRATEGY 19.35

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.55

EFFICIENCY OF THE SAMPLE INFORMATION 15.3%

Page 15
DecisionAnalysis

6. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 15 12 15 18 19
2 13 24 12 31 28
3 17 22 26 27 23
4 18 19 12 14 16
5 21 31 15 17 19

PROBABILITIES
OF STATES 0.200 0.200 0.200 0.200 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 15.80

2 21.60

3 23.00 YES

4 15.80

5 20.60

EXPECTED VALUE OF PERFECT INFORMATION IS 4.40

Page 16
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

STATE 1 2 3 4 5
***** ****** ****** ****** ****** ******
1 0.500 0.100 0.100 0.200 0.100
2 0.400 0.100 0.200 0.200 0.100
3 0.300 0.200 0.100 0.100 0.300
4 0.400 0.300 0.100 0.100 0.100
5 0.500 0.100 0.200 0.100 0.100

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 3 22.57 0.420

2 3 24.38 0.160

3 3 22.86 0.140

4 5 22.14 0.140

5 3 23.86 0.140

EXPECTED VALUE OF THE ABOVE STRATEGY 23.02

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.02

EFFICIENCY OF THE SAMPLE INFORMATION 0.5%

Page 17
DecisionAnalysis

7. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 112 114 115 218 319

2 314 224 213 311 321
3 117 222 326 328 465
4 118 121 112 114 116
5 121 131 115 117 119

PROBABILITIES
OF STATES 0.300 0.100 0.100 0.250 0.250
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 190.75

2 295.90 YES

3 288.15

4 116.20

5 119.90

EXPECTED VALUE OF PERFECT INFORMATION IS 51.55

Page 18
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 2 300.39 0.445

2 3 302.97 0.160

3 3 316.00 0.135

4 2 294.64 0.140

5 3 294.46 0.120

EXPECTED VALUE OF THE ABOVE STRATEGY 301.40

EXPECTED VALUE OF THE SAMPLE INFORMATION 5.50

EFFICIENCY OF THE SAMPLE INFORMATION 10.7%

Page 19
DecisionAnalysis

8. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 112 221 335 415 511

2 113 224 337 417 514
3 117 222 326 418 523
4 118 225 312 420 534
5 121 227 315 431 546

PROBABILITIES
OF STATES 0.200 0.200 0.100 0.300 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 326.80

2 329.00

3 330.40

4 332.60

5 339.60 YES

EXPECTED VALUE OF PERFECT INFORMATION IS 2.20

Page 20
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

STATE 1 2 3 4 5
***** ****** ****** ****** ****** ******
1 0.100 0.100 0.100 0.200 0.500
2 0.100 0.100 0.200 0.200 0.400
3 0.100 0.200 0.300 0.100 0.300
4 0.100 0.300 0.100 0.400 0.100
5 0.100 0.100 0.200 0.100 0.500

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 5 339.60 0.100

2 5 370.41 0.170

3 5 348.25 0.160

4 5 346.57 0.230

5 5 315.41 0.340

EXPECTED VALUE OF THE ABOVE STRATEGY 339.60

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.00

EFFICIENCY OF THE SAMPLE INFORMATION 0.0%

Page 21
DecisionAnalysis

9. DECISION ANALYSIS
*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 1 2 7 3 5
2 3 6 2 8 5
3 7 9 2 7 3
4 9 1 2 8 6
5 2 6 2 9 1

PROBABILITIES
OF STATES 0.300 0.100 0.200 0.200 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 3.50 YES

2 4.50

3 5.40

4 6.00

5 3.60

EXPECTED VALUE OF PERFECT INFORMATION IS 1.90

Page 22
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 5 -3.86 0.290

2 5 -3.06 0.170

3 1 -3.36 0.110

4 1 -3.36 0.110

5 1 -2.44 0.320

EXPECTED VALUE OF THE ABOVE STRATEGY 3.16

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.34

EFFICIENCY OF THE SAMPLE INFORMATION 17.9%

Page 23
DecisionAnalysis

10. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 10 12 14 16 18
20 22 24 26 5
Page 24
DecisionAnalysis
2 11 13 16 17 19
23 24 25 26 28
3 5 15 16 11 12
14 18 19 22 23
4 7 17 12 18 9
10 21 22 23 32
5 6 8 10 12 21
23 25 31 42 45
6 8 5 6 9 10
12 13 21 24 31
7 9 10 17 34 36
38 28 26 45 27
8 11 2 1 13 14
15 21 5 12 31
9 13 15 16 23 25
27 22 26 24 29
10 10 6 7 8 9 10
23 24 36 67

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 17.80

2 19.50

3 14.20

4 14.70

5 18.40

6 10.90 YES

7 26.40

8 11.80
Page 25
DecisionAnalysis

9 21.60

10 13.00

EXPECTED VALUE OF PERFECT INFORMATION IS 3.30

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 8 -10.06 0.310

2 6 -12.56 0.225

Page 26
DecisionAnalysis

3 8 -9.89 0.045

4 10 -8.67 0.060

5 10 -8.25 0.080

6 10 -8.43 0.070

7 10 -8.78 0.090

8 6 -7.00 0.040

9 8 -6.75 0.040

10 8 -7.75 0.040

EXPECTED VALUE OF THE ABOVE STRATEGY 9.81

EXPECTED VALUE OF THE SAMPLE INFORMATION 1.09

EFFICIENCY OF THE SAMPLE INFORMATION 33.0%

11. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 100 120 140 150 160 220

222 224 226 205
2 15 13 16 17 19 23
Page 27
DecisionAnalysis
24 25 26 228
3 24 15 16 11 12
14 18 19 22 223
4 37 517 565 465 214
410 21 213 123 132
5 212 180 110 120 210 230
250 310 421 452
6 218 290 260 290 180 120
100 110 24 31
7 209 10 17 34 36
38 28 123 450 27
8 213 112 119 113 140 150
210 105 120 31
9 13 15 116 123 250 270
220 260 240 290
10 90 60 70 80 90 100
230 250 360 670

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 100 120 140 150 160 220

222 224 226 205
2 15 13 16 17 19
23 24 25 26 228
3 24 15 16 11 12
14 18 19 22 223
4 37 517 565 465 214
410 21 213 123 132
5 212 180 110 120 210 230
250 310 421 452
6 218 290 260 290 180 120
100 110 24 31
7 209 10 17 34 36
38 28 123 450 27
8 213 112 119 113 140 150
210 105 120 31
9 13 15 116 123 250 270
220 260 240 290
Page 28
DecisionAnalysis
10 90 60 70 80 90 100
230 250 360 670

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 177.80

2 19.90

3 16.10 YES

4 287.30

5 210.20

6 178.80

7 56.10

8 152.20

9 175.70

10 130.00

EXPECTED VALUE OF PERFECT INFORMATION IS 1.60

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

Page 29
DecisionAnalysis
**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 3 -16.03 0.300

2 3 -15.76 0.125

3 3 -16.85 0.100

4 3 -17.00 0.135

5 3 -14.77 0.065

6 3 -15.45 0.055

7 3 -15.09 0.055

Page 30
DecisionAnalysis
8 3 -15.88 0.040

9 3 -16.36 0.055

10 3 -16.64 0.070

EXPECTED VALUE OF THE ABOVE STRATEGY 16.10

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.00

EFFICIENCY OF THE SAMPLE INFORMATION 0.0%

12. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 50 120 140 150 212 220

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

DECISION 1 2 3 4 5 6
7 8 9 10
******** ****** ****** ****** ****** ****** ******
****** ****** ****** ******

1 50 120 140 150 212 220

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.100 0.200
0.200 0.100 0.000 0.000
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********
Page 32
DecisionAnalysis

1 178.00

2 138.70

3 126.20

4 319.10

5 233.30

6 195.30

7 88.50 YES

8 150.50

9 182.00

10 250.80

EXPECTED VALUE OF PERFECT INFORMATION IS 42.80

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

***** ****** ****** ****** ****** ****** ****** ****** ****** ******
******
1 0.050 0.050 0.100 0.100 0.050 0.050 0.050 0.050 0.400 0.100
2 0.200 0.500 0.050 0.050 0.050 0.050 0.000 0.050 0.000 0.050
3 0.100 0.100 0.100 0.200 0.100 0.100 0.050 0.050 0.100 0.100
4 0.200 0.050 0.050 0.100 0.200 0.100 0.100 0.050 0.050 0.100
5 0.900 0.050 0.050 0.000 0.000 0.000 0.000 0.000 0.000 0.000
6 0.100 0.100 0.100 0.100 0.100 0.100 0.050 0.050 0.300 0.000
7 0.100 0.000 0.200 0.300 0.000 0.000 0.050 0.050 0.200 0.100
Page 33
DecisionAnalysis
8 0.700 0.050 0.050 0.050 0.050 0.050 0.050 0.000 0.000 0.000
9 0.200 0.050 0.050 0.100 0.100 0.200 0.200 0.100 0.000 0.000
10 0.050 0.050 0.050 0.050 0.050 0.050 0.500 0.200 0.000 0.000

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 8 -126.96 0.255

2 7 -50.60 0.100

3 7 -67.75 0.100

4 7 -45.19 0.130

5 7 -51.08 0.065

6 7 -54.18 0.055

7 7 -61.00 0.045

8 7 -50.25 0.040

9 7 -78.06 0.155

10 7 -58.36 0.055

EXPECTED VALUE OF THE ABOVE STRATEGY 76.45

EXPECTED VALUE OF THE SAMPLE INFORMATION 12.05

EFFICIENCY OF THE SAMPLE INFORMATION 28.2%

Page 34
DecisionAnalysis

13. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 5 12 15 18 19
2 3 4 12 1 28
3 7 2 6 7 3
4 8 9 2 4 6
5 10 13 15 17 19

PROBABILITIES
OF STATES 0.100 0.100 0.100 0.100 0.600
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 16.40

2 18.80

3 4.00 YES

4 5.90

5 16.90

EXPECTED VALUE OF PERFECT INFORMATION IS 1.40

Page 35
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 3 -3.68 0.400

2 3 -3.63 0.160

3 3 -4.08 0.120

4 3 -3.92 0.130

5 3 -5.00 0.190

EXPECTED VALUE OF THE ABOVE STRATEGY 4.00

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.00

EFFICIENCY OF THE SAMPLE INFORMATION 0.0%

Page 36
DecisionAnalysis

14. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 15 12 15 18 19
2 13 24 12 31 28
3 17 22 26 27 23
4 18 19 12 14 16
5 21 31 15 17 19

PROBABILITIES
OF STATES 0.200 0.200 0.200 0.200 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 15.80 YES

2 21.60

3 23.00

4 15.80 YES

5 20.60

EXPECTED VALUE OF PERFECT INFORMATION IS 2.40

Page 37
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 1 -15.95 0.420

2 4 -14.88 0.160

3 1 -15.71 0.140

4 1 -15.14 0.140

5 4 -14.71 0.140

EXPECTED VALUE OF THE ABOVE STRATEGY 15.46

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.34

EFFICIENCY OF THE SAMPLE INFORMATION 14.2%

Page 38
DecisionAnalysis

15. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 112 114 115 218 319

2 314 224 213 311 321
3 117 222 326 328 465
4 118 121 112 114 116
5 121 131 115 117 119

PROBABILITIES
OF STATES 0.300 0.100 0.100 0.250 0.250
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 190.75

2 295.90 YES

3 288.15

4 116.20

5 119.90

EXPECTED VALUE OF PERFECT INFORMATION IS 51.55

Page 39
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 2 300.39 0.445

2 3 302.97 0.160

3 3 316.00 0.135

4 2 294.64 0.140

5 3 294.46 0.120

EXPECTED VALUE OF THE ABOVE STRATEGY 301.40

EXPECTED VALUE OF THE SAMPLE INFORMATION 5.50

EFFICIENCY OF THE SAMPLE INFORMATION 10.7%

Page 40
DecisionAnalysis

16. DECISION ANALYSIS

*****************

YOU HAVE INPUT THE FOLLOWING PAYOFF TABLE:

******************************************

STATES OF NATURE
DECISION 1 2 3 4 5
******** ****** ****** ****** ****** ******

1 112 221 335 415 511

2 113 224 337 417 514
3 117 222 326 418 523
4 118 225 312 420 534
5 121 227 315 431 546

PROBABILITIES
OF STATES 0.200 0.200 0.100 0.300 0.200
_

DECISION RECOMMENDATION
***********************

USING THE EXPECTED VALUE CRITERION

DECISION CRITERION RECOMMENDED

ALTERNATIVE VALUE DECISION
*********** ********* ***********

1 326.80 YES

2 329.00

3 330.40

4 332.60

5 339.60

EXPECTED VALUE OF PERFECT INFORMATION IS 2.30

Page 41
DecisionAnalysis

DEVELOPING A DECISION STRATEGY BASED ON SAMPLE INFORMATION

**********************************************************

YOU HAVE INPUT THE FOLLOWING PROBABILITIES FOR INDICATOR OUTCOMES:

******************************************************************

GIVEN INDICATOR OUTCOMES

OPTIMAL DECISION STRATEGY

*************************
PROB OF
IF BEST EXPECTED INDICATOR
INDICATOR DECISION VALUE OUTCOME
********* ******** ******** *********

1 1 -326.80 0.100

2 1 -358.41 0.170

3 1 -337.63 0.160

4 1 -333.43 0.230

5 1 -301.41 0.340

EXPECTED VALUE OF THE ABOVE STRATEGY 326.80

EXPECTED VALUE OF THE SAMPLE INFORMATION 0.00

EFFICIENCY OF THE SAMPLE INFORMATION 0.0%

Page 42
Forecasting

1. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 5 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12
2 13
3 14
4 15
5 16
6 17 14.00 3.00
7 18 15.00 3.00
8 19 16.00 3.00
9 20 17.00 3.00
10 21 18.00 3.00

THE MEAN SQUARE ERROR 9.00

THE FORECAST FOR PERIOD 11 19.00

2. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 4 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10
2 9
3 23
4 5
5 34 11.75 22.25
6 7 17.75 -10.75
7 110 17.25 92.75
8 15 39.00 -24.00
9 68 41.50 26.50
Page 1
forecasting
10 72 50.00 22.00

THE MEAN SQUARE ERROR 1,829.24

THE FORECAST FOR PERIOD 11 66.25

3. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 3 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 110
2 229
3 340
4 465 226.33 238.67
5 565 344.67 220.33
6 700 456.67 243.33
7 890 576.67 313.33
8 915 718.33 196.67
9 1,015 835.00 180.00
10 1,300 940.00 360.00

THE MEAN SQUARE ERROR 66,225.03

THE FORECAST FOR PERIOD 11 1076.67

4. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 4 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 45
Page 2
forecasting
2 123
3 315
4 400
5 545 220.75 324.25
6 600 345.75 254.25
7 756 465.00 291.00
8 100 575.25 -475.25
9 2,345 500.25 1,844.75
10 1,600 950.25 649.75

THE MEAN SQUARE ERROR 717,600.39

THE FORECAST FOR PERIOD 11 1200.25

5. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 5 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 145
2 280
3 390
4 410
5 565
6 670 358.00 312.00
7 780 463.00 317.00
8 890 563.00 327.00
9 999 663.00 336.00
10 1,230 780.80 449.20

THE MEAN SQUARE ERROR 123,887.73

THE FORECAST FOR PERIOD 11 913.80

6. FORECASTING WITH MOVING AVERAGES

********************************

Page 3
forecasting
THE MOVING AVERAGE USES 3 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10
2 56
3 200
4 400 88.67 311.33
5 100 218.67 -118.67
6 54 233.33 -179.33
7 660 184.67 475.33
8 1,000 271.33 728.67
9 90 571.33 -481.33
10 565 583.33 -18.33

THE MEAN SQUARE ERROR 161,726.49

THE FORECAST FOR PERIOD 11 551.67

7. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 3 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 1
2 5
3 10
4 200 5.33 194.67
5 500 71.67 428.33
6 1,000 236.67 763.33
7 2,300 566.67 1,733.33
8 5,800 1,266.67 4,533.33
9 9,900 3,033.33 6,866.67
10 12,450 6,000.00 6,450.00

Page 4
forecasting
THE MEAN SQUARE ERROR 16,159,029.86

THE FORECAST FOR PERIOD 11 9383.33

8. FORECASTING WITH MOVING AVERAGES

********************************

THE MOVING AVERAGE USES 4 TIME PERIODS

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12
2 16
3 23
4 65
5 45 29.00 16.00

THE MEAN SQUARE ERROR 256.00

THE FORECAST FOR PERIOD 6 37.25

9. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.1

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12
2 16 12.00 4.00
3 23 12.40 10.60
4 65 13.46 51.54
5 45 18.61 26.39

THE MEAN SQUARE ERROR 870.24

Page 5
forecasting

THE FORECAST FOR PERIOD 6 21.25

10. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.5

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10
2 9 10.00 -1.00
3 23 9.50 13.50
4 5 16.25 -11.25
5 34 10.63 23.38
6 7 22.31 -15.31
7 110 14.66 95.34
8 15 62.33 -47.33
9 68 38.66 29.34
10 72 53.33 18.67

THE MEAN SQUARE ERROR 1,514.46

THE FORECAST FOR PERIOD 11 62.67

11. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.7

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 110
2 229 110.00 119.00
3 340 193.30 146.70
4 465 295.99 169.01
5 565 414.30 150.70
6 700 519.79 180.21
7 890 645.94 244.06
Page 6
forecasting
8 915 816.78 98.22
9 1,015 885.53 129.47
10 1,300 976.16 323.84

THE MEAN SQUARE ERROR 34,475.67

THE FORECAST FOR PERIOD 11 1202.85

12. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.5

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 45
2 123 45.00 78.00
3 315 84.00 231.00
4 400 199.50 200.50
5 545 299.75 245.25
6 600 422.38 177.63
7 756 511.19 244.81
8 100 633.59 -533.59
9 2,345 366.80 1,978.20
10 1,600 1,355.90 244.10

THE MEAN SQUARE ERROR 500,985.79

THE FORECAST FOR PERIOD 11 1477.95

13. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 1

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============
Page 7
forecasting

1 145
2 280 145.00 135.00
3 390 280.00 110.00
4 410 390.00 20.00
5 565 410.00 155.00
6 670 565.00 105.00
7 780 670.00 110.00
8 890 780.00 110.00
9 999 890.00 109.00
10 1,230 999.00 231.00

THE MEAN SQUARE ERROR 17,246.33

THE FORECAST FOR PERIOD 11 1230.00

14. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.3

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10
2 56 10.00 46.00
3 200 23.80 176.20
4 400 76.66 323.34
5 100 173.66 -73.66
6 54 151.56 -97.56
7 660 122.29 537.71
8 1,000 283.61 716.39
9 90 498.52 -408.52
10 565 375.97 189.03

THE MEAN SQUARE ERROR 128,625.45

THE FORECAST FOR PERIOD 11 432.68

15. FORECASTING WITH EXPONENTIAL SMOOTHING

Page 8
forecasting
**************************************

THE SMOOTHING CONSTANT IS 0

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 1
2 5 1.00 4.00
3 10 1.00 9.00
4 200 1.00 199.00
5 500 1.00 499.00
6 1,000 1.00 999.00
7 2,300 1.00 2,299.00
8 5,800 1.00 5,799.00
9 9,900 1.00 9,899.00
10 12,450 1.00 12,449.00

THE MEAN SQUARE ERROR 32,574,256.00

THE FORECAST FOR PERIOD 11 1.00

16. FORECASTING WITH EXPONENTIAL SMOOTHING

**************************************

THE SMOOTHING CONSTANT IS 0.2

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12
2 13 12.00 1.00
3 14 12.20 1.80
4 15 12.56 2.44
5 16 13.05 2.95
6 17 13.64 3.36
7 18 14.31 3.69
8 19 15.05 3.95
9 20 15.84 4.16
10 21 16.67 4.33

Page 9
forecasting

THE MEAN SQUARE ERROR 10.61

THE FORECAST FOR PERIOD 11 17.54

17. FORECASTING WITH LINEAR TREND

*****************************

THE LINEAR TREND EQUATION:

T = 11 + 1 t

where T = trend value of the time series in period t

T = -18.733 + 60.406 t

where T = trend value of the time series in period t

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10 41.67 -31.67
2 56 102.08 -46.08
3 200 162.49 37.52
4 400 222.89 177.11
5 100 283.30 -183.30
6 54 343.70 -289.70
7 660 404.11 255.89
8 1,000 464.52 535.49
Page 14
forecasting
9 90 524.92 -434.92
10 565 585.33 -20.33

THE MEAN SQUARE ERROR 69,522.09

THE FORECAST FOR PERIOD 11 645.73
THE FORECAST FOR PERIOD 12 706.14
THE FORECAST FOR PERIOD 13 766.55
THE FORECAST FOR PERIOD 14 826.95
THE FORECAST FOR PERIOD 15 887.36
THE FORECAST FOR PERIOD 16 947.76
THE FORECAST FOR PERIOD 17 1008.17
THE FORECAST FOR PERIOD 18 1068.58
THE FORECAST FOR PERIOD 19 1128.98
THE FORECAST FOR PERIOD 20 1189.39
THE FORECAST FOR PERIOD 21 1249.79
THE FORECAST FOR PERIOD 22 1310.20

23. FORECASTING WITH LINEAR TREND

*****************************

THE LINEAR TREND EQUATION:

T = -4018.6 + 1315.491 t

where T = trend value of the time series in period t

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 1 -2,703.11 2,704.11
2 5 -1,387.62 1,392.62
3 10 -72.13 82.13
4 200 1,243.36 -1,043.36
5 500 2,558.86 -2,058.86
6 1,000 3,874.35 -2,874.35
7 2,300 5,189.84 -2,889.84
8 5,800 6,505.33 -705.33
9 9,900 7,820.82 2,079.18
10 12,450 9,136.31 3,313.69

THE MEAN SQUARE ERROR 4,699,987.30

Page 15
forecasting
THE FORECAST FOR PERIOD 11 10451.80
THE FORECAST FOR PERIOD 12 11767.29
THE FORECAST FOR PERIOD 13 13082.78
THE FORECAST FOR PERIOD 14 14398.27
THE FORECAST FOR PERIOD 15 15713.77
THE FORECAST FOR PERIOD 16 17029.26
THE FORECAST FOR PERIOD 17 18344.75
THE FORECAST FOR PERIOD 18 19660.24
THE FORECAST FOR PERIOD 19 20975.73
THE FORECAST FOR PERIOD 20 22291.22
THE FORECAST FOR PERIOD 21 23606.71
THE FORECAST FOR PERIOD 22 24922.20

24. FORECASTING WITH LINEAR TREND

*****************************

THE LINEAR TREND EQUATION:

T = -2.3 + 11.5 t

where T = trend value of the time series in period t

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12 9.20 2.80
2 16 20.70 -4.70
3 23 32.20 -9.20
4 65 43.70 21.30
5 45 55.20 -10.20

THE MEAN SQUARE ERROR 134.46

THE FORECAST FOR PERIOD 6 66.70
THE FORECAST FOR PERIOD 7 78.20
THE FORECAST FOR PERIOD 8 89.70
THE FORECAST FOR PERIOD 9 101.20
THE FORECAST FOR PERIOD 10 112.70
THE FORECAST FOR PERIOD 11 124.20
THE FORECAST FOR PERIOD 12 135.70
THE FORECAST FOR PERIOD 13 147.20
THE FORECAST FOR PERIOD 14 158.70
THE FORECAST FOR PERIOD 15 170.20
THE FORECAST FOR PERIOD 16 181.70
Page 16
forecasting
THE FORECAST FOR PERIOD 17 193.20

25. FORECASTING WITH LINEAR TREND

*****************************

THE LINEAR TREND EQUATION:

T = 6.788 + 2.469 t

where T = trend value of the time series in period t

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12 9.26 2.74
2 13 11.73 1.27
3 15 14.20 0.81
4 18 16.66 1.34
5 19 19.13 -0.13
6 19 21.60 -2.60
7 20 24.07 -4.07
8 23 26.54 -3.54
9 24 29.01 -5.01
10 33 31.48 1.52
11 36 33.95 2.05
12 42 36.42 5.58

THE MEAN SQUARE ERROR 9.19

THE FORECAST FOR PERIOD 13 38.89
THE FORECAST FOR PERIOD 14 41.35
THE FORECAST FOR PERIOD 15 43.82
THE FORECAST FOR PERIOD 16 46.29
THE FORECAST FOR PERIOD 17 48.76

26. FORECASTING WITH TREND AND SEASONAL COMPONENTS

**********************************************

SEASON SEASONAL INDEX

------ --------------

1 1.000
2 1.000
Page 17
forecasting
3 1.000
4 1.000
5 1.000

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 12 12.00 0.00
2 13 13.00 0.00
3 14 14.00 0.00
4 15 15.00 0.00
5 16 16.00 0.00
6 17 17.00 0.00
7 18 18.00 0.00
8 19 19.00 0.00
9 20 20.00 0.00
10 21 21.00 0.00

THE MEAN SQUARE ERROR 0.00

THE FORECAST FOR PERIOD 11 22.00
THE FORECAST FOR PERIOD 12 23.00
THE FORECAST FOR PERIOD 13 24.00
THE FORECAST FOR PERIOD 14 25.00
THE FORECAST FOR PERIOD 15 26.00

27. FORECASTING WITH TREND AND SEASONAL COMPONENTS

**********************************************

SEASON SEASONAL INDEX

------ --------------

1 0.219
2 2.515
3 0.907
4 0.343
5 1.016

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 10 0.86 9.14
Page 18
forecasting
2 9 34.69 -25.69
3 23 21.48 1.52
4 5 11.51 -6.51
5 34 44.16 -10.16
6 7 11.68 -4.68
7 110 159.03 -49.03
8 15 66.33 -51.33
9 68 28.47 39.53
10 72 94.40 -22.40

THE MEAN SQUARE ERROR 801.59

THE FORECAST FOR PERIOD 11 22.51
THE FORECAST FOR PERIOD 12 283.37
THE FORECAST FOR PERIOD 13 111.17
THE FORECAST FOR PERIOD 14 45.42
THE FORECAST FOR PERIOD 15 144.64

28. FORECASTING WITH TREND AND SEASONAL COMPONENTS

**********************************************

SEASON SEASONAL INDEX

------ --------------

1 0.987
2 1.086
3 0.969
4 1.008
5 0.951

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 110 83.00 27.00

2 229 229.69 -0.69
3 340 328.39 11.61
4 465 470.14 -5.14
5 565 564.91 0.09
6 700 711.80 -11.80
7 890 921.52 -31.52
8 915 945.66 -30.66
9 1,015 1,112.41 -97.41
10 1,300 1,171.03 128.97

Page 19
forecasting

THE MEAN SQUARE ERROR 2,908.65

THE FORECAST FOR PERIOD 11 1340.60
THE FORECAST FOR PERIOD 12 1613.35
THE FORECAST FOR PERIOD 13 1562.94
THE FORECAST FOR PERIOD 14 1754.68
THE FORECAST FOR PERIOD 15 1777.15

29. FORECASTING WITH TREND AND SEASONAL COMPONENTS

**********************************************

SEASON SEASONAL INDEX

------ --------------

1 1.310
2 0.912
3 0.627
4 1.058
5 1.093

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

1 45 -91.60 136.60
2 123 85.74 37.26
3 315 161.68 153.32
4 400 446.15 -46.15
5 545 639.84 -94.84
6 600 982.27 -382.27
7 756 833.26 -77.26
8 100 675.42 -575.42
9 2,345 1,312.97 1,032.03
10 1,600 1,535.10 64.90

THE MEAN SQUARE ERROR 160,718.13

THE FORECAST FOR PERIOD 11 2056.13
THE FORECAST FOR PERIOD 12 1580.78
THE FORECAST FOR PERIOD 13 1189.16
THE FORECAST FOR PERIOD 14 2179.79
THE FORECAST FOR PERIOD 15 2430.36

30. FORECASTING WITH TREND AND SEASONAL COMPONENTS

Page 20
forecasting
**********************************************

SEASON SEASONAL INDEX

------ --------------

1 1.025
2 1.013
3 1.046
4 0.898
5 1.018

TIME PERIOD TIME SERIES VALUE FORECAST FORECAST ERROR

=========== ================= ======== ==============

STATE 1 2 3 4 5 6 7 8 9 10
***** ***** ***** ***** ***** ***** ***** ***** ***** ***** *****

**********************************************

STATE PROBABILITY
***** ***********

1 0.189
2 0.040
3 0.121
4 0.042
5 0.088
6 0.057
7 0.166
8 0.104
9 0.079
10 0.115

Page 7
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-06-2014 16:53:49

Module/submodel: Markov Analysis

Problem title: (untitled)
Number of transitions: 0

Data and Results ----------

Original Data
Initial State 1 State 2 State 3 State 4 State 5
----------------------------------------------------------------------------
State 1 0 1 0 0 0 0
State 2 0 1 0 0 0 0
State 3 0 0 1 0 0 0
State 4 0 0 0 1 0 0
State 5 0 0 0 0 1 0

Results - Steady state matrix

State 1 State 2 State 3 State 4 State 5

--------------------------------------------------------------------------------
State 1 1 0 0 0 0
State 2 1 0 0 0 0
State 3 1 0 0 0 0
State 4 1 0 0 0 0
State 5 1 0 0 0 0
--------------------------------------------------------------------------------
End number (given init) 0 0 0 0 0
Steady State 1 0 0 0 0

State analysis ----------

State 1 Absorbing 1
State 2 Transient
State 3 Transient
State 4 Transient
State 5 Transient

Matrices ----------

Markov Matrix (sorted if necessary)

State 1 State 2 State 3 State 4 State 5
-----------------------------------------------------------------
State 1 1 0 0 0 0
State 2 1 0 0 0 0
State 3 0 1 0 0 0
State 4 0 0 1 0 0
State 5 0 0 0 1 0

B matrix

State 2 State 3 State 4 State 5

------------------------------------------------------
State 2 0 0 0 0
State 3 1 0 0 0
State 4 0 1 0 0
State 5 0 0 1 0

F matrix (I-B)^-1

State 2 State 3 State 4 State 5

------------------------------------------------------
State 2 1 0 0 0
State 3 1 1 0 0
State 4 1 1 1 0
State 5 1 1 1 1

FA matrix

State 1
---------------------
State 2 1
State 3 1
State 4 1
State 5 1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 13:02:17

Module/submodel: Markov Analysis

Problem title: (untitled)
Number of transitions: 2

Data and Results ----------

Original Data
Initial State 1 State 2 State 3 State 4
-----------------------------------------------------------------
State 1 .1 .1 .2 .3 .4
State 2 .9 .9 0 0 .1
State 3 .4 .1 .1 .1 .7
State 4 .5 .2 .3 .4 .1

Results - 2 transition matrix

State 1 State 2 State 3 State 4

---------------------------------------------------------------------
State 1 .3 .17 .22 .31
State 2 .11 .21 .31 .37
State 3 .25 .24 .32 .19
State 4 .35 .11 .14 .4
---------------------------------------------------------------------
End number (given init) .404 .357 .499 .64
Steady State .2714 .174 .2333 .3214

Multiplications ----------

State 1 State 2 State 3 State 4

---------------------------------------------------------------------
End of Period 1
State 1 .1 .2 .3 .4
State 2 .9 0 0 .1
State 3 .1 .1 .1 .7
State 4 .2 .3 .4 .1
End Number (given init) .96 .21 .27 .46
End of Period 2
State 1 .3 .17 .22 .31
State 2 .11 .21 .31 .37
State 3 .25 .24 .32 .19
State 4 .35 .11 .14 .4
End Number (given init) .404 .357 .499 .64

State analysis ----------

State 1 Recurrent 1
State 2 Recurrent 1
State 3 Recurrent 1
State 4 Recurrent 1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 13:04:13

Module/submodel: Markov Analysis

Problem title: (untitled)
Number of transitions: 4

Data and Results ----------

Original Data
Initial State 1 State 2 State 3 State 4
-----------------------------------------------------------------
State 1 1 .1 .4 .3 .2
State 2 2 .7 .1 .1 .1
State 3 3 .3 .4 .1 .2
State 4 4 .5 .2 .2 .1

Results - 4 transition matrix

Data and Results ----------

Original Data
Initial State 1 State 2 State 3
------------------------------------------------------
State 1 1 .2 .3 .5
State 2 1 .1 .3 .6
State 3 1 .4 .2 .4

Results - 1 transition matrix

State 1 State 2 State 3

----------------------------------------------------------
State 1 .2 .3 .5
State 2 .1 .3 .6
State 3 .4 .2 .4
----------------------------------------------------------
End number (given init) .7 .8 1.5
Steady State .2703 .2523 .4775

Multiplications ----------

State 1 State 2 State 3

State 1 State 2 State 3

----------------------------------------------------------
End of Period 1
State 1 .2 .3 .5
State 2 .1 .3 .6
State 3 .4 .2 .4
End Number (given init) .7 .8 1.5
End of Period 2
State 1 .27 .25 .48
State 2 .29 .24 .47
State 3 .26 .26 .48
End Number (given init) .82 .75 1.43
End of Period 3
State 1 .271 .252 .477
State 2 .27 .253 .477
State 3 .27 .252 .478
End Number (given init) .811 .757 1.432
End of Period 4
State 1 .2702 .2523 .4775
State 2 .2701 .2523 .4776
State 3 .2704 .2522 .4774
End Number (given init) .8107 .7568 1.4325

State analysis ----------

State 1 Recurrent 1
State 2 Recurrent 1
State 3 Recurrent 1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 13:51:25

Module/submodel: Markov Analysis

Problem title: (untitled)
Number of transitions: 5

Data and Results ----------

Original Data
Initial State 1 State 2 State 3
------------------------------------------------------
State 1 1 .2 .3 .5
State 2 1 .1 .3 .6
State 3 1 .4 .2 .4

Results - 5 transition matrix

State 1 State 2 State 3

----------------------------------------------------------
State 1 .2703 .2523 .4775
State 2 .2703 .2522 .4775
State 3 .2703 .2523 .4775
----------------------------------------------------------
End number (given init) .8108 .7568 1.4324
Steady State .2703 .2523 .4775

Multiplications ----------

State 1 State 2 State 3

Data and Results ----------

Original Data
Initial State 1 State 2
-------------------------------------------
State 1 1 .5 .5
State 2 5 .2 .8

Results - 10 transition matrix

State 1 State 2
-----------------------------------------------
State 1 .2857 .7143
State 2 .2857 .7143
-----------------------------------------------
End number (given init) 1.7143 4.2857
Steady State .2857 .7143

Multiplications ----------

State 1 State 2
-----------------------------------------------
End of Period 1
State 1 .5 .5
State 2 .2 .8
End Number (given init) 1.5 4.5
End of Period 2
State 1 .35 .65
State 2 .26 .74
End Number (given init) 1.65 4.35
End of Period 3
State 1 .305 .695
State 2 .278 .722
End Number (given init) 1.695 4.305
End of Period 4
State 1 .2915 .7085
State 2 .2834 .7166
End Number (given init) 1.7085 4.2915
End of Period 5
State 1 .2875 .7126
State 2 .285 .715
End Number (given init) 1.7126 4.2875
End of Period 6
State 1 .2862 .7138
State 2 .2855 .7145
End Number (given init) 1.7138 4.2862
End of Period 7
State 1 .2859 .7141
State 2 .2857 .7143
End Number (given init) 1.7141 4.2859
End of Period 8
State 1 .2858 .7142
State 2 .2857 .7143
End Number (given init) 1.7142 4.2858
End of Period 9
State 1 .2857 .7143
State 2 .2857 .7143
End Number (given init) 1.7143 4.2857
End of Period 10
State 1 .2857 .7143
State 2 .2857 .7143
End Number (given init) 1.7143 4.2857
State analysis ----------

State 1 Recurrent 1
State 2 Recurrent 1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 16:27:47

Module/submodel: Markov Analysis

Problem title: (untitled)
Number of transitions: 5

Data and Results ----------

Original Data
Initial State 1 State 2
-------------------------------------------
State 1 1 .5 .5
State 2 3 .35 .65

Results - 5 transition matrix

State 1 State 2
-----------------------------------------------
State 1 .4118 .5882
State 2 .4117 .5883
-----------------------------------------------
End number (given init) 1.647 2.353
Steady State .4117 .5882

Multiplications ----------

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P1d+1 +2P2d-1 +2P2d+2 +3P3d-2

Goal/Cnstrnt 1: 10X1 +12X2 + d-1 -d+1 =100
Goal/Cnstrnt 2: 22X1 +34X2 + d-2 -d+2 =200

Summary of results

Decision variable analysis

X1 9.09
X2 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 18.18
Priority 3 0

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 100 0 9.09
Goal/Cnstrnt 2 200 0 0

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 -3.45 1 -.45 -1 .45 9.09
Goal/Cnstrnt 2 1 1.55 0 .05 0 -.05 9.09
Priority 3 0 0 0 -3 0 0 0
Priority 2 0 -6.91 0 -.91 -2 -1.09 18.18
Priority 1 0 0 0 0 -1 0 0
(untitled)

X2
8.33

Constraints

5.88

9.09,0.
9.09 10
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 10:52:08

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +2P3d+1 +4P1d-1 +1P2d+2 +4P3d-2

Goal/Cnstrnt 1: 12X1 +15X2 + d-1 -d+1 =51
Goal/Cnstrnt 2: 19X1 +23X2 + d-2 -d+2 =65

Summary of results

Decision variable analysis

X1 0
X2 3.4

Priority analysis Nonachievement

Priority 1 0
Priority 2 13.2
Priority 3 0

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 51 0 0
Goal/Cnstrnt 2 65 13.2 0

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 -.6 0 1.53 -1 -1.53 1 13.2
Goal/Cnstrnt 2 .8 1 .07 0 -.07 0 3.4
Priority 3 0 0 0 -4 -2 0 0
Priority 2 -.6 0 1.53 -1 -1.53 0 13.2
Priority 1 0 0 -4 0 0 0 0
(untitled)

0.,3.4
X2
3.4

Constraints
2.83

3.42 4.25
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 10:53:18

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize
Goal/Cnstrnt 1: 13X1 +19X2 + d-1 -d+1 =43
Goal/Cnstrnt 2: 21X1 +24X2 + d-2 -d+2 =51

Summary of results

Decision variable analysis

X1 0
X2 2.13

Priority analysis Nonachievement

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 43 0 2.63
Goal/Cnstrnt 2 51 0 0

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 -3.63 0 1 -.79 -1 .79 2.63
Goal/Cnstrnt 2 .88 1 0 .04 0 -.04 2.13

(untitled)

X2
2.26
0.,2.13
2.13
Constraints

2.43 3.31
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 10:54:46

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +3P2d+1 +4P1d-1 +1P3d+2 +4P2d-2

Goal/Cnstrnt 1: 14X1 +28X2 + d-1 -d+1 =121
Goal/Cnstrnt 2: 23X1 +42X2 + d-2 -d+2 =161

Summary of results

Decision variable analysis

X1 0
X2 4.32

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 20.5

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 121 0 0
Goal/Cnstrnt 2 161 20.5 0

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 -2 0 1.5 -1 -1.5 1 20.5
Goal/Cnstrnt 2 .5 1 .04 0 -.04 0 4.32
Priority 3 -2 0 1.5 -1 -1.5 0 20.5
Priority 2 0 0 0 -4 -3 0 0
Priority 1 0 0 -4 0 0 0 0
(untitled)

X20.,4.32
4.32

3.83 Constraints

7 8.64
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 10:58:15

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P3d+1 +2P1d-1 +3P1d+2 +4P2d-2

Goal/Cnstrnt 1: 112X1 +234X2 + d-1 -d+1 =1213
Goal/Cnstrnt 2: 213X1 +412X2 + d-2 -d+2 =3124

Summary of results

Decision variable analysis

X1 14.67
X2 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 1718.67

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 1213 429.67 0
Goal/Cnstrnt 2 3124 0 0

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 1 1.93 0 .0 0 .0 14.67
Goal/Cnstrnt 2 0 -17.36 -1 .53 1 -.53 429.67
Priority 3 0 -69.45 -4 2.1 0 -2.1 1718.67
Priority 2 0 0 0 -4 0 0 0
Priority 1 0 0 -2 0 0 -3 0
(untitled)

X2
7.58

Constraints

5.18

14.67,0.
10.83 14.67
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 11:00:20

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +3P2d+1 +1P4d-1 +1P3d+2 +2P4d-2

Goal/Cnstrnt 1: 11X1 +13X2 + d-1 -d+1 =1213
Goal/Cnstrnt 2: 12X1 +14X2 + d-2 -d+2 =3124

Summary of results

Decision variable analysis

X1 110.27
X2 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 3601.46

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 1213 0 0
Goal/Cnstrnt 2 3124 0 1800.73

Final Tableau ----------

X1 X2 d- 1 d- 2 d+ 1 d+ 2 RHS
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 1 1.18 .09 0 -.09 0 110.27
Goal/Cnstrnt 2 0 -.18 -1.09 1 1.09 -1 1800.73
Priority 4 0 -.36 -3.18 0 2.18 -2 3601.46
Priority 3 0 0 0 0 0 -1 0
Priority 2 0 0 0 0 -3 0 0
Priority 1 0 0 0 0 0 0 0
(untitled)

X2
223.14

Constraints

93.31

110.27,0.
110.27 260.33
X1
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 11:55:17

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P1d+1 +3P2d-1 +1P4d+2 +3P2d-2 +2P3d+3 +1P4d-3

Goal/Cnstrnt 1: 100X1 +120X2 +140X3 + d-1 -d+1 =1000
Goal/Cnstrnt 2: 200X1 +220X2 +240X3 + d-2 -d+2 =1500
Goal/Cnstrnt 3: 300X1 +320X2 +340X3 + d-3 -d+3 =2000

Summary of results

Decision variable analysis

X1 0
X2 0
X3 7.14

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 857.14
Priority 4 214.29

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 1000 0 0
Goal/Cnstrnt 2 1500 214.29 0
Goal/Cnstrnt 3 2000 428.57 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 -28.57 -14.29 0 1.71 -1 0 -1.71
Goal/Cnstrnt 2 -57.14 -28.57 0 2.43 0 -1 -2.43
Goal/Cnstrnt 3 .71 .86 1 .01 0 0 -.01
Priority 4 -28.57 -14.29 0 1.71 -1 -1 -1.71
Priority 3 -114.29 -57.14 0 4.86 0 -2 -4.86
Priority 2 0 0 0 -3 -3 0 0
Priority 1 0 0 0 0 0 0 -4

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 1 0 214.29
Goal/Cnstrnt 2 0 1 428.57
Goal/Cnstrnt 3 0 0 7.14
Priority 4 0 0 214.29
Priority 3 0 0 857.14
Priority 2 0 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 11:57:23

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +3P4d+1 +1P2d-1 +4P2d+2 +3P1d-2 +2P4d+3 +1P3d-3

Goal/Cnstrnt 1: 12X1 +16X2 +20X3 + d-1 -d+1 =100
Goal/Cnstrnt 2: 13X1 +15X2 +18X3 + d-2 -d+2 =120
Goal/Cnstrnt 3: 14X1 +16X2 +20X3 + d-3 -d+3 =140

Summary of results

Decision variable analysis

X1 0
X2 0
X3 6.67

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 6.67
Priority 4 100

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 100 33.33 0
Goal/Cnstrnt 2 120 0 0
Goal/Cnstrnt 3 140 0 6.67

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 .72 .83 1 0 .06 0 0
Goal/Cnstrnt 2 2.44 .67 0 -1 1.11 0 1
Goal/Cnstrnt 3 -.44 -.67 0 0 -1.11 1 0
Priority 4 7.33 2 0 -3 3.33 0 0
Priority 3 -.44 -.67 0 0 -1.11 0 0
Priority 2 0 0 0 -1 0 0 0
Priority 1 0 0 0 0 -3 0 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 -.06 0 6.67
Goal/Cnstrnt 2 -1.11 0 33.33
Goal/Cnstrnt 3 1.11 -1 6.67
Priority 4 -3.33 -2 100
Priority 3 1.11 -1 6.67
Priority 2 -4 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 12:00:39

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P4d+1 +2P3d-1

Goal/Cnstrnt 1: 9X1 +6X2 +3X3 + d-1 -d+1 =13
Goal/Cnstrnt 2: 14X1 +10X2 +4X3 + d-2 -d+2 =19
Goal/Cnstrnt 3: 15X1 +6X2 +1X3 + d-3 -d+3 =23

Summary of results

Decision variable analysis

X1 1.53
X2 0
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 .8

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 13 .8 0
Goal/Cnstrnt 2 19 2.47 0
Goal/Cnstrnt 3 23 0 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 -4.4 -3.07 0 -1 .93 0
Goal/Cnstrnt 2 1 .4 .07 0 0 .07 0
Goal/Cnstrnt 3 0 -2.4 -2.4 -1 0 .6 1
Priority 4 0 -2.4 -2.4 -1 0 .6 0
Priority 3 0 0 0 -2 0 0 0
Priority 2 0 0 0 0 0 0 0
Priority 1 0 0 0 0 0 0 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 1 -.93 2.47
Goal/Cnstrnt 2 0 -.07 1.53
Goal/Cnstrnt 3 0 -.6 .8
Priority 4 0 -.6 .8
Priority 3 0 0 0
Priority 2 0 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 11:59:08

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P1d+1 +2P4d-1 +2P1d+2 +1P2d+3 +3P4d-3

Goal/Cnstrnt 1: 9X1 +6X2 +3X3 + d-1 -d+1 =13
Goal/Cnstrnt 2: 14X1 +10X2 +4X3 + d-2 -d+2 =19
Goal/Cnstrnt 3: 15X1 +6X2 +1X3 + d-3 -d+3 =23

Summary of results

Decision variable analysis

X1 1.36
X2 0
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 9.5

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 13 0 .79
Goal/Cnstrnt 2 19 0 0
Goal/Cnstrnt 3 23 0 2.64

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 -.43 .43 1 -.64 0 -1
Goal/Cnstrnt 2 1 .71 .29 0 .07 0 0
Goal/Cnstrnt 3 0 -4.71 -3.29 0 -1.07 1 0
Priority 4 0 -15 -9 0 -4.5 0 -2
Priority 3 0 0 0 0 0 0 0
Priority 2 0 0 0 0 0 0 0
Priority 1 0 0 0 0 0 0 -1

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 .64 0 .79
Goal/Cnstrnt 2 -.07 0 1.36
Goal/Cnstrnt 3 1.07 -1 2.64
Priority 4 4.5 -3 9.5
Priority 3 0 0 0
Priority 2 0 -1 0
Priority 1 -2 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 08:49:47

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P3d+1 +4P2d-1 +2P4d+2 +1P3d-2 +4P1d+3 +3P2d-3 +3P4d+4 +1P2d-4

Goal/Cnstrnt 1: 12X1 +15X2 +18X3 +23X4 + d-1 -d+1 =120
Goal/Cnstrnt 2: 16X1 +19X2 +24X3 +27X4 + d-2 -d+2 =140
Goal/Cnstrnt 3: 17X1 +25X2 +34X3 +46X4 + d-3 -d+3 =165
Goal/Cnstrnt 4: 20X1 +26X2 +29X3 +32X4 + d-4 -d+4 =187

Summary of results

Decision variable analysis

X1 9.71
X2 0
X3 0
X4 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 14.12
Priority 3 0
Priority 4 51.94

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 120 0 3.53
Goal/Cnstrnt 2 140 15.29 0
Goal/Cnstrnt 3 165 0 0
Goal/Cnstrnt 4 187 7.12 0

Final Tableau ----------

X1 X2 X3 X4 d- 1 d- 2 d- 3
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 -2.65 -6 -9.47 1 0 -.71
Goal/Cnstrnt 2 1 1.47 2 2.71 0 0 .06
Goal/Cnstrnt 3 0 3.41 11 22.12 0 0 1.18
Goal/Cnstrnt 4 0 4.53 8 16.29 0 -1 .94
Priority 4 0 19.29 49 98.94 0 -2 5.41
Priority 3 0 0 0 0 0 -1 0
Priority 2 0 -10.59 -24 -37.88 0 0 -5.82
Priority 1 0 0 0 0 0 0 0

d- 4 d+ 1 d+ 2 d+ 3 d+ 4 RHS
----------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 -1 0 .71 0 3.53
Goal/Cnstrnt 2 0 0 0 -.06 0 9.71
Goal/Cnstrnt 3 -1 0 0 -1.18 1 7.12
Goal/Cnstrnt 4 0 0 1 -.94 0 15.29
Priority 4 -3 0 0 -5.41 0 51.94
Priority 3 0 -1 0 0 0 0
Priority 2 -1 -4 0 2.82 0 14.12
Priority 1 0 0 0 -4 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 08:52:26

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P2d+1 +3P1d-1 +1P3d+2 +4P2d-2 +2P4d+3 +3P1d-3 +3P1d+4 +2P4d-4

Goal/Cnstrnt 1: 10X1 +9X2 +19X3 +27X4 + d-1 -d+1 =76
Goal/Cnstrnt 2: 6X1 +12X2 +17X3 +25X4 + d-2 -d+2 =85
Goal/Cnstrnt 3: 7X1 +19X2 +27X3 +36X4 + d-3 -d+3 =99
Goal/Cnstrnt 4: 13X1 +19X2 +21X3 +32X4 + d-4 -d+4 =100

Summary of results

Decision variable analysis

X1 0
X2 1.77
X3 3.16
X4 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 40.09
Priority 3 0
Priority 4 39.95

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 76 0 0
Goal/Cnstrnt 2 85 0 10.02
Goal/Cnstrnt 3 99 19.98 0
Goal/Cnstrnt 4 100 0 0

Final Tableau ----------

X1 X2 X3 X4 d- 1 d- 2 d- 3
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 8.55 0 0 3.85 .66 0 -1
Goal/Cnstrnt 2 -3.8 0 0 -.1 -.41 1 0
Goal/Cnstrnt 3 .42 0 1 1.31 .11 0 0
Goal/Cnstrnt 4 .22 1 0 .24 -.12 0 0
Priority 4 17.09 0 0 7.7 1.33 0 -2
Priority 3 0 0 0 0 0 0 0
Priority 2 -15.19 0 0 -.4 -1.65 0 0
Priority 1 0 0 0 0 -3 0 -3

d- 4 d+ 1 d+ 2 d+ 3 d+ 4 RHS
----------------------------------------------------------------------------------
Goal/Cnstrnt 1 .69 -.66 0 1 -.69 19.98
Goal/Cnstrnt 2 -.44 .41 -1 0 .44 10.02
Goal/Cnstrnt 3 -.05 -.11 0 0 .05 3.16
Goal/Cnstrnt 4 .11 .12 0 0 -.11 1.77
Priority 4 -.63 -1.33 0 0 -1.37 39.95
Priority 3 0 0 -1 0 0 0
Priority 2 -1.74 -2.35 -4 0 1.74 40.09
Priority 1 0 0 0 0 -3 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 09:13:41

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P1d+1 +2P3d-1 +1P2d+2 +3P4d-2 +3P4d+3 +1P1d-3 +2P3d+4 +4P1d-4

Goal/Cnstrnt 1: 6X1 +11X2 +14X3 +20X4 + d-1 -d+1 =14
Goal/Cnstrnt 2: 5X1 +15X2 +19X3 +25X4 + d-2 -d+2 =23
Goal/Cnstrnt 3: 9X1 +16X2 +20X3 +36X4 + d-3 -d+3 =36
Goal/Cnstrnt 4: 2X1 +12X2 +22X3 +26X4 + d-4 -d+4 =41

Summary of results

Decision variable analysis

X1 0
X2 0
X3 1.86
X4 0

Priority analysis Nonachievement

Priority 1 48.36
Priority 2 12.41
Priority 3 0
Priority 4 3.82

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 14 12.09 0
Goal/Cnstrnt 2 23 12.41 0
Goal/Cnstrnt 3 36 1.27 0
Goal/Cnstrnt 4 41 0 0

Final Tableau ----------

X1 X2 X3 X4 d- 1 d- 2 d- 3
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 .09 .55 1 1.18 0 0 0
Goal/Cnstrnt 2 -4.73 -3.36 0 -3.45 -1 0 0
Goal/Cnstrnt 3 -3.27 -4.64 0 -2.55 0 -1 0
Goal/Cnstrnt 4 -7.18 -5.09 0 -12.36 0 0 -1
Priority 4 -21.55 -15.27 0 -37.09 0 -3 -3
Priority 3 0 0 0 0 -2 0 0
Priority 2 -3.27 -4.64 0 -2.55 0 -1 0
Priority 1 -18.91 -13.45 0 -13.82 -4 0 -1

d- 4 d+ 1 d+ 2 d+ 3 d+ 4 RHS
----------------------------------------------------------------------------------
Goal/Cnstrnt 1 .05 0 0 0 -.05 1.86
Goal/Cnstrnt 2 .64 1 0 0 -.64 12.09
Goal/Cnstrnt 3 .86 0 1 0 -.86 12.41
Goal/Cnstrnt 4 .91 0 0 1 -.91 1.27
Priority 4 2.73 0 0 0 -2.73 3.82
Priority 3 0 0 0 0 -2 0
Priority 2 .86 0 0 0 -.86 12.41
Priority 1 -1.45 0 0 0 -2.55 48.36
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 09:31:23

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P5d+1 +3P2d-1 +2P3d+2 +4P6d-2 +1P4d+3 +7P2d-3

Goal/Cnstrnt 1: 6X1 +13X2 +21X3 + d-1 -d+1 =52
Goal/Cnstrnt 2: 12X1 +14X2 +20X3 + d-2 -d+2 =68
Goal/Cnstrnt 3: 18X1 +31X2 +45X3 + d-3 -d+3 =79

Summary of results

Decision variable analysis

X1 0
X2 0
X3 2.48

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 32.43
Priority 5 0
Priority 6 73.9

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 52 0 0
Goal/Cnstrnt 2 68 0 18.48
Goal/Cnstrnt 3 79 32.43 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 -5.14 -3.14 0 2.14 0 -1 -2.14
Goal/Cnstrnt 2 6.29 1.62 0 -.95 1 0 .95
Goal/Cnstrnt 3 .29 .62 1 .05 0 0 -.05
Priority 6 25.14 6.48 0 -3.81 0 0 3.81
Priority 5 0 0 0 0 0 0 -1
Priority 4 -5.14 -3.14 0 2.14 0 -1 -2.14
Priority 3 0 0 0 0 0 0 0
Priority 2 0 0 0 -3 0 -7 0
Priority 1 0 0 0 0 0 0 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 0 1 32.43
Goal/Cnstrnt 2 -1 0 18.48
Goal/Cnstrnt 3 0 0 2.48
Priority 6 -4 0 73.9
Priority 5 0 0 0
Priority 4 0 0 32.43
Priority 3 -2 0 0
Priority 2 0 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 09:33:48

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P5d+1 +7P2d-1 +3P1d+2 +6P4d-2 +2P4d+3 +3P1d-3

Goal/Cnstrnt 1: 6X1 +7X2 +11X3 + d-1 -d+1 =19
Goal/Cnstrnt 2: 8X1 +9X2 +13X3 + d-2 -d+2 =29
Goal/Cnstrnt 3: 9X1 +10X2 +16X3 + d-3 -d+3 =39

Summary of results

Decision variable analysis

X1 0
X2 0
X3 2.44

Priority analysis Nonachievement

Priority 1 8.06
Priority 2 0
Priority 3 0
Priority 4 0
Priority 5 7.81

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 19 7.81 0
Goal/Cnstrnt 2 29 2.69 0
Goal/Cnstrnt 3 39 0 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 .56 .63 1 0 0 .06 0
Goal/Cnstrnt 2 .19 -.13 0 -1 0 .69 1
Goal/Cnstrnt 3 -.69 -.88 0 0 -1 .81 0
Priority 5 .19 -.13 0 -1 0 .69 0
Priority 4 0 0 0 0 -6 0 0
Priority 3 0 0 0 0 0 0 0
Priority 2 0 0 0 -7 0 0 0
Priority 1 -2.06 -2.63 0 0 -3 -.56 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 0 -.06 2.44
Goal/Cnstrnt 2 0 -.69 7.81
Goal/Cnstrnt 3 1 -.81 2.69
Priority 5 0 -.69 7.81
Priority 4 0 -2 0
Priority 3 0 0 0
Priority 2 0 0 0
Priority 1 0 -2.44 8.06
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:50:56

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +1P2d+1 +4P5d-1 +5P1d+2 +3P2d-2 +3P4d+3 +5P2d-3

Goal/Cnstrnt 1: 10X1 +21X2 +39X3 + d-1 -d+1 =112
Goal/Cnstrnt 2: 4X1 +31X2 +34X3 + d-2 -d+2 =113
Goal/Cnstrnt 3: 2X1 +41X2 +54X3 + d-3 -d+3 =114

Summary of results

Decision variable analysis

X1 4.86
X2 3.02
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 58.35
Priority 5 0

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 112 0 0
Goal/Cnstrnt 2 113 0 0
Goal/Cnstrnt 3 114 19.45 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 1 0 2.19 .14 -.09 0 -.14
Goal/Cnstrnt 2 0 0 -16.24 -.45 1.63 -1 .45
Goal/Cnstrnt 3 0 1 .81 -.02 .04 0 .02
Priority 5 0 0 0 -4 0 0 0
Priority 4 0 0 -48.72 -1.35 4.88 -3 1.35
Priority 3 0 0 0 0 0 0 0
Priority 2 0 0 0 0 -3 -5 -1
Priority 1 0 0 0 0 0 0 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 .09 0 4.86
Goal/Cnstrnt 2 -1.63 1 19.45
Goal/Cnstrnt 3 -.04 0 3.02
Priority 5 0 0 0
Priority 4 -4.88 0 58.35
Priority 3 0 0 0
Priority 2 0 0 0
Priority 1 -5 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:55:29

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P2d+1 +1P3d-1 +3P4d+2 +1P2d-2 +2P3d+3 +4P1d-3

Goal/Cnstrnt 1: 2.5X1 +3.5X2 +4.5X3 + d-1 -d+1 =10
Goal/Cnstrnt 2: 12.2X1 +14.2X2 +18.3X3 + d-2 -d+2 =13
Goal/Cnstrnt 3: 14.6X1 +21.6X2 +23.6X3 + d-3 -d+3 =15

Summary of results

Decision variable analysis

X1 1.07
X2 0
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 8.45
Priority 4 0

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 10 0 7.34
Goal/Cnstrnt 2 13 0 0
Goal/Cnstrnt 3 15 .56 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 .59 .75 1 -.2 0 -1
Goal/Cnstrnt 2 0 -4.61 -1.7 0 1.2 -1 0
Goal/Cnstrnt 3 1 1.16 1.5 0 .08 0 0
Priority 4 0 0 0 0 0 0 0
Priority 3 0 -8.62 -2.65 0 2.19 -2 -1
Priority 2 0 0 0 0 -1 0 -4
Priority 1 0 0 0 0 0 -4 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 .2 0 7.34
Goal/Cnstrnt 2 -1.2 1 .56
Goal/Cnstrnt 3 -.08 0 1.07
Priority 4 -3 0 0
Priority 3 -2.19 0 8.45
Priority 2 0 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:52:24

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P2d+1 +1P3d-1 +3P4d+2 +1P2d-2 +2P3d+3 +4P1d-3

Goal/Cnstrnt 1: 11X1 +41X2 +61X3 + d-1 -d+1 =120
Goal/Cnstrnt 2: 21X1 +51X2 +81X3 + d-2 -d+2 =160
Goal/Cnstrnt 3: 31X1 +71X2 +91X3 + d-3 -d+3 =200

Summary of results

Decision variable analysis

X1 .7
X2 1.1
X3 1.1

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 0

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 120 0 0
Goal/Cnstrnt 2 160 0 0
Goal/Cnstrnt 3 200 0 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 0 0 1 -.01 .07 -.04 .01
Goal/Cnstrnt 2 1 0 0 -.16 .09 .03 .16
Goal/Cnstrnt 3 0 1 0 .09 -.13 .06 -.09
Priority 4 0 0 0 0 0 0 0
Priority 3 0 0 0 -1 0 0 0
Priority 2 0 0 0 0 -1 0 -4
Priority 1 0 0 0 0 0 -4 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 -.07 .04 1.1
Goal/Cnstrnt 2 -.09 -.03 .7
Goal/Cnstrnt 3 .13 -.06 1.1
Priority 4 -3 0 0
Priority 3 0 -2 0
Priority 2 0 0 0
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:53:46

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +4P2d+1 +1P3d-1 +3P4d+2 +1P2d-2 +2P3d+3 +4P1d-3

Goal/Cnstrnt 1: 112X1 +213X2 +314X3 + d-1 -d+1 =1000
Goal/Cnstrnt 2: 115X1 +217X2 +318X3 + d-2 -d+2 =1467
Goal/Cnstrnt 3: 118X1 +223X2 +328X3 + d-3 -d+3 =1892

Summary of results

Decision variable analysis

X1 16.03
X2 0
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 3183.19
Priority 3 0
Priority 4 1130.7

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 1000 795.8 0
Goal/Cnstrnt 2 1467 376.9 0
Goal/Cnstrnt 3 1892 0 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 1 1.89 2.78 0 0 .01 0
Goal/Cnstrnt 2 0 -1.34 -2.68 -1 0 .95 1
Goal/Cnstrnt 3 0 .33 1.66 0 -1 .97 0
Priority 4 0 1 4.98 0 -3 2.92 0
Priority 3 0 0 0 -1 0 0 0
Priority 2 0 -5.36 -10.71 -4 -1 3.8 0
Priority 1 0 0 0 0 0 -4 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 0 -.01 16.03
Goal/Cnstrnt 2 0 -.95 795.8
Goal/Cnstrnt 3 1 -.97 376.9
Priority 4 0 -2.92 1130.7
Priority 3 0 -2 0
Priority 2 0 -3.8 3183.19
Priority 1 0 0 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 12:56:43

Module/submodel: Goal Programming

Problem title: (untitled)

Data and Summary ----------

Data

Minimize +3P4d+1 +1P2d-1 +3P2d+2 +1P4d-2 +3P4d+3 +2P1d-3

Goal/Cnstrnt 1: 10.3X1 +13X2 +21X3 + d-1 -d+1 =10
Goal/Cnstrnt 2: 10.3X1 +16X2 +24X3 + d-2 -d+2 =13
Goal/Cnstrnt 3: 10.3X1 +19X2 +28X3 + d-3 -d+3 =15

Summary of results

Decision variable analysis

X1 0
X2 .79
X3 0

Priority analysis Nonachievement

Priority 1 0
Priority 2 0
Priority 3 0
Priority 4 1.16

Constraint Analysis RHS d+ d-

Goal/Cnstrnt 1 10 .26 0
Goal/Cnstrnt 2 13 0 .37
Goal/Cnstrnt 3 15 0 0

Final Tableau ----------

X1 X2 X3 d- 1 d- 2 d- 3 d+ 1
---------------------------------------------------------------------------------------------
Goal/Cnstrnt 1 .54 1 1.47 0 0 .05 0
Goal/Cnstrnt 2 1.63 0 .42 0 1 -.84 0
Goal/Cnstrnt 3 -3.25 0 -1.84 -1 0 .68 1
Priority 4 -8.13 0 -5.11 -3 0 1.21 0
Priority 3 0 0 0 0 0 0 0
Priority 2 0 0 0 -1 0 0 0
Priority 1 0 0 0 0 0 -2 0

d+ 2 d+ 3 RHS
-------------------------------------------------
Goal/Cnstrnt 1 0 -.05 .79
Goal/Cnstrnt 2 -1 .84 .37
Goal/Cnstrnt 3 0 -.68 .26
Priority 4 -1 -4.21 1.16
Priority 3 0 0 0
Priority 2 -3 0 0
Priority 1 0 0 0
DP
PROBLEM 1:
MAX = 120 * A + 230 * B;
A <= 160;
B <= 150;
A + 2 * B <= 220;
Global optimal solution found at iteration: 0
Objective value: 26100.00

Variable Value Reduced Cost

A 160.0000 0.000000
B 30.00000 0.000000

Row Slack or Surplus Dual Price

1 26100.00 1.000000
2 0.000000 5.000000
3 120.0000 0.000000
4 0.000000 115.0000

PLEASE REMEMBER:

1. AFTER GETTING THE VALUES OF ALL THE VARIABLES AND OBJECTIVE FUNCTION FOR ANY
PROBLEMS HAVING BASIC FEASIBLE SOLUTION ,
SUBSTITUTE THE VARIABLES' VALUES IN THE OBJECTIVE FUNCTION AS WELL AS ALL
CONSTRAINTS EQUATIONS. IF THE EQUATIONS MATCH EXACTLY
AFTER SUBSTITUTION THEN THE PROBLEM VARIABLE VALUES WE GOT IN THE SOLUTION ARE
CORRECT.

2. THE SOLUTION IN DYNAMIC PROGRAMMING AND ANY LINEAR PROGRAMMING PROBLEM USING ANY
METHOD ESSENTIALLY INVOLVES THE DETERMINATION
OR FINDING OUT THE BEST POSSIBLE ANSWER OR SOLUTION WHICH IS CALLED OPTIMUM
SOLUTION.IF THERE ARE MANY SOLUTIONS
THEN THEY ARE CALLED MULTIPLE OPTIMAL SOLUTIONS AND THE BEST SOLUTION AMONG THE
VARIOUS ALTERNATIVE OPTIMAL SOLUTIONS IS CALLED
OPTIMUM SOLUTION WHICH IS THE BEST AMONG ALL THE ALTERNATIVES.

MAXIMIZATION PROBLEM:OBJECTIVE FUNCTION [PROFIT/REVENUE] IS MAXIMIMUM VALUE AFTER

ALL ITERATIONS USING ANY METHOD.CHOOSE THE HIGHEST VALUE
AFTER ALL ITERATIONS.

LOGIC: PROFIT SHOULD BE MAXIMUM WHICH AN ORGANIZATION GETS AFTER INVESTING/UTILIZING

THE AVAILABLE RESOURCES TO GET MAXIMUM
PROFIT.

MINIMIZATION PROBLEM:OBJECTIVE FUNCTION [COST/EXPENSES] IS MINIMUM VALUE AFTER ALL

ITERATIONS USING ANY METHOD.CHOOSE THE LEAST VALUE
AFTER ALL ITERATIONS.

Page 1
DP-ALLFILES
LOGIC: COSTS/EXPENSES SHOULD BE MINIMUM WHICH AN ORGANIZATION INCURS IN
INVESTING/UTILIZING THE AVAILABLE RESOURCES
TO GET DESIRED MAX OUTPUT AND PROFIT.

PROBLEM 2:

MODEL:
MAX = 14 * T + 31 * D + 29 * H;
22.5 * T + 43.1 * H <= 50;
0.1 * T + 0.3 * D + 0.5 * H <= 11;
@BIN(T);
@BIN(D);
@BIN(H);
END
Global optimal solution found at iteration: 0
Objective value: 60.00000

Variable Value Reduced Cost

T 0.000000 -14.00000
D 1.000000 -31.00000
H 1.000000 -29.00000

Row Slack or Surplus Dual Price

1 60.00000 1.000000
2 6.900000 0.000000
3 10.20000 0.000000
PROBLEM 3:

MODEL:
MAX = 120 * X + 230 * Y + 317 * Z;
X + Z = 393;
Y <= 20;
X + 2 * Y + 3 * Z <= 520;
END
Global optimal solution found at iteration: 0
Objective value: 60329.50

Variable Value Reduced Cost

X 349.5000 0.000000
Y 20.00000 0.000000
Z 43.50000 0.000000

Row Slack or Surplus Dual Price

1 60329.50 1.000000
2 0.000000 21.50000
Page 2
DP-ALLFILES
3 0.000000 33.00000
4 0.000000 98.50000

PROBLEM 4:

MODEL:
MAX = 200 * A + 10 * B - 75 * C - 50 * A;
41 * B + 20.5 * A - D = 0;
12 * B + 31.2 * C - A = 0;
D <= 60;
A <= 80;
END

Global optimal solution found at iteration: 0

Objective value: 431.9887

Variable Value Reduced Cost

A 2.926829 0.000000
B 0.000000 256.3462
C 0.9380863E-01 0.000000
D 60.00000 0.000000

Row Slack or Surplus Dual Price

1 431.9887 1.000000
2 0.000000 7.199812
3 0.000000 -2.403846
4 0.000000 7.199812
5 77.07317 0.000000

PROBLEM 5:

MODEL:
MAX = 1.38 * F + 4.58 * G;
13 * F + 44 * G <= 18368;
51 * F + 105 * G <= 26565;
END

Global optimal solution found at iteration: 2

Objective value: 1158.740

Variable Value Reduced Cost

F 0.000000 0.8445714
G 253.0000 0.000000

Page 3
DP-ALLFILES
Row Slack or Surplus Dual Price
1 1158.740 1.000000
2 7236.000 0.000000
3 0.000000 0.4361905E-01

PROBLEM 6:

MODEL:
Max = 5 * X + 1 * Y;
X + 3 * Y <= 10;
9*Y <= 70;
2*X + 3*Y <= 90;
END
Global optimal solution found at iteration: 1
Objective value: 50.00000

Variable Value Reduced Cost

X 10.00000 0.000000
Y 0.000000 14.00000

Row Slack or Surplus Dual Price

1 50.00000 1.000000
2 0.000000 5.000000
3 70.00000 0.000000
4 70.00000 0.000000

PROBLEM 7:

P 73.33333 0.000000
Q 23.33333 0.000000

Row Slack or Surplus Dual Price

1 5300.000 1.000000
2 63.33333 0.000000
3 0.000000 10.00000
4 0.000000 40.00000

1 33.33333 -1.000000
2 0.000000 -0.3333333
3 266.6667 0.000000

PROBLEM 13:

MIN = 12X + 3Z;

21*X - 10*Y >= 310;
13*Y + 21*Z <= 465;
14*Y + 31*Y +18*Z >= 565;

Global optimal solution found at iteration: 1

Page 7
DP-ALLFILES
Objective value: 248.8889

Variable Value Reduced Cost

X 20.74074 0.000000
Z 0.000000 0.7142857
Y 12.55556 0.000000

Row Slack or Surplus Dual Price

1 248.8889 -1.000000
2 0.000000 -0.5714286
3 301.7778 0.000000
4 0.000000 -0.1269841

PROBLEM 14:

MAX = 100X 120 * Y + 130 * Z;

210*X + 340*Y + 429*Z <= 2100;
345*X + 450*Y + 610*Z <= 3200;
411*X + 650*Y + 710*Z <= 4300;

MIN = X*Y*Z;
X+Y+Z=5;
X>=0;
Y>=0;
Z>=0;
Local optimal solution found at iteration: 29
Objective value: 0.000000
Page 9
DP-ALLFILES

Variable Value Reduced Cost

X 5.000000 0.000000
Y 0.000000 0.000000
Z 0.000000 0.000000

Row Slack or Surplus Dual Price

1 0.000000 -1.000000
2 0.000000 0.000000
3 5.000000 0.000000
4 0.000000 0.000000
5 0.000000 0.000000

FINAL SOLUTION:

QUESTION 1:FIND THE OBJECTIVE VALUE

ANS :OBJECTIVE VALUE(MIN Z) = 0 .

QUESTION 2:FIND THE VALUE OF THE 3 VARAIBLES USED IN PROBLEM

ANS:3 VARIABLES VALUE X=5, Y=0, Z=0

QUESTION 3:FIND THE VALUE OF REDUCED COSTS FOR ALL 3 VARAIBLES.

ANS:Reduced costs for all 3 variables X , Y and Z are equal to 0(zero)

QUESTION 4:FIND THE DUAL PRICE FOR ALL 5 ROWS.(SEE THE MAIN PROBLEM FOR 5 ROWS)
Dual Price for ROW 1 = -1
Dual price for the next 4 rows are equal to 0 (zero)

QUESTION 5:FIND THE SLACK/SURPLUS VALUE FOR ALL 5 ROWS.

ANS:Slack or Surplus value for Row 1 , Row 2 , Row 4 and Row 5 are equal to 0(zero)
.
For ROW 3 SLACK/SURPLUS VALUE = 5.

PROBLEM 18:

MIN = XX YY Z*Z;

X*Y*Z>=100;
2*Y >= 35;
4*X + 12*Y - 3*Z>=450;
Local optimal solution found at iteration: 38
Objective value: 10000.00

Variable Value Reduced Cost

X 16.67209 0.000000
Y 31.98984 0.000000
Z 0.1874986 0.000000
Page 10
DP-ALLFILES

Row Slack or Surplus Dual Price

1 10000.00 -1.000000
2 0.000000 -200.0001
3 28.97967 0.000000
4 0.3876105E-02 0.000000

PROBLEM 19:

MIN = A*B*3*C;
2*S+3*T*5*U>=300;
13.5*S>=100;
T+U<=150;
U>=2;
Local optimal solution found at iteration: 23
Objective value: 0.000000

Variable Value Reduced Cost

A 0.000000 21.27891
B 1.918234 0.000000
C 3.697657 0.000000
S 7.407407 0.000000
T 6.896339 0.000000
U 2.756875 0.000000

Row Slack or Surplus Dual Price

1 0.000000 -1.000000
2 -0.6742448E-07 0.000000
3 0.000000 0.000000
4 140.3468 0.000000
5 0.7568750 0.000000

PROBLEM 20:

MAX = P* 2Q 3.5*R;

P+Q*R<=1000;
P-Q<=2000;
P+4*Q-5*R<=2500;
P>=Q;
Q<=R;
Local optimal solution found at iteration: 69
Objective value: 1750000.

Page 11
DP-ALLFILES
Variable Value Reduced Cost
P 500.0000 0.000000
Q 22.32460 0.000000
R 22.39682 0.000000

Row Slack or Surplus Dual Price

1 1750000. 1.000000
2 0.000000 3500.000
3 1522.325 0.000000
4 2022.686 0.000000
5 477.6754 0.000000
6 0.7221645E-01 0.000000

PROBLEM 21:

MIN = 3y 4.5 * z + 18;

8*y - 4*z > 10;
13.5*y > 200;
15*z < 20;

Local optimal solution found at iteration: 20

Objective value: 18.00000

Variable Value Reduced Cost

Y 14.81481 0.000000
Z 0.000000 200.0000

Row Slack or Surplus Dual Price

1 18.00000 -1.000000
2 108.5185 0.000000
3 0.000000 0.000000
4 20.00000 0.000000

PROBLEM 22:

MAX = 5 * Y * Z - 3 * Y;
Y+Z<=12;
Y-Z<14;
Y>Z;
Z>0;
Y>0;
Local optimal solution found at iteration: 21
Objective value: 162.0000

Page 12
DP-ALLFILES
Variable Value Reduced Cost
Y 6.000000 0.000000
Z 6.000000 0.000000

Row Slack or Surplus Dual Price

1 162.0000 1.000000
2 0.000000 28.50000
3 14.00000 0.000000
4 0.000000 -1.500000
5 6.000000 0.000000
6 6.000000 0.000000

CHECK THE ANSWER BY SUBSTITUTING THE VALUES IN THE GIVEN OBJECTIVE FUNCTION(FIRST
ROW):

MAX Z = 566 - 3*6

MAX Z = 180-18

MAX Z = 162(THE OBJECTIVE FUNCTION IS SATISFIED)

TAKE SECOND ROW WHICH IS FIRST CONSTRAINT EQUATION IN THE GIVEN PROBLEM:
Y+Z<=12 SUBSTITUTE VALUES OF Y AND Z OF 6 RESPECTIVELY IN THE CONSTRAINT EQUATION.WE
GET
6+6<=12-----6+6=12 IS SATISTFIED.

TAKE THIRD ROW WHICH IS SECOND CONSTRAINT EQUATION IN THE GIVEN PROBLEM
Y-Z<14 SUBSTITUTE VALUES OF Y AND Z OF 6 RESPECTIVELY IN THE CONSTRAINT EQUATION.WE
GET
6-6<14
0<14(THE FIRST CONSTRAINT EQUATION IS SATISFIED)

TAKE FOURTH ROW WHICH IS THIRD CONSTRAINT EQUATION IN THE GIVEN PROBLEM
Y>Z SUBSTITUTE VALUES OF Y AND Z OF 6 RESPECTIVELY IN THE CONSTRAINT EQUATION.WE GET

6>6 COVERED BY EQUAL (THE THIRD CONSTRAINT IS SATISFIED)

TAKE FIFTH ROW WHICH IS FOURTH CONSTRAINT EQUATION IN THE GIVEN PROBLEM
Z>0 SUBSTITUTE VALUE OF Z OF 6 IN THE CONSTRAINT EQUATION.WE GET
6>0 THE FOURTH CONSTRAINT IS SATISFIED

TAKE SIXTH ROW WHICH IS FIFTH CONSTRAINT EQUATION IN THE GIVEN PROBLEM
Y>0 SUBSTITUTE VALUES OF Y OF 6 IN THE CONSTRAINT EQUATION.WE GET
6>0 THE FIFTH CONSTRAINT IS SATISFIED

PROBLEM 23:
Page 13
DP-ALLFILES

MODEL:
SETS:
! In a network of 10 cities we have
to find the length of the shortest route
from city 1 to city 10;
! The primitive set of ten cities, where
F( i) represents the shortest path distance
from city i to the last city;
CITIES /1..10/: F;
! The derived set ROADS lists the roads that
exist between the cities (Important: Not all city
pairs are directly linked by a road, and roads
are assumed to be one way.);
ROADS( CITIES, CITIES)/
1,3 1,2 4,4
2,7 6,4 2,7
3,7 5,6 3,5
4,3 6,4
5,9 5,8
6,9 6,8
7,9 7,8
8,10
9,10/: D;
! D( i, j) is the distance from city i to j;
ENDSETS
DATA
:
! Here are the distances that correspond to the
above links;
D =
10 15 6
11 16 12
4 6 12
14 13
9 13
4 19
10 8
9
1;
ENDDATA
! If you are already in City 10, then the cost to
travel to City 10 is 0;
F(
@SIZE
( CITIES)) = 0;
! The following is the classic dynamic programming
recursion. In words, the shortest distance from
Page 14
DP-ALLFILES
City i to City 10 is the minimum over all
cities j reachable from i of the sum of the
distance from i to j plus the minimal distance
from j to City 10;
@FOR
( CITIES( i)| i #LT#
@SIZE
( CITIES):
F( i) =
@MIN
( ROADS( i, j): D( i, j) + F( j))
);
END

Linearization components added:

Constraints: 31
Variables: 18
Integers: 13

Feasible solution found at iteration: 0

Variable Value
F( 1) 25.00000
F( 2) 23.00000
F( 3) 15.00000
F( 4) 29.00000
F( 5) 10.00000
F( 6) 5.000000
F( 7) 11.00000
F( 8) 9.000000
F( 9) 1.000000
F( 10) 0.000000
D( 1, 3) 10.00000
D( 1, 2) 15.00000
D( 4, 4) 6.000000
D( 2, 7) 11.00000
D( 6, 4) 16.00000
D( 2, 7) 12.00000
D( 3, 7) 4.000000
D( 5, 6) 6.000000
D( 3, 5) 12.00000
D( 4, 3) 14.00000
D( 6, 4) 13.00000
D( 5, 9) 9.000000
D( 5, 8) 13.00000
D( 6, 9) 4.000000
D( 6, 8) 19.00000
D( 7, 9) 10.00000
Page 15
DP-ALLFILES
D( 7, 8) 8.000000
D( 8, 10) 9.000000
D( 9, 10) 1.000000

Row Slack or Surplus

1 0.000000
2 0.000000
3 0.000000
4 0.000000
5 0.000000
6 0.000000
7 -13.00000
8 -99987.00
9 0.000000
10 0.000000

PROBLEM 24:(TRAVELLING SALESMAN PROBLEM)

!
TSP
In the traveling salesman problem (TSP), we have a
network of cities connected by roads.
We need to find a tour that visits each of the citi
es exactly once,minimizing the total distance traveled.
As it turns, large TSP models are difficult to solv
e using optimization and are best approached using some form of heuristic
The problem lies in the fact that solutions to large models
tend to contain subtours.
A subtour is a tour of a subset of cities unconnect
ed to the main tour.
One can add constraints to break the subtours, but
the number of constraints required grows dramatically as the numb
er of cities increase.;
MODEL:
! Traveling Salesman Problem for the cities of
Atlanta, Chicago, Cincinnati, Houston, LA ;
SETS:
CITY / 1.. 5/: U;
! U( I) = sequence no. of city;
LINK( CITY, CITY):DIST,
! The distance matrix;
X;
! X( I, J) = 1 if we use link I, J;
ENDSETS
DATA:
!Distance matrix, it need not be symmetric;
DIST = 0 721 423 814 2100
Page 16
DP-ALLFILES
700 0 328 1000 2314
465 340 0 1789 2890
678 1023 980 0 1500
2418 2345 2678 1789 0 ;
ENDDATA
N = @SIZE ( CITY);
MIN = @SUM ( LINK: DIST * X);
@FOR ( CITY( K):
! It must be entered;
@SUM ( CITY( I)| I #NE# K: X( I, K)) = 1;
! It must be departed;
@SUM ( CITY( J)| J #NE# K: X( K, J)) = 1;
! Weak form of the subtour breaking constraints;
! These are not very powerful for large problems;
@FOR ( CITY( J)| J #GT# 1 #AND# J #NE# K:
U( J) >= U( K) + X ( K, J) -
( N - 2) * ( 1 - X( K, J)) +
( N - 3) * X( J, K)
);
);
! Make the X's 0/1;
@FOR
( LINK:@BIN ( X));
! For the first and last stop we know...;
@FOR ( CITY( K)| K #GT# 1:
U( K) <= N - 1 - ( N - 2) * X( 1, K);
U( K) >= 1 + ( N - 2) * X( K, 1)
);
END
Global optimal solution found at iteration: 21
Objective value: 5452.000

X 0.000000 1.500000
Y 6.000000 0.000000
Z 0.000000 4.500000

Row Slack or Surplus Dual Price

1 18.00000 1.000000
2 0.000000 1.500000
3 8.000000 0.000000
4 20.00000 0.000000

Page 21
PROBLEM 1:

Number of trials: 2
Seed: 0

Results ----------

Cumltv Value * Pct Occrrncs

Category Value Freqncy Prob Prob Freqncy Occrrncs Occur * Value
-------------------------------------------------------------------------------------------
Category 1 12 45 .49 .49 5.87 1 .5 12
Category 2 12 47 .51 1 6.13 1 .5 12
-------------------------------------------------------------------------------------------
92 1 12 2 1 24

Individual Runs ----------

Run Random number Category Value

1 .88 Category 2 12
2 .24 Category 1 12

.5109
.5 .5
0.5 .4891

Frequency

Percent
of
Total

Observed

0
Category 1 Category 2
Category
PROBLEM 2:

Number of trials: 10
Seed: 0

Results ----------

Frequency

Percent .2 .2 .2
of .18
Total .15 .16
.13
.12
.09
.07

.03 .03 .04 Observed

.0 .0 .0 .0 .0 .0
0
Category 1 Category 3 Category 5 Category 7 Category 9
Category
PROBLEM 7:

Number of trials: 10
Seed: 10

Results ----------

Cumltv Value * Pct Occrrncs

Category Value Freqncy Prob Prob Freqncy Occrrncs Occur * Value
-------------------------------------------------------------------------------------------
Category 1 10 18 .03 .03 .32 0 0 0
Category 2 11 19 .03 .06 .37 1 .1 11
Category 3 12 21 .04 .1 .44 0 0 0
Category 4 14 41 .07 .17 1.01 1 .1 14
Category 5 21 54 .09 .27 1.99 0 0 0
Category 6 23 67 .12 .39 2.7 1 .1 23
Category 7 25 73 .13 .51 3.2 1 .1 25
Category 8 27 87 .15 .67 4.11 3 .3 81
Category 9 28 91 .16 .82 4.46 2 .2 56
Category 10 31 100 .18 1 5.43 1 .1 31
-------------------------------------------------------------------------------------------
571 1 24.01 10 1 241

Individual Runs ----------

.2
Frequency
.18
.16
Percent .15
of .13
Total .12
.1 .1 .09 .1 .1 .1

.07

.14
.13 .13
.12 Frequency
.11
Percent .1 .1 .1 .1 .1
of .09
Total .08

.06

.04

Observed

.0 .0 .0
0
Category 1 Category 3 Category 5 Category 7 Category 9
Category
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 19:57:32

Module/submodel: Work Measurement/Time Study

Problem title: (untitled)
Allowance factor: 0

Results ----------

Performance
rating Obs 1 Obs 2 Obs 3 Obs 4
-----------------------------------------------------------------------------------------------------
Element 1 100 10 13 16 18
Element 2 100 15 21 23 25
Element 3 100 20 25 30 34
Element 4 100 31 33 35 37
Element 5 100 41 45 47 48
-----------------------------------------------------------------------------------------------------

Obs 5 Average Sample Std dev Normal

-----------------------------------------------------------------------------------
Element 1 21 15.6 4.28 15.6
Element 2 27 22.2 4.6 22.2
Element 3 41 30 8.09 30
Element 4 39 35 3.16 35
Element 5 50 46.2 3.42 46.2
-----------------------------------------------------------------------------------

Normal time for process = 149

Standard time for process = 149
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:27:04

Module/submodel: Work Measurement/Time Study

Problem title: (untitled)
Allowance factor: 0

Results ----------

Performance
rating Obs 1 Obs 2 Obs 3 Average
-----------------------------------------------------------------------------------------------------
Element 1 50 5 7 9 7
Element 2 75 12 15 18 15
Element 3 100 21 24 26 23.67
-----------------------------------------------------------------------------------------------------

Sample Std dev Normal

-----------------------------------------------
Element 1 2 3.5
Element 2 3 11.25
Element 3 2.52 23.67
-----------------------------------------------

Normal time for process = 38.42

Standard time for process = 38.42
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:28:38

Problem title: (untitled)
Allowance factor: .25

Results ----------

Performance
rating Obs 1 Obs 2 Average Sample Std dev
-----------------------------------------------------------------------------------------------------
Element 1 50 12 14 13 1.41
Element 2 100 22 16 19 4.24
-----------------------------------------------------------------------------------------------------

Proportion 0.16
Accuracy level 0.4
Sample size 3.23
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:55:36

Module/submodel: Breakeven/Cost-Volume Analysis/Cost-Volume Analysis

Problem title: (untitled)
Volume for volume analysis: 3

Results ----------

Cost Type Option 1 Option 2

Cost 1 Fixed 15 57
Cost 2 Variable 20 5

BREAKEVEN POINTS Units Dollars

Option 1 vs. Option 2 2.8 71

Volume analysis @ 3 units

Option 1 Option 2
TOTAL FIXED COSTS 15 57
TOTAL VARIABLE COSTS 60 15
TOTAL COSTS 75 72

(untitled)

Cost
Option 1

Option 2

$71.

$57.

$15.

3
Volume
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 20:53:23

Module/submodel: Breakeven/Cost-Volume Analysis/Cost-Volume Analysis

Problem title: (untitled)
Volume for volume analysis: 3

Results ----------

Cost Type Option 1 Option 2

Cost 1 Fixed 5 15
Cost 2 Variable 10 3

BREAKEVEN POINTS Units Dollars

Option 1 vs. Option 2 1.43 19.29

Volume analysis @ 3 units

Option 1 Option 2
TOTAL FIXED COSTS 5 15
TOTAL VARIABLE COSTS 30 9
TOTAL COSTS 35 24

(untitled)

Cost
Option 1

Option 2

$19.29

$15.

$5.

1
Volume
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-08-2014 06:41:15

Module/submodel: Breakeven/Cost-Volume Analysis/Cost-Volume Analysis

Problem title: (untitled)
Volume for volume analysis: 2

Results ----------

Cost Type Option 1 Option 2 Option 3

Cost 1 Fixed 10 16 20
Cost 2 Variable 13 12 16
Cost 3 Variable 18 8 10
Total fixed costs 10 16 20
Total variable costs per unit
31 20 26

BREAKEVEN POINTS Units Dollars

Option 1 vs. Option 2 .55 26.91
Option 1 vs. Option 3 2 72
Option 2 vs. Option 3 None

Volume analysis @ 2 units

Option 1 Option 2 Option 3

TOTAL FIXED COSTS 10 16 20
TOTAL VARIABLE COSTS 62 40 52
TOTAL COSTS 72 56 72

(untitled)

Cost
Option 1
Option 3

$72.
Option 2

$26.91
$20.
$16.
$10.

1 2
-1
Volume
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-08-2014 06:44:06

Module/submodel: Breakeven/Cost-Volume Analysis/Cost-Volume Analysis

Problem title: (untitled)
Volume for volume analysis: 2

Results ----------

Cost Type Option 1 Option 2 Option 3

Cost 1 Fixed 10 16 20
Cost 2 Variable 13 12 16
Cost 3 Variable 18 8 3
Total fixed costs 10 16 20
Total variable costs per unit
31 20 19

BREAKEVEN POINTS Units Dollars

Option 1 vs. Option 2 .55 26.91
Option 1 vs. Option 3 .83 35.83
Option 2 vs. Option 3 4 96

Volume analysis @ 2 units

Option 1 Option 2 Option 3

TOTAL FIXED COSTS 10 16 20
TOTAL VARIABLE COSTS 62 40 38
TOTAL COSTS 72 56 58

(untitled)

Cost
Option 1

2
Option 3

$96.

$35.83
$26.91
$20.
$16.
$10.
1 1 4
Volume
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 18:42:21

Module/submodel: Breakeven/Cost-Volume Analysis/Cost-Volume Analysis

Problem title: (untitled)
Volume for volume analysis: 3

Results ----------

Cost Type Option 1 Option 2 Option 3

Cost 1 Fixed 12 15 23
Cost 2 Variable 14 8 3
Cost 3 Variable 18 4 1
Total fixed costs 12 15 23
Total variable costs per unit
32 12 4

BREAKEVEN POINTS Units Dollars

Option 1 vs. Option 2 .15 16.8
Option 1 vs. Option 3 .39 24.57
Option 2 vs. Option 3 1 27

Volume analysis @ 3 units

Option 1 Option 2 Option 3

TOTAL FIXED COSTS 12 15 23
TOTAL VARIABLE COSTS 96 36 12
TOTAL COSTS 108 51 35

(untitled)

Cost
Option 1

Option 2
Option 3
$27.
$24.57
$23.

$16.8
$15.
$12.

1
Volume
bep-mgtscience
Definitions and formulae of the terms in Break-Even Analysis(BEA):

1. Selling Price per Unit(SP): Price that a unit is expected to be sold for.
2. Selling Units: Number of units expected to be sold.
3. Fixed Cost (FC):Cost/expense that remains constant within a range of production
or sales, regardless of the number of units produced or sold within that range.
Typical fixed costs are: rent, mortgage, equipment, salaries,etc.
4. Variable Cost per Unit(VC): Cost/expense that vary with the production or the
purchase of one unit.
5. Break-even point: Point where Total Revenue got by Total Converted Sales equal
Total Cost.
6. Total Variable Cost (VC): Cost which varies directly with the number of units
produced or sold. Typical variable costs are: materials, packaging and shipping,
sales commission etc.
7. Total Variable Cost = Selling Units x Variable Cost per Unit
8. Total Cost (TC): total expenses incurred in the process of producing or selling a
number of units.
9. Total Cost (TC) = Fixed Cost (FC) + Total Variable Cost (VC)
10.Total Revenue: Total Sales Value of the units produced or sold.
11.Total Revenue = Selling Units x Selling Price per Unit
12.Profit: The gains/benefits derived or got from producing or selling a number of
units in the ordinary or normal course of business primarily in the market.
Profit(Z) = Total Revenue(TR) - Total Cost(TC)-True if TR exceeds TC i.e., TR>TC
thereby the value of z is a positive value which denotes profit and no loss in the
business.
However, if TR<TC or TC>TR then TR-TC is a negative value and is called LOSS.

Numerical Problems:

Input Results
Selling Price per Unit: 100 Break-even units: 0.89
Fixed Cost: 80 Total Revenue: 88.89
Variable Cost per Unit: 10 Total Cost: 88.89
Profit : 0.00

Input Results
Selling Price per Unit: 110 Break-even units: 1.00
Fixed Cost: 90 Total Revenue: 110.00
Variable Cost per Unit: 20 Total Cost: 110.00
Profit: 0.00

Page 1
bep-mgtscience
Input Results
Selling Price per Unit: 200 Break-even units: 1.19
Fixed Cost: 190 Total Revenue: 237.50
Variable Cost per Unit: 40 Total Cost: 237.50
Profit: 0.00

Input Results
Selling Price per Unit: 300 Break-even units: 1.16
Fixed Cost: 290 Total Revenue: 348.00
Variable Cost per Unit: 50 Total Cost: 348.00
Profit: 0.00

Input Results
Selling Price per Unit: 80 Break-even units: 1.42
Fixed Cost: 78 Total Revenue: 113.45
Variable Cost per Unit: 25 Total Cost: 113.45
Profit: 0.00

Page 2
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 15:11:06

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 10 12 0
Row strat 2 14 18 1
Column mix 1 0

Value of game (to row) = 14

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 10 0 10
Row strat 2 14 0 14

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 14 18
Expected Value 14 18

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 10 12 10
Row strat 2 14 18 14 14
Column maximum 14 18
Minimum of Maxima 14

Value= 14

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
18

12Col strat 2

10Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
18

14 14Row strat 2

10Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 15:12:51

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 121 223 1
Row strat 2 112 314 0
Column mix 1 0

Value of game (to row) = 121

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 121 0 121
Row strat 2 112 0 112

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 121 223
Row strat 2 0 0 0
Expected Value 121 223

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 121 223 121 121
Row strat 2 112 314 112
Column maximum 121 314
Minimum of Maxima 121

Value= 121

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
314

223Col strat 2

121 121Col strat 1

112

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
314

223

121 121Row strat 1

112Row strat 2

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 15:13:36

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 10 5 1
Row strat 2 10 0 0
Column mix 0 1

Value of game (to row) = 5

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 5 5
Row strat 2 0 0 0

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 10 5
Row strat 2 0 0 0
Expected Value 10 5

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 10 5 5 5
Row strat 2 10 0 0
Column maximum 10 5
Minimum of Maxima 5

Value= 5

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
10 10Col strat 1

5 5Col strat 2

0
0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
10Row strat 2
1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 15:14:37

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 2236 5510 1
Row strat 2 1123 3156 0
Column mix 1 0

Value of game (to row) = 2236

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 2236 0 2236
Row strat 2 1123 0 1123

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 2236 5510
Row strat 2 0 0 0
Expected Value 2236 5510

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 2236 5510 2236 2236
Row strat 2 1123 3156 1123
Column maximum 2236 5510
Minimum of Maxima 2236

Value= 2236

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
5510Col strat 2

3156

2236 2236Col strat 1

1123

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
5510

3156

2236 2236Row strat 1

1123Row strat 2

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 17:23:33

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col Col

strat 1 strat 2 strat 3 Row Mix
---------------------------------------------------------
Row strat 1 4 14 27 0
Row strat 2 5 12 18 0
Row strat 3 12 15 18 1
Column mix 1 0 0

Value of game (to row) = 12

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Col Expected

strat 1 strat 2 strat 3 Value
---------------------------------------------------------------
Col's optimal mix 1 0 0
Row strat 1 4 0 0 4
Row strat 2 5 0 0 5
Row strat 3 12 0 0 12

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col Col

Opt Mix strat 1 strat 2 strat 3
------------------------------------------------------------
Row strat 1 0 0 0 0
Row strat 2 0 0 0 0
Row strat 3 1 12 15 18
Expected Value 12 15 18

Maximin/Minimax ----------

Col Col Col Row Maximum

strat 1 strat 2 strat 3 Minimum of Minima
--------------------------------------------------------------------------
Row strat 1 4 14 27 4
Row strat 2 5 12 18 5
Row strat 3 12 15 18 12 12
Column maximum 12 15 27
Minimum of Maxima 12

Value= 12

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0
Row strat 3 1

COLUMN
Col strat 1 1
Col strat 2 0
Col strat 3 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 17:25:28

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col Col

strat 1 strat 2 strat 3 Row Mix
---------------------------------------------------------
Row strat 1 412 516 666 .46
Row strat 2 565 475 885 .54
Row strat 3 348 441 314 0
Column mix .21 .79 0

Value of game (to row) = 494.02

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Col Expected

strat 1 strat 2 strat 3 Value
---------------------------------------------------------------
Col's optimal mix .21 .79 0
Row strat 1 87.07 406.95 0 494.02
Row strat 2 119.41 374.61 0 494.02
Row strat 3 73.55 347.8 0 421.35

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col Col

Opt Mix strat 1 strat 2 strat 3
------------------------------------------------------------
Row strat 1 .46 191.13 239.38 308.97
Row strat 2 .54 302.89 254.64 474.43
Row strat 3 0 0 0 0
Expected Value 494.02 494.02 783.4

Maximin/Minimax ----------

Col Col Col Row Maximum

strat 1 strat 2 strat 3 Minimum of Minima
--------------------------------------------------------------------------
Row strat 1 412 516 666 412
Row strat 2 565 475 885 475 475
Row strat 3 348 441 314 314
Column maximum 565 516 885
Minimum of Maxima 516

475 <= value <= 516

Results in list form ----------

ROW
Row strat 1 .46
Row strat 2 .54
Row strat 3 0

COLUMN
Col strat 1 .21
Col strat 2 .79
Col strat 3 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 17:26:39

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col Col

strat 1 strat 2 strat 3 Row Mix
---------------------------------------------------------
Row strat 1 10 10 30 0
Row strat 2 12 24 45 0
Row strat 3 31 45 67 1
Column mix 1 0 0

Value of game (to row) = 31

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Col Expected

strat 1 strat 2 strat 3 Value
---------------------------------------------------------------
Col's optimal mix 1 0 0
Row strat 1 10 0 0 10
Row strat 2 12 0 0 12
Row strat 3 31 0 0 31

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col Col

Opt Mix strat 1 strat 2 strat 3
------------------------------------------------------------
Row strat 1 0 0 0 0
Row strat 2 0 0 0 0
Row strat 3 1 31 45 67
Expected Value 31 45 67

Maximin/Minimax ----------

Col Col Col Row Maximum

strat 1 strat 2 strat 3 Minimum of Minima
--------------------------------------------------------------------------
Row strat 1 10 10 30 10
Row strat 2 12 24 45 12
Row strat 3 31 45 67 31 31
Column maximum 31 45 67
Minimum of Maxima 31

Value= 31

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0
Row strat 3 1

COLUMN
Col strat 1 1
Col strat 2 0
Col strat 3 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 19:50:50

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col Col Col Col

strat 1 strat 2 strat 3 strat 4 strat 5 Row Mix
-------------------------------------------------------------------------------
Row strat 1 12 15 19 24 28 0
Row strat 2 14 18 24 29 32 0
Row strat 3 16 19 34 56 76 0
Row strat 4 18 22 27 34 42 0
Row strat 5 20 27 38 42 50 1
Column mix 1 0 0 0 0

Value of game (to row) = 20

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Col Col Col Expected

strat 1 strat 2 strat 3 strat 4 strat 5 Value
-------------------------------------------------------------------------------------
Col's optimal mix 1 0 0 0 0
Row strat 1 12 0 0 0 0 12
Row strat 2 14 0 0 0 0 14
Row strat 3 16 0 0 0 0 16
Row strat 4 18 0 0 0 0 18
Row strat 5 20 0 0 0 0 20

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col Col Col Col

Opt Mix strat 1 strat 2 strat 3 strat 4 strat 5
----------------------------------------------------------------------------------
Row strat 1 0 0 0 0 0 0
Row strat 2 0 0 0 0 0 0
Row strat 3 0 0 0 0 0 0
Row strat 4 0 0 0 0 0 0
Row strat 5 1 20 27 38 42 50
Expected Value 20 27 38 42 50

Maximin/Minimax ----------

Col Col Col Col Col Row Maximum

strat 1 strat 2 strat 3 strat 4 strat 5 Minimum of Minima
------------------------------------------------------------------------------------------------
Row strat 1 12 15 19 24 28 12
Row strat 2 14 18 24 29 32 14
Row strat 3 16 19 34 56 76 16
Row strat 4 18 22 27 34 42 18
Row strat 5 20 27 38 42 50 20 20
Column maximum 20 27 38 56 76
Minimum of Maxima 20

Value= 20

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0
Row strat 3 0
Row strat 4 0
Row strat 5 1

COLUMN
Col strat 1 1
Col strat 2 0
Col strat 3 0
Col strat 4 0
Col strat 5 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-07-2014 19:53:07

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col Col Col Col

strat 1 strat 2 strat 3 strat 4 strat 5 Row Mix
-------------------------------------------------------------------------------
Row strat 1 10 15 20 25 30 0
Row strat 2 13 14 15 16 17 0
Row strat 3 18 27 22 10 5 0
Row strat 4 12 22 43 34 4 0
Row strat 5 21 25 52 56 76 1
Column mix 1 0 0 0 0

Value of game (to row) = 21

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Col Col Col Expected

strat 1 strat 2 strat 3 strat 4 strat 5 Value
-------------------------------------------------------------------------------------
Col's optimal mix 1 0 0 0 0
Row strat 1 10 0 0 0 0 10
Row strat 2 13 0 0 0 0 13
Row strat 3 18 0 0 0 0 18
Row strat 4 12 0 0 0 0 12
Row strat 5 21 0 0 0 0 21

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col Col Col Col

Maximin/Minimax ----------

Col Col Col Col Col Row Maximum

strat 1 strat 2 strat 3 strat 4 strat 5 Minimum of Minima
------------------------------------------------------------------------------------------------
Row strat 1 10 15 20 25 30 10
Row strat 2 13 14 15 16 17 13
Row strat 3 18 27 22 10 5 5
Row strat 4 12 22 43 34 4 4
Row strat 5 21 25 52 56 76 21 21
Column maximum 21 27 52 56 76
Minimum of Maxima 21

Value= 21

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0
Row strat 3 0
Row strat 4 0
Row strat 5 1

COLUMN
Col strat 1 1
Col strat 2 0
Col strat 3 0
Col strat 4 0
Col strat 5 0
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 14:56:55

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 10 16 0
Row strat 2 18 45 1
Column mix 1 0

Value of game (to row) = 18

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 10 0 10
Row strat 2 18 0 18

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 18 45
Expected Value 18 45

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 10 16 10
Row strat 2 18 45 18 18
Column maximum 18 45
Minimum of Maxima 18

Value= 18

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
45

18
16Col strat 2

10Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
45

18 18Row strat 2
16

10Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 14:58:40

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 50 66 0
Row strat 2 78 99 1
Column mix 1 0

Value of game (to row) = 78

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 50 0 50
Row strat 2 78 0 78

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 78 99
Expected Value 78 99

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 50 66 50
Row strat 2 78 99 78 78
Column maximum 78 99
Minimum of Maxima 78

Value= 78

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
99

66Col strat 2

50Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
99

78 78Row strat 2

50Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:00:07

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 34 55 1
Row strat 2 16 100 0
Column mix 1 0

Value of game (to row) = 34

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 34 0 34
Row strat 2 16 0 16

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 34 55
Row strat 2 0 0 0
Expected Value 34 55

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 34 55 34 34
Row strat 2 16 100 16
Column maximum 34 100
Minimum of Maxima 34

Value= 34

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
100

55Col strat 2

34 34Col strat 1

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
100

34 34Row strat 1

16Row strat 2

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:00:49

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 29 45 0
Row strat 2 76 90 1
Column mix 1 0

Value of game (to row) = 76

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 29 0 29
Row strat 2 76 0 76

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 76 90
Expected Value 76 90

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 29 45 29
Row strat 2 76 90 76 76
Column maximum 76 90
Minimum of Maxima 76

Value= 76

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
90

45Col strat 2

29Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
90

76 76Row strat 2

29Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:01:50

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 19 89 0
Row strat 2 39 49 1
Column mix 1 0

Value of game (to row) = 39

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 19 0 19
Row strat 2 39 0 39

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 39 49
Expected Value 39 49

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 19 89 19
Row strat 2 39 49 39 39
Column maximum 39 89
Minimum of Maxima 39

Value= 39

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
89Col strat 2

19Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
89

39 39Row strat 2

19Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:02:29

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 20 30 1
Row strat 2 20 50 0
Column mix 1 0

Value of game (to row) = 20

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 20 0 20
Row strat 2 20 0 20

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 20 30
Row strat 2 0 0 0
Expected Value 20 30

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 20 30 20 20
Row strat 2 20 50 20 20
Column maximum 20 50
Minimum of Maxima 20

Value= 20

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
50

30Col strat 2

20 20Col strat 1

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
50

20 20Row strat 2
1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:03:07

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 14 10 1
Row strat 2 40 10 0
Column mix 0 1

Value of game (to row) = 10

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 10 10
Row strat 2 0 10 10

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 14 10
Row strat 2 0 0 0
Expected Value 14 10

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 14 10 10 10
Row strat 2 40 10 10 10
Column maximum 40 10
Minimum of Maxima 10

Value= 10

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
40

14Col strat 1

10 10Col strat 2

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
40Row strat 2

14Row strat 1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:04:33

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 9 27 0
Row strat 2 18 54 1
Column mix 1 0

Value of game (to row) = 18

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 9 0 9
Row strat 2 18 0 18

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 18 54
Expected Value 18 54

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 9 27 9
Row strat 2 18 54 18 18
Column maximum 18 54
Minimum of Maxima 18

Value= 18

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
54

27Col strat 2

9Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
54

18 18Row strat 2

9Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:05:10

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 16 15 1
Row strat 2 17.5 14 0
Column mix 0 1

Value of game (to row) = 15

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 15 15
Row strat 2 0 14 14

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 16 15
Row strat 2 0 0 0
Expected Value 16 15

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 16 15 15 15
Row strat 2 17.5 14 14
Column maximum 17.5 15
Minimum of Maxima 15

Value= 15

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
17.5

16Col strat 1
15 15Col strat 2
14

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
17.5Row strat 2

16Row strat 1
15
14

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:10:16

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 0 1 0
Row strat 2 0 0 0
Column mix 1 0

Value of game (to row) = 0

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 0 0 0
Row strat 2 0 0 0

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 0 0 0
Expected Value 0 0

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 0 1 0 0
Row strat 2 0 0 0 0
Column maximum 0 1
Minimum of Maxima 0

Value= 0

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
1Col strat 2

0 0Col strat 1
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
1

0 0Row strat 2
1
0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:03:51

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 9 9 1
Row strat 2 9 9 0
Column mix 1 0

Value of game (to row) = 9

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 9 0 9
Row strat 2 9 0 9

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 9 9
Row strat 2 0 0 0
Expected Value 9 9

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 9 9 9 9
Row strat 2 9 9 9 9
Column maximum 9 9
Minimum of Maxima 9 9

Value= 9

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
9 9Col strat 2
1

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
9 9Row strat 2
1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:05:53

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 16 34 0
Row strat 2 17 32 1
Column mix 1 0

Value of game (to row) = 17

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 16 0 16
Row strat 2 17 0 17

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 17 32
Expected Value 17 32

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 16 34 16
Row strat 2 17 32 17 17
Column maximum 17 34
Minimum of Maxima 17

Value= 17

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
34Col strat 2
32

17
16Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
34
32

17 17Row strat 2
16Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:06:32

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 1 2 0
Row strat 2 3 4 1
Column mix 1 0

Value of game (to row) = 3

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 1 0 1
Row strat 2 3 0 3

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 3 4
Expected Value 3 4

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 1 2 1
Row strat 2 3 4 3 3
Column maximum 3 4
Minimum of Maxima 3

Value= 3

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
4

2Col strat 2

1Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
4

3 3Row strat 2

1Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:07:12

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 11 4 1
Row strat 2 12 3 0
Column mix 0 1

Value of game (to row) = 4

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 4 4
Row strat 2 0 3 3

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 11 4
Row strat 2 0 0 0
Expected Value 11 4

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 11 4 4 4
Row strat 2 12 3 3
Column maximum 12 4
Minimum of Maxima 4

Value= 4

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
12

11Col strat 1

4 4Col strat 2

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
12Row strat 2
11Row strat 1

4
3

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:08:00

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 12.5 13.5 0
Row strat 2 17.5 14.6 1
Column mix 0 1

Value of game (to row) = 14.6

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 13.5 13.5
Row strat 2 0 14.6 14.6

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 17.5 14.6
Expected Value 17.5 14.6

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 12.5 13.5 12.5
Row strat 2 17.5 14.6 14.6 14.6
Column maximum 17.5 14.6
Minimum of Maxima 14.6

Value= 14.6

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
17.5

14.6
13.5Col strat 2
12.5Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
17.5Row strat 2

14.6
13.5
12.5Row strat 1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:10:55

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 45 0 0
Row strat 2 89.9 0 0
Column mix 0 1

Value of game (to row) = 0

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 0 0
Row strat 2 0 0 0

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 0 0 0
Expected Value 0 0

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 45 0 0 0
Row strat 2 89.9 0 0 0
Column maximum 89.9 0
Minimum of Maxima 0

Value= 0

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
89.9

45Col strat 1

0 0Col strat 2
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
89.9Row strat 2

45Row strat 1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:11:55

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 4 3 0
Row strat 2 12 7 1
Column mix 0 1

Value of game (to row) = 7

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 3 3
Row strat 2 0 7 7

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 12 7
Expected Value 12 7

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 4 3 3
Row strat 2 12 7 7 7
Column maximum 12 7
Minimum of Maxima 7

Value= 7

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
12

4Col strat 1

3Col strat 2

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
12Row strat 2

4Row strat 1
3

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:08:40

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 11 18 0
Row strat 2 26.9 23.5 1
Column mix 0 1

Value of game (to row) = 23.5

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 18 18
Row strat 2 0 23.5 23.5

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 26.9 23.5
Expected Value 26.9 23.5

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 11 18 11
Row strat 2 26.9 23.5 23.5 23.5
Column maximum 26.9 23.5
Minimum of Maxima 23.5

Value= 23.5

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
26.9

23.5

18Col strat 2

11Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
26.9Row strat 2

23.5

11Row strat 1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:13:35

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 31 31 1
Row strat 2 31 31 0
Column mix 1 0

Value of game (to row) = 31

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 31 0 31
Row strat 2 31 0 31

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 31 31
Row strat 2 0 0 0
Expected Value 31 31

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 31 31 31 31
Row strat 2 31 31 31 31
Column maximum 31 31
Minimum of Maxima 31 31

Value= 31

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
31 31Col strat 2
1

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
31 31Row strat 2
1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:14:11

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 0 0 1
Row strat 2 0 0 0
Column mix 1 0

Value of game (to row) = 0

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 0 0 0
Row strat 2 0 0 0

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 0 0
Row strat 2 0 0 0
Expected Value 0 0

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 0 0 0 0
Row strat 2 0 0 0 0
Column maximum 0 0
Minimum of Maxima 0 0

Value= 0

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value

0 0Col strat 2
1
0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value

0 0Row strat 2
1
0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:12:50

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 1 13 0
Row strat 2 4 29 1
Column mix 1 0

Value of game (to row) = 4

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 1 0 1
Row strat 2 4 0 4

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 4 29
Expected Value 4 29

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 1 13 1
Row strat 2 4 29 4 4
Column maximum 4 29
Minimum of Maxima 4

Value= 4

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
29

13Col strat 2

1Col strat 1
0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
29

4 4Row strat 2

1Row strat 1
0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:15:00

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 12 0 .5
Row strat 2 0 12 .5
Column mix .5 .5

Value of game (to row) = 6

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix .5 .5
Row strat 1 6 0 6
Row strat 2 0 6 6

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 .5 6 0
Row strat 2 .5 0 6
Expected Value 6 6

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 12 0 0 0
Row strat 2 0 12 0 0
Column maximum 12 12
Minimum of Maxima 12 12

0 <= value <= 12

Results in list form ----------

ROW
Row strat 1 .5
Row strat 2 .5

COLUMN
Col strat 1 .5
Col strat 2 .5
(untitled)
Row's graph vs. Column's Strategies

Value
12 12Col strat 1

0 0Col strat 2
0 .5 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
12 12Row strat 1

0 0Row strat 2
0 .5 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:16:13

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 0 10 .5
Row strat 2 10 0 .5
Column mix .5 .5

Value of game (to row) = 5

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix .5 .5
Row strat 1 0 5 5
Row strat 2 5 0 5

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 .5 0 5
Row strat 2 .5 5 0
Expected Value 5 5

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 0 10 0 0
Row strat 2 10 0 0 0
Column maximum 10 10
Minimum of Maxima 10 10

0 <= value <= 10

Results in list form ----------

ROW
Row strat 1 .5
Row strat 2 .5

COLUMN
Col strat 1 .5
Col strat 2 .5
(untitled)
Row's graph vs. Column's Strategies

Value
10 10Col strat 2

0 0Col strat 1
0 .5 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
10 10Row strat 2

0 0Row strat 1
0 .5 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:16:51

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 18 12 1
Row strat 2 24 6 0
Column mix 0 1

Value of game (to row) = 12

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 12 12
Row strat 2 0 6 6

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 1 18 12
Row strat 2 0 0 0
Expected Value 18 12

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 18 12 12 12
Row strat 2 24 6 6
Column maximum 24 12
Minimum of Maxima 12

Value= 12

Results in list form ----------

ROW
Row strat 1 1
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
24

18Col strat 1

12 12Col strat 2

0 11
p

(untitled)
Column's graph vs. Row's Strategies

Value
24Row strat 2

18Row strat 1

0
0 1
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:17:31

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 19 46 0
Row strat 2 34 89 1
Column mix 1 0

Value of game (to row) = 34

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 1 0
Row strat 1 19 0 19
Row strat 2 34 0 34

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 1 34 89
Expected Value 34 89

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 19 46 19
Row strat 2 34 89 34 34
Column maximum 34 89
Minimum of Maxima 34

Value= 34

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 1

COLUMN
Col strat 1 1
Col strat 2 0
(untitled)
Row's graph vs. Column's Strategies

Value
89

46Col strat 2

19Col strat 1

0
0 1
p

(untitled)
Column's graph vs. Row's Strategies

Value
89

34 34Row strat 2

19Row strat 1

0 11
q
SrinVas Raghavendra Rao MBA-OR SrinVas Raghavendra Rao
02-10-2014 15:18:07

Module/submodel: Game Theory

Problem title: (untitled)

Results ----------

Col Col
strat 1 strat 2 Row Mix
----------------------------------------------
Row strat 1 4 0 0
Row strat 2 4 0 0
Column mix 0 1

Value of game (to row) = 0

Row's Expected Values ----------

Main body of table contains Cell Payoff * column's optimal mix

Col Col Expected

strat 1 strat 2 Value
----------------------------------------------------
Col's optimal mix 0 1
Row strat 1 0 0 0
Row strat 2 0 0 0

Column's Expected Values ----------

Main body of table contains Cell Payoff * row's optimal mix

Row's Col Col

Opt Mix strat 1 strat 2
-------------------------------------------------
Row strat 1 0 0 0
Row strat 2 0 0 0
Expected Value 0 0

Maximin/Minimax ----------

Col Col Row Maximum

strat 1 strat 2 Minimum of Minima
---------------------------------------------------------------
Row strat 1 4 0 0 0
Row strat 2 4 0 0 0
Column maximum 4 0
Minimum of Maxima 0

Value= 0

Results in list form ----------

ROW
Row strat 1 0
Row strat 2 0

COLUMN
Col strat 1 0
Col strat 2 1
(untitled)
Row's graph vs. Column's Strategies

Value
4 4Col strat 1

name node End node Capacity capacity Flow
Branch 1 2 3 3 4 3
Branch 2 1 2 6 7 3

Iterations ----------

IterationPath Flow Cumulative Flow

1 1-> 2-> 3 3 3
NLP1
1. MAX=3*X1^2 - 4*X2^3;
12*X1^3+19*X2^4 <= 1200;
23*X1 - 34*X2 <= 1400;
X1>0;
X2>0;
Local optimal solution found at iteration: 25
Objective value: 64.63304

Variable Value Reduced Cost

X1 4.641589 0.000000
X2 0.000000 0.000000

Row Slack or Surplus Dual Price

Variable Value Reduced Cost

X1 7.071068 0.000000
X2 0.000000 0.000000

Row Slack or Surplus Dual Price

1 3.079201 1.000000
2 0.000000 1.154702
3 1.154700 0.000000
4 1.333256 0.000000

22.
MIN = 1*X * 1*Y;
1*X^2 + 1*Y >= 5;
X>=0;
Y>=O;

Page 9
NLP1
Local optimal solution found at iteration: 60
Objective value: 0.000000

Variable Value Reduced Cost

X 2.236062 0.000000
Y 0.000000 2.236062
O 0.000000 0.000000

Row Slack or Surplus Dual Price

1 0.000000 -1.000000
2 -0.2785470E-04 0.000000
3 2.236062 0.000000
4 0.000000 0.000000

X1 17.00000 0.000000
X2 4.000000 0.000000
X3 3.000000 0.000000

Row Slack or Surplus Dual Price

1 1628.000 -1.000000
2 0.000000 -11.00000
3 0.000000 -432.0000
4 0.000000 -12.00000

26.
MIN=12*X1+23*X2+54*X3;
X2>=13;
X3>=34;
X1+X2+X3=64;
Global optimal solution found at iteration: 0
Objective value: 2339.000

Variable Value Reduced Cost

X1 17.00000 0.000000
X2 13.00000 0.000000
X3 34.00000 0.000000

Row Slack or Surplus Dual Price

Page 11
NLP1
1 2339.000 -1.000000
2 0.000000 -11.00000
3 0.000000 -42.00000
4 0.000000 -12.00000

X 2.384615 0.000000
Y 4.000000 0.000000
U 6.000000 0.000000
V 35.61538 0.000000
Z 53.00000 0.000000

Row Slack or Surplus Dual Price

1 6.384615 -1.000000
2 0.000000 -0.3846154E-01
3 0.000000 0.3846154E-01
4 0.000000 0.000000
5 0.3846154 0.000000
6 0.000000 -1.730769
Page 13
NLP1
7 0.000000 -0.3846154E-01
8 32.61538 0.000000

30.MODIFIED SIMPLEX PROBLEM:(IMPORTANT)

LOOK AT THE CONSTRAINTS:THEY ARE NOT GREATER THAN OR EQUAL TO BUT EQUAL TO AND NON
NEGATIVITY CONSTRAINTS ARE GIVEN VALUES INSTEAD OF

1 6.655738 -1.000000
2 0.000000 0.5245902
3 0.000000 -0.1967213
4 0.000000 -0.8196721E-01
5 0.000000 -1.032787
6 0.6557377 0.000000
7 14.78689 0.000000
8 11.52459 0.000000
9 0.000000 0.000000

33.MIN = X + Y;
5*X - 2*Y + 3*U - 2*V + 6*Z = 40;
9*X - 4*Y + 8*U - 7*V + 4*Z = 80;
10*X + 9*Y + 4*V = 120;
X>=2;
Y>=4;
U>=8;
V>=3;
XY+UV+VZ>4;
Global optimal solution found at iteration: 3
Objective value: 6.655738

Variable Value Reduced Cost

X 2.000000 0.000000
Y 4.655738 0.000000
U 22.78689 0.000000
V 14.52459 0.000000
Z 0.000000 2.360656
XY 0.000000 0.000000
UV 0.000000 0.000000
VZ 4.000000 0.000000

Row Slack or Surplus Dual Price

1 6.655738 -1.000000
2 0.000000 0.5245902
3 0.000000 -0.1967213
4 0.000000 -0.8196721E-01
5 0.000000 -1.032787
6 0.6557377 0.000000
7 14.78689 0.000000
Page 16
NLP1
8 11.52459 0.000000
9 0.000000 0.000000

34.

CONVEX PROGRAMMING PROBLEM:

MAX = 4X - X^2 + 6Y - 3*Y^2;

5*X+9*Y<=6;
X>=0;
Y>=0;

X 15.71429 0.000000
Y 0.000000 20.80952

Row Slack or Surplus Dual Price

1 265.4762 1.000000
2 84.28571 0.000000
3 0.000000 2.095238
4 15.71429 0.000000
5 0.000000 0.000000

MAX=X+Y-X^2-Y^2;
X+Y<=2;
X>=0;
Y>=0;
Local optimal solution found at iteration: 31
Objective value: 0.5000000

Variable Value Reduced Cost

X 0.4999999 0.000000
Y 0.4999999 0.000000

Row Slack or Surplus Dual Price

1 0.5000000 1.000000
2 1.000000 0.000000
3 0.4999999 0.000000
4 0.4999999 0.000000

41.UNCONSTRAINED QUADRATIC PROGRAMMING PROBLEM WITH NON NEGATIVITY CONSTRAINTS /

OBJECTIVE FUNCTION AS MAXIMISATION:

MAX=X+Y-X^2-Y^2;
X>=0;
Y>=0;
Local optimal solution found at iteration: 38
Objective value: 0.5000000

Variable Value Reduced Cost

X 0.4999999 0.000000
Y 0.4999999 0.000000

Row Slack or Surplus Dual Price

1 0.5000000 1.000000
2 0.4999999 0.000000
3 0.4999999 0.000000

Page 20
NLP1

Page 21
NLP1

Page 22
NLP1

Page 23
This book was distributed courtesy of:

For your own Unlimited Reading and FREE eBooks today, visit:
http://www.Free-eBooks.net

Share this eBook with anyone and everyone automatically by selecting any of the
options below:

To show your appreciation to the author and help others have

wonderful reading experiences and find helpful information too,
we'd be very grateful if you'd kindly
post your comments for this book here.

Free-eBooks.net respects the intellectual property of others. When a book's copyright owner submits their work to Free-eBooks.net, they are granting us permission to distribute such material. Unless
otherwise stated in this book, this permission is not passed onto others. As such, redistributing this book without the copyright owner's permission can constitute copyright infringement. If you
believe that your work has been used in a manner that constitutes copyright infringement, please follow our Notice and Procedure for Making Claims of Copyright Infringement as seen in our Terms
of Service here:

http://www.free-ebooks.net/tos.html

Digital Modulations using Matlab
From Everand
Digital Modulations using Matlab
Mathuranathan Viswanathan
4/5 (6)
ENG2005 Lecture Book
No ratings yet
ENG2005 Lecture Book
230 pages
Griffin Mgmt12e IM Ch01
No ratings yet
Griffin Mgmt12e IM Ch01
13 pages
SharmaJK 2016 Contents OperationsResearchThe
100% (1)
SharmaJK 2016 Contents OperationsResearchThe
100 pages
Griffin Mgmt12e IM Ch16
No ratings yet
Griffin Mgmt12e IM Ch16
14 pages
Griffin Mgmt12e IM Ch12
No ratings yet
Griffin Mgmt12e IM Ch12
15 pages
Griffin Mgmt12e IM Ch16
No ratings yet
Griffin Mgmt12e IM Ch16
14 pages
Griffin Mgmt12e IM Ch10
No ratings yet
Griffin Mgmt12e IM Ch10
16 pages
Operations Research - Class1 To Class 3
50% (2)
Operations Research - Class1 To Class 3
53 pages
C. B. Gupta - Optimization Techniques in Operation Research-I.K. International (2020)
No ratings yet
C. B. Gupta - Optimization Techniques in Operation Research-I.K. International (2020)
381 pages
Mca 204
No ratings yet
Mca 204
9 pages
Instant Access to Operations Research 1st Edition Nita H. Shah ebook Full Chapters
No ratings yet
Instant Access to Operations Research 1st Edition Nita H. Shah ebook Full Chapters
87 pages
Lecture 14 Linear Programming
No ratings yet
Lecture 14 Linear Programming
43 pages
Optimization Technique
100% (6)
Optimization Technique
30 pages
J P Chauhan - Krishna's Optimization Techniques-Krishna Prakashan Media Pvt Ltd - Since 1942 (a Unit of the KRISHNA GROUP) (2020)
No ratings yet
J P Chauhan - Krishna's Optimization Techniques-Krishna Prakashan Media Pvt Ltd - Since 1942 (a Unit of the KRISHNA GROUP) (2020)
395 pages
Dleel Ul Aarfeen Ebookslang=Ur
No ratings yet
Dleel Ul Aarfeen Ebookslang=Ur
60 pages
Operations Research Notes Main
No ratings yet
Operations Research Notes Main
123 pages
OperReserch Book
No ratings yet
OperReserch Book
70 pages
Solution Manual for An Introduction to Management Science Quantitative Approaches to Decision Making 13th Edition by Anderson - Download Now To Experience The Complete Book
100% (8)
Solution Manual for An Introduction to Management Science Quantitative Approaches to Decision Making 13th Edition by Anderson - Download Now To Experience The Complete Book
40 pages
2 Linear Programming
0% (1)
2 Linear Programming
37 pages
Upendra Ojha 22mba014
No ratings yet
Upendra Ojha 22mba014
9 pages
BUS 2420 Management Science
No ratings yet
BUS 2420 Management Science
26 pages
Resource Management
No ratings yet
Resource Management
42 pages
Advanced Production and Operation Management
No ratings yet
Advanced Production and Operation Management
3 pages
Mahmut Parlar (Auth.) - Interactive Operations Research With Maple - Methods and Models-Birkhäuser Basel (2000)
No ratings yet
Mahmut Parlar (Auth.) - Interactive Operations Research With Maple - Methods and Models-Birkhäuser Basel (2000)
477 pages
Math 404 - W01 - Intro
No ratings yet
Math 404 - W01 - Intro
28 pages
Resource Management Techniques
40% (5)
Resource Management Techniques
228 pages
Concept and Definition
No ratings yet
Concept and Definition
42 pages
Optimasi LP
No ratings yet
Optimasi LP
30 pages
Unique Paper Code: 61011503 Name of The Paper: Quantitative Techniques in Management Name of The Course: Bachelor of Management Studies (CBCS) Semester: V Duration: 3 Hours Maximum Marks: 75
No ratings yet
Unique Paper Code: 61011503 Name of The Paper: Quantitative Techniques in Management Name of The Course: Bachelor of Management Studies (CBCS) Semester: V Duration: 3 Hours Maximum Marks: 75
5 pages
Integer Programming PDF
No ratings yet
Integer Programming PDF
141 pages
Maths Project Class 12
No ratings yet
Maths Project Class 12
13 pages
Mb0032 - Operation Research Set - 1 Solved Assignment
No ratings yet
Mb0032 - Operation Research Set - 1 Solved Assignment
13 pages
Maths Project
No ratings yet
Maths Project
27 pages
20BSC243 Operations Research QB
No ratings yet
20BSC243 Operations Research QB
18 pages
Handout OPTIMIZATION PDF
No ratings yet
Handout OPTIMIZATION PDF
2 pages
Operations Research: Dr. Sarat K Jena
No ratings yet
Operations Research: Dr. Sarat K Jena
98 pages
Introduction To Modeling: Different Forms
No ratings yet
Introduction To Modeling: Different Forms
21 pages
Name 479 - 9 QM
No ratings yet
Name 479 - 9 QM
56 pages
Operations Research
No ratings yet
Operations Research
574 pages
BUSI 2013 Unit 1-10 Notes
No ratings yet
BUSI 2013 Unit 1-10 Notes
10 pages
Solution Manual for Quantitative Methods for Business, 13th Edition - All Chapters Are Available In PDF Format For Download
100% (4)
Solution Manual for Quantitative Methods for Business, 13th Edition - All Chapters Are Available In PDF Format For Download
38 pages
BA7206-Applied Operations Research
No ratings yet
BA7206-Applied Operations Research
19 pages
Operations Research 2019
No ratings yet
Operations Research 2019
188 pages
Linear Programming Problem
100% (1)
Linear Programming Problem
27 pages
Apr 2015
No ratings yet
Apr 2015
112 pages
MIT15 053S13 Lec1 PDF
No ratings yet
MIT15 053S13 Lec1 PDF
36 pages
MIT15 053S13 Lec1
No ratings yet
MIT15 053S13 Lec1
36 pages
MB0048 Operations Research MQP
82% (11)
MB0048 Operations Research MQP
35 pages
Post Graduate Program in Management (PGPM)
No ratings yet
Post Graduate Program in Management (PGPM)
8 pages
OS Course Outline
No ratings yet
OS Course Outline
4 pages
ST Sol KMBN206 2023-25
No ratings yet
ST Sol KMBN206 2023-25
7 pages
Quantitative Assignment
No ratings yet
Quantitative Assignment
6 pages
Madras University Exam Paper
No ratings yet
Madras University Exam Paper
8 pages
Unit - V Aem
No ratings yet
Unit - V Aem
144 pages
Introduction To Management Science: With Spreadsheets
No ratings yet
Introduction To Management Science: With Spreadsheets
45 pages
MA30087/50087: Optimisation Methods of Operational Research
No ratings yet
MA30087/50087: Optimisation Methods of Operational Research
88 pages
Reinforcement Learning: A Practical Guide to Algorithms
From Everand
Reinforcement Learning: A Practical Guide to Algorithms
Trilokesh Khatri
No ratings yet
Notes in Operations Research
From Everand
Notes in Operations Research
Rahul Basu
No ratings yet
SOA Modeling Patterns for Service-Oriented Discovery and Analysis
From Everand
SOA Modeling Patterns for Service-Oriented Discovery and Analysis
Michael Bell
No ratings yet
Supply Chain and Operations Insights
From Everand
Supply Chain and Operations Insights
Sachin Nambeesan
No ratings yet
Data Mining Models: Techniques and Applications
From Everand
Data Mining Models: Techniques and Applications
Ravi Deshpande
No ratings yet
Hidden Surface Determination: Unveiling the Secrets of Computer Vision
From Everand
Hidden Surface Determination: Unveiling the Secrets of Computer Vision
Fouad Sabry
No ratings yet
Unlocking Statistics for the Social Sciences
From Everand
Unlocking Statistics for the Social Sciences
Norma Sinclair
No ratings yet
Mastering Dynamic Programming in Java
From Everand
Mastering Dynamic Programming in Java
Ed A Norex
No ratings yet
Ultimate Scrum: 15 Scrum Training Courses In A Day
From Everand
Ultimate Scrum: 15 Scrum Training Courses In A Day
Simon Kneafsey
No ratings yet
Griffin Mgmt12e IM Ch17
No ratings yet
Griffin Mgmt12e IM Ch17
13 pages
Griffin Mgmt12e IM Ch15
100% (1)
Griffin Mgmt12e IM Ch15
14 pages
Griffin Mgmt12e IM Ch13
No ratings yet
Griffin Mgmt12e IM Ch13
16 pages
Griffin Mgmt12e IM Ch18
No ratings yet
Griffin Mgmt12e IM Ch18
4 pages
Griffin Mgmt12e IM Ch09
No ratings yet
Griffin Mgmt12e IM Ch09
13 pages
Griffin Mgmt12e IM Ch06
No ratings yet
Griffin Mgmt12e IM Ch06
15 pages
Griffin Mgmt12e IM Ch11
No ratings yet
Griffin Mgmt12e IM Ch11
16 pages
Griffin Mgmt12e IM Ch04
0% (1)
Griffin Mgmt12e IM Ch04
13 pages
Griffin Mgmt12e IM Ch07
No ratings yet
Griffin Mgmt12e IM Ch07
10 pages
Understanding The Organization's Environment: Chapter Summary
No ratings yet
Understanding The Organization's Environment: Chapter Summary
13 pages
Griffin Mgmt12e IM Ch02
No ratings yet
Griffin Mgmt12e IM Ch02
13 pages
Fundamental Management Skills
No ratings yet
Fundamental Management Skills
3 pages
Sales Management Is Very Good and The Best For MBA Students
No ratings yet
Sales Management Is Very Good and The Best For MBA Students
1 page
Taylor and Laurent Series.
No ratings yet
Taylor and Laurent Series.
3 pages
Faculty Recruitment: Time: 1 Hour Total No. of Questions: 6 Maximum Marks: 60
No ratings yet
Faculty Recruitment: Time: 1 Hour Total No. of Questions: 6 Maximum Marks: 60
3 pages
Mathematics Scheme of Work
No ratings yet
Mathematics Scheme of Work
4 pages
text-58-toc
No ratings yet
text-58-toc
4 pages
Stat 210 Notes
No ratings yet
Stat 210 Notes
70 pages
H. Bateman, A. Erdélyi Et Al. - Higher Transcendental Functions 3 (1955, McGraw-Hill)
No ratings yet
H. Bateman, A. Erdélyi Et Al. - Higher Transcendental Functions 3 (1955, McGraw-Hill)
310 pages
2nd pu mathematics MCQs passing package
No ratings yet
2nd pu mathematics MCQs passing package
19 pages
Am. GM - HM
No ratings yet
Am. GM - HM
2 pages
Cover Page: Additional Mathematics SA2 Overall Revision Notes
No ratings yet
Cover Page: Additional Mathematics SA2 Overall Revision Notes
5 pages
Graphs of Polynomial Functions
No ratings yet
Graphs of Polynomial Functions
38 pages
Linear Programming
100% (1)
Linear Programming
28 pages
Prob DB
No ratings yet
Prob DB
3 pages
Maths For Intelligent Systems
No ratings yet
Maths For Intelligent Systems
76 pages
David Liu Notes
No ratings yet
David Liu Notes
79 pages
Formula Book For Cbse Board: Class 10 - Maths
No ratings yet
Formula Book For Cbse Board: Class 10 - Maths
6 pages
Teaching Innovations in Real Analysis:: David Bressoud Macalester College, St. Paul, MN New Orleans, January 7, 2007
No ratings yet
Teaching Innovations in Real Analysis:: David Bressoud Macalester College, St. Paul, MN New Orleans, January 7, 2007
15 pages
11 Math23
No ratings yet
11 Math23
2 pages
International Olympiad Practice Problems
No ratings yet
International Olympiad Practice Problems
2 pages
039) Basic Mathematics - DPP 01 Neev Diamond 2025 Recorded
No ratings yet
039) Basic Mathematics - DPP 01 Neev Diamond 2025 Recorded
2 pages
Algebra Success in 20 Minutes A Day
100% (1)
Algebra Success in 20 Minutes A Day
224 pages
Updated Answer Key With Corrected Answer of Q-14
No ratings yet
Updated Answer Key With Corrected Answer of Q-14
3 pages
Program For Shortest Job First
No ratings yet
Program For Shortest Job First
2 pages
Math 9 2nd Summative With Key
82% (11)
Math 9 2nd Summative With Key
2 pages
One-dimensional space - Wikipedia
No ratings yet
One-dimensional space - Wikipedia
2 pages
Module 5.1 - AnalyticGeom - Lines
No ratings yet
Module 5.1 - AnalyticGeom - Lines
24 pages
Chapter 5
No ratings yet
Chapter 5
33 pages
Percentage Grade 6
No ratings yet
Percentage Grade 6
10 pages
10.laplace Equation PDF
No ratings yet
10.laplace Equation PDF
14 pages