Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Decision making under uncertainty
Various methods are used to make decision in circumstances whereas only the pay offs are identified and the likelihood of every state of nature are identified
a) Maximin Method
This criterion is based upon the "conservative approach' to suppose that the worst possible is going to occur. The decision maker considers every strategy and locates the minimum pay off for each and then selects that alternative that maximizes the minimum payoff
Demonstration
Rank the products A, B and C applying the Maximin rule b using the given payoff table showing potential losses and profits which are expected to arise from launching these three products in three market situation
Pay off table in £ 000's
Boom condition
Steady state
Recession
Mini profits row minima
Product A
+8
1
-10
Product B
-2
+6
+12
Product C
+16
0
-26
In above table
Ranking the MAXIMIN rule = BAC
Write the next two terms √12, √27, √48, √75................... Ans: next two terms √108 , √147 AP is 2 √3 , 3 √3 , 4 √3 , 5 √3 , 6 √3 , 7 √3 ......
5 years however, a man's age will be 3times his son's age and 5 years ago, he was 7 times as old as his son. Find their present ages.
Q1- different types of rectilinear figures? Q2- interior and exterior angles of the polygon? Q3-relation between interior and exterior angles of polygons? Q4- properties of any fiv
Find out the greater of two consecutive positive odd integers whose product is 143. Let x = the lesser odd integer and let x + 2 = the greater odd integer. Because product is a
A farmer has a rectangular field of length 100m and breadth 70m. He leaves a path of 1m all along the boundary inside it. He decides to apply a manure to the remaining part of the
what is the least number of faces and bases the paperweight could have?
Graph A graph G = (V, E) contains a (finite) set that is denote by V, or by V(G) if one wishes to make clear which graph is under consideration, and a collection E, or E(G), o
1. Using suffix trees, give an algorithm to find a longest common substring shared among three input strings: s 1 of length n 1 , s 2 of length n 2 and s 3 of length n 3 .
FIRST OF ALL I WANNA KNOW THECHNIQUES, I CAT DIVIDE BIG BIG NUMBERS , EVERYTHING IN MATH IIS VERY HARD FOR ME I HOPE YOU CAN HELP ME
Solving for X in isosceles triangles
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd