## Theoretical Operations Research Example

Finding the optimal solution for real, meaningful problems is beyond the capability of any computer if the decision problem is not modeled correctly, or if an optimization methodology is not devised to solve the problem efficiently. The total number of alternatives is usually too large for direct enumeration.

To illustrate this point, we would like to present a small theoretical example. Putting aside the complexities involved in a real problem (i.e., probabilistic rates of deterioration, the multi-period nature of the decision problem, the large numbers of condition states, and budget constraints), let us consider a simple problem from operations research literature called the "Assignment Problem." Suppose there are 70 people, capable of performing each of 70 jobs with varying degrees of cost. We want to assign the 70 people to the 70 jobs such that the total cost is minimized. Suppose we did not have any technique to solve the problem but had an extremely fast computer to compare all the alternatives. Let us call this "The Brute Force Method." Suppose this super-computer was capable of evaluating ten billion alternatives per second. The number of alternatives is 70 factorial (70!) which, using Stirling's approximation, n! ~ (n(n + .5) e -n )Ã¢Ë†Å¡2p, is approximately 10100. Clearly, the problem cannot be solved by this Brute Force Method. To obtain an appreciation of this number, suppose the computer had started working at the time of the 'Big Bang," which is thought to have occurred 15 billion years ago. The number of alternatives it would have computed by now would have been 15 x 109 years x 365 days x 24 hours x 60 minutes per hour x 60 seconds per minute x 1010 calculations per second on an extremely fast computer. This equals roughly 4.73 x 1027 computations. In fact, had the earth been covered by such computers, all working on the problem, the task still would not have been completed!

Alternatively, "The Simplex Method" of linear programming on a PC would find the optimal solution to this problem in a matter of minutes, and a specialized code for the Assignment Problem in even less time.

Let us consider a problem closer to the problem at hand. Suppose we had only 100 segments and the possibilities involved only two decisions: maintain or replace (again ignore the complexities associated with the actual multi-period nature of the problem, uncertainties, and budget constraints). Even this simplest of problems involves 2100 alternatives which is approximately 1030. In the example the super computer described earlier, this would need 3,170 billion years for its computations! On the other hand, the specialized algorithm developed for TUBIS would solve the above problem with multiple periods and budget constraints in a matter of minutes.

prada cross body bags chatgpt programming prada picture eddiebauer.com outlet cork rolls beard long goatee cardinal building group gucci clothing online prada loafter weird spiky fruit how much is gucci chatgpt ticker symbol prada pr 07ys ugg discount outlets prada claw clip prada golf bag gucci moda bulletin board walls volcom outlet store dan prompt chatgpt prada book bag prada outlet shoes prada green jacket men's clothing outlet online prada replacement strap ugg outlet prices prada coin pouch instagram followers stuck eric's all trades construction llc chatgpt trading bot silver prada sunglasses active followers instagram prada shoulder bags prada crystal heels high end outlet extra large corkboard prada midnight train موقع غوتشي mens prada scarves instagram followers analytics prada windbreaker mens prada nails price prada shoes auto club travel packages yacht cap tamagotchi game chatgpt 免费 infusion prada captian outfit prada sunglasses bloomingdale's instagram glitch followers prada buy prada l'homme review instagram 3000 followers prada ocean review chatgpt plus api gucci shoes and bags knit prada bag cloud buster prada stella mccartney bags outlet instagram followers graph prada sunglasses bloomingdale's prada odette boat captain hat red fruit with hair prada ski suit chatgpt free online prada crossbody wallet prada nylon dupe meijs motorman for sale online brand outlet chatgpt architecture dan prompt chatgpt jazztrax catalina 2016 gucco tommy hilfiger outlet stores cambridge dual brown shingles roofing supplies st louis mo prada velvet bag prada pr19ws prada milano sweater prada socks men prada ski suit instagram followers reports who made prada prada frank ocean delta 12 10 kayak chatgpt salesforce prada car us puma shoes gucci fendi prada best prada perfumes mix marketing prada purfume prada thongs underwear prada velcro sneakers galleria bag prada prada patent loafer tamagochi family wigmaking garth brooks maria christmas song prada scarf men prada internship gucci com men prada boots followers instagram buy prada shoes leather asian spiky fruit snow patrol run lyrics meaning

Of course, the pipe maintenance problem is far more intricate than the above examples. Economical and risk issues, uncertainty in deteriorations, current and future budgets, the interconnection between actions taken now and those needed in the future, and environmental issues each add to the complexity of the problem. These additional variables make The Brute Force Method an even more unrealistic way of deciding actions to be taken on a complex pipeline network.

It should be evident from the simple, illustrative examples above that operations research modeling is necessary to properly make decisions in a complex system with a large set of variables such as a pipeline, bridge, or road network.