
User Name: Password: 
Worksheet Title: or fill in: 
To keep server load down, there is a maximum of 100 questions per worksheet. Create Answer Sheet (PopUp Window) Show how to solve it! (PopUp Window) Mix up the problems. (Good for tests) Multiple Choice (Good for Standardized Test practice) Move Instructions into Problems Interactive Online Test (students only! Limited to 20 questions at a time) 
Answer Blanks:
Percent of problems with fractional coefficients (Only where applicable)
Start Numbering with: (Whole Numbers only)
Condense  Leave no room for student work 
Select the number of each type of objective: (Selecting Random will randomly generate all subtypes) Click on any title to see the free sample worksheet. (only the first few samples are free) (Random) (2.A) Graph Theory. Explain the concept of graphs; (Random) (2.B) Graph Theory. Use graph models for simple problems in management science;and (3.G) Explain the relationship between scheduling problems and bin packing problems. (Random) (3.E) Planning and Scheduling. Use any of six heuristic algorithms to solve bin packing problems; (Random) (3.F) Planning and Scheduling. Solve independent task scheduling problems using the list processing algorithm; (Random) (4.A) Group decision making. Describe the concept of a preference schedule and how to use it; (Random) (4.B) Group decision making. Explain how particular decisionmaking schemes work; (Random) (4.C) Group decision making. Determine the outcome for various voting methods, given the voters' preferences; (Random) (4.D) Group decision making. Explain how different voting schemes or the order of voting can lead to different results; (Random) (4.E) Group decision making. Describe the impact of various strategies on the results of the decisionmaking process; 
and (6.B) Represent a game with a matrix; (Random) (6.C) Game Theory. Identify basic game theory concepts and vocabulary; and (6.D) Determine the optimal pure strategies and value of a game with a saddle point by means of the minimax technique; (Random) (6.E) Game Theory. Explain the concept of and need for a mixed strategy; and (6.F) Compute the optimal mixed strategy and the expected value for a player in a game who has only two pure strategies; (Random) (6.G) Game Theory. Model simple twobytwo, bimatrix games of partial conflict; (6.H) Identify the nature and implications of the game called "Prisoners' Dilemma"; (6.I) Explain the game known as "chicken"; and (6.J) Identify examples that illustrate the prevalence of Prisoners' Dilemma and chicken in our society; (Random) (6.K) Game Theory. Determine when a pair of strategies for two players is in equilibrium. (Random) (7.A) Theory of Moves. Compare and contrast TOM and game theory; and (7.B) Explain the rules of TOM; (Random) (7.C) Theory of Moves. Describe what is meant by a cyclic game; and (7.D) Use a game tree to analyze a twoperson game; (Random) (7.E) Theory of Moves. Determine the effect of approaching Prisoners' Dilemma and chicken from the standpoint of TOM and contrast that to the effect of approaching them from the standpoint of game theory; (Random) (7.F) Theory of Moves. Describe the use of TOM in a larger, more complicated game; and (7.G) Model a conflict from literature or from a reallife situation as a twobytwo strict ordinal game and compare the results predicted by game theory and by TOM. 
Permissions  Can you photocopy these worksheets?
