3. Linear programming is typically applied to problems, wherein one must make a decision at a specified point (or points) in time. Dynamic programming is typically applied to problems wherein one must make a sequence of decisions

a.) True

b.) False

1) En real-world queuing, applications, the murripie - server system analysis techniques are the same whether customers wait in one line or in sepi ate lines are to customer balking a.) TRUE b.) fabe 2) pyramic programming can only be used to solve network-based problems a) TRUE b.) False 4) a stage is acn) a) alternatwe b.) policy c) condition at ence of the problem a:) subproblem e) none of these 5) game theory assumes that players behave a) logically b) emotionally c.) rationally d) logically, emoronaly & rationally e) cogically and emotionally (6.) in the long run in Marka anareysis a) au stare popabilities will eventually boome peros or ones b) generally, the vector of state probabiliries when multipled by the matrixces- transition probabilities, will yied the same vecrores soate probablities c) the marrix co transinon probabilitie will charge to equilibrium state d.) all of these e.) none of thece