EMGT 501 Mid-Term Exam Due Day: Oct. 18 (Noon).

Slides:



Advertisements
Similar presentations
Applications of Optimization To Operations Management
Advertisements

EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
IENG442 LINGO LAB3.
Understanding optimum solution
4-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
Lesson 11 Multicriteria Decisions within LP Framework.
1 1 Slide © 2005 Thomson/South-Western Q 5 – 13 x 1 = the probability that Station A will take Sitcom Rerun x 2 = the probability that Station A will take.
4.4 Cramer’s Rule. You can use the determinant of a matrix to help you solve a system of equations. For two equations with two variables written in ax.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Solving Examples of Linear Programming Models
EMGT 501 HW #2 Due Day: Sep 27 Chapter 6 - SELF TEST 21
EMGT 501 HW # Due Day: Sep 27.
EMGT 501 HW #2 Answer. 020/3 X 3 05/601-1/62/3050/3 X 6 0-5/300-2/3-1/3180/3 (c).3/230with )3/80,0,0,3/50,3/20,0(*)*, ( solution Optimal   Z.
Q 2-31 Min 3A + 4B s.t. 1A + 3B ≧ 6 B = - 1/3A + 2 1A + 1B ≧ 4
EMGT 501 HW #2 Solutions Chapter 6 - SELF TEST 21 Chapter 6 - SELF TEST 22.
Review problem 1 QP dolls, Inc., has developed a new doll it feels could turn into a “collector’s item” through proper advertisement. The PERT/ CPM network.
EMGT 501 Mid-Term Exam Due Day: Oct 23- Midnight.
EMGT 501 Fall 2004 Midterm Exam AN ANSWER EXAMPLE.
B-1 Operations Management Linear Programming Module B.
Pet Food Company A pet food company wants to find the optimal mix of ingredients, which will minimize the cost of a batch of food, subject to constraints.
Due Day: Dec 8 (Monday), 2008 (9:00AM)
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Game Theory.
6-1 Solving Inequalities by Addition and Subtraction Objective: Students will be able to solve linear inequalities by using addition and subtraction.
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
FOOD LABELS Ashley Benbow-Scarborough. Content Area: Health/Wellness Grade Level: 7 Summary: The purpose of this instructional PowerPoint is to help students.
NUTRITIONAL NEEDS By: Jenny Broschardt. NUTRITION Nutrition is the study of food and your body needs nutrients for sources of energy, materials for growth.
Learning About Food Labels. Finding Your Way Around Takes you back to the previous slide Takes you to the next slide Takes you to the main menu.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
Ardavan Asef-Vaziri Systems and Operations Management
Total Health Class 6 Nutrition Back to the Basics September 27, 2011.
EMGT 501 Fall 2005 Final Exam Due Day: Dec 12 (Noon)
National Food Service Management Institute Section 2: Menus 1 Food Purchasing for Child Care Centers Section 2: Menus (Step 1)
National Food Service Management Institute Section 2: Menus 1 Food Purchasing for Child Care Centers Section 2: Menus (Step 1)
Lecture 1 Modeling: Linear Programming I
EMGT 501 Fall 2005 Midterm Exam Due Day: Oct 17 (Noon)
The coefficient matrix for a system of linear equations in standard form is the matrix formed by the coefficients for the variables in the equations. For.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
1 Bob and Sue solved this by hand: Maximize x x 2 subject to 1 x x 2 ≤ x x 2 ≤ 4 x 1, x 2 ≥ 0 and their last dictionary was: X1.
The Nutrition Label The answer to the question “How good is this food for me?”
Advanced Algebra II Notes 6.6 Linear Programming
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
PERT/CPM F G A E H I J K D St T B C
ChooseMyPlate.gov Students will… * understand MyPlate and use it to help make better food choices. * be able to plan their own healthy meal.
Solve Linear Systems by Substitution Section 6.2 beginning on page 337.
1 Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Mean & Standard Deviation The mean value of a random variable X, denoted by  X, describes.
Solving Linear Optimization Problems Using the Solver Add-in.
PHED 1111: Physical Education Spring 2012 Section:205
Nutrition What do you know?.
Applications of Linear Programming
Tools for Decision Analysis: Analysis of Risky Decisions
Operations Management Linear Programming Module B
NUTRITIONAL FACTS.
Reading Nutrition Fact Labels
Solutions Sample Games 1
Copyright ©2015 Pearson Education, Inc. All right reserved.
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
LP Modeling Most common type of LP involves allocating resources to activities Determining this allocation involves choosing the levels of the activities.
Lunch Meal Pattern Requirements
EMGT 501 Fall 2005 Final Exam Due Day: Dec 12 (Noon)
Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.
Copyright © 2019 Pearson Education, Inc.
Solving Linear Optimization Problems Using the Solver Add-in
3/23: Limiting Reactant DO NOW
Section 7.5 Linear Programming.
Presentation transcript:

EMGT 501 Mid-Term Exam Due Day: Oct. 18 (Noon)

Note: (a) Do not send me after copying your computer results of QSB. Answer what are your decision variables, formulation and solution, only. See my HW answer on my HP. (b) Put your mailing address so that I will be able to return your exam result via US postal service. (c) Answer on a PPS series of slides. (d) Do not discuss on the exam with other students. (e) Return your answer attached to your e-mail.

1. Joyce and Marvin run a day care for preschoolers 1. Joyce and Marvin run a day care for preschoolers. They are trying to decide what to feed the children for lunches. They would like to keep their costs down, but also need to meet the nutritional requirements of the children. They have already decided to go with peanut butter and jelly sandwiches, and some combination of graham crackers, milk, and orange juice. The nutritional content of each food choice and its cost are given in the table below.

Calories from Fat Total Calories Vitamin C (mg) Protein (g) Cost (¢) Food Item Bread (1 slice) 10 70 3 5 Peanut butter (1tbsp) 75 100 4 4 Strawberry jelly (1 tbsp) 50 3 7 Graham cracker (1 cracker) 20 60 1 8 Milk (1 cup) 70 150 2 8 15 Juice (1 cup) 100 120 1 35

The nutritional requirements are as follows The nutritional requirements are as follows. Each child should receive between 400 and 600 calories. No more than 30 percent of the total calories should come from fat. Each child should consume at least 60 milligrams (mg) of vitamin C and 12 grams (g) of protein. Furthermore, for practical reasons, each child needs exactly 2 slices of bread (to make the sandwich), at least twice as much peanut butter as jelly, and at least 1 cup of liquid (milk and/or juice). Joyce and Marvin would like to select the food choices for each child which minimize cost while meeting the above requirements. (a) Formulate a linear programming model for this problem. (b) Solve the problem.

2. Consider the following problem. Let and denote the slack variables for the respective constraints. After you apply the simplex method, a portion of the final simplex tableau is as follows: Eq. Z (0) 1 2 (1) -1 (2) Basic Variable Right Side Coefficient of: 1 x 2 x 3 x 4 x 5 x 6 x 2 x 4 x (a) Solve the problem. (b) What is B-1 ? How about B-1b and CBB-1b ?

3. Alfred Lowenstein is the president of the research division for Better health, Inc., a major pharmaceutical company. His most important project coming up is the development of a new drug to combat AIDS. He has identified 10 groups in his division which will need to carry out different phases of this research and development project. Referring to the work to be done by the respective groups as activities A, B, …, J, the precedence relationships for when these groups need to do their work are shown in the following project network.

A E I C F START Finish D G J B H Duration Activity Estimated Mean Estimated Variance A 4 months 5 months B 6 months 10 months C 4 months 8 months D 3 months 6 months E 8 months 12 months F 4 months 6 months G 3 months 5 months H 7 months 14 months I 5 months 8 months J 5 months 7 months

Find the mean critical path for this project. Use this mean critical path to find the approximate probability that the project will be completed within 22 months. Now consider the other three paths through this project network. For each of these paths, find the approximate probability that the path will be completed within 22 months. What should Alfred tell his CEO about the likelihood that the drug will be ready within 22 months?

4. Consider the game having the following payoff table. Player 2 Strategy 1 2 3 4 1 5 -3 3 -1 Player 1 2 -2 4 3 2 3 3 2 -4 4 (a) Formulate the problem of finding optimal mixed strategies according to the maxmin criterion as a linear programming problem. (b) Use the simplex method to find these optimal mixed strategies.