QBA2sp03.doc

303 views
262 views

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
303
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

QBA2sp03.doc

  1. 1. QUANTITATIVE BUSINESS ANALYSIS II BAD 5242 SPRING 2003 Course Instructor: Samir Barman, Ph.D. Office: 219C Adams Hall Phone: 325-2651 and 325-5717 Fax: 325-1957 E-mail: sbarman@ou.edu Office Hours: 10:30-12:00 Monday and Wednesday, 2:00-2:50 Tuesday and Thursday, or by appointment Course Text: a. Custom published from Quantitative Analysis for Management by Render, Stair and Hanna, Prentice Hall, 8th ed., 2003 and Principles of Operations Management by Heizer and Render, Prentice Hall, 4th ed., 2001, and b. Course packet (available at King Kopy) Computer Software: POM for Windows by Howard J. Weiss, Version 2.0, Prentice Hall (available on the computer network in the graduate computer lab) Course Description: Quantitative Business Analysis II is the second of two required courses designed to prepare MBA students with a set of tools to meet the challenges of today's business environment. This course is about management science and includes a set of deterministic models specifically selected from several topical areas. The objectives are: 1) to develop a solid foundation in important management science concepts and techniques, and 2) to provide a thorough understanding of their applications in solving business problems. In addition, the course will stress the use of computer software to analyze and solve related problems on a microcomputer. Course Design: The course will be taught by lecture with class interaction. As is true for any quantitative course, problem solving will be emphasized. A typical session may include explaining concepts, solving problems, and discussing related issues. Lecturing on the computer procedures will be occasional. And it will not be initiated, unless specific questions warrant such an endeavor on my part. Therefore, you are expected to familiarize yourself with the computer package mostly on your own or through group efforts. Office hours or any other mutually convenient time may be considered for discussing computer related questions. Prerequisites: As indicated earlier, the course is quantitative. Students, however, need not have a strong mathematics background to successfully complete the course. No knowledge beyond elementary algebra and arithmetic will be used; however, some basic knowledge of matrix manipulation could be helpful.
  2. 2. Individual Assignments: In order to emphasize problem solving, more than 100 end-of-chapter problems have been assigned for your practice. You will have to turn in some, but not all, of these problems as your individual assignments. However, it is suggested that you solve all of them and check with the answers in the solution manual. Group Assignments: Students, in groups, will have to analyze several mini-cases. Detailed information about these assignments will be provided in class. Tests: There will be two tests during the semester as shown in the schedule. Each test will require answering short and/or multiple-choice questions, solving problems, and interpreting computer generated solutions. The second test will not include the topics covered on the first. Grading Policy: Your overall score will be determined using the following criteria: Test 1 30% Test 2 30% Group Assignments 20% Individual Assignments 10% Attendance and Class Participation 10% 100% The final course grade will be based on: a. student's overall score (in percent) using the above formula and b. student's average score (in percent) from the two tests. Make-up Tests: Make-up tests will be arranged only in cases of illness, emergencies, or absolutely unavoidable situations. Students must explain such situations with appropriate supporting documents to justify a make-up test. Make-up tests are different from the regular tests and will be given only during the final exam week at a mutually convenient time. Miscellaneous: The syllabus provides the lecture schedule in detail so you can read the material in advance and prepare yourself for discussion. Your response, preparedness, and contribution to class discussions will be used to assess your class participation score. Therefore, regular attendance is both expected and encouraged. Your attendance will be monitored, but no regular roll will be taken. Any student in this course who has a disability that may prevent him or her from fully demonstrating his or her abilities should contact me personally as soon as possible so we can discuss accommodations necessary to ensure full participation and facilitate your educational opportunities.
  3. 3. TENTATIVE SCHEDULE Note: Omit the sections that are excluded from each chapter Date Chapter and Topic Text Problems Jan 14 Chapter 1: SP denotes solved problems. Introduction to Quantitative Analysis PR denotes end-of-chapter , Sections: 1.1 - 1.4, 1.6 – 1.7 practice problems. Chapter 6: SP: 6.1-6.4 Linear Programming Models: PR: 6.1-6.3, 6.5-6.10, Graphical and Computer Methods 6.14-6.15, 6.18-6.23, Sections: 6.1 - 6.8 6.26-6.32, 6.37-6.38, 6.40 Jan 16 Chapter 6: Jan 21 Chapter 7: Linear Programming Modeling Applications PR: 7.1-7.10, 7.12-7.13, Sections: 7.1 - 7.8 7.17, 7.21-7.23 Jan 23 Chapter 8: SP: 8.1-8.3 Linear Programming: The Simplex Method PR: 8.1-8.9, 8.11, Sections: 8.1 - 8.11 8.17-8.19, 8.21-8.26, 8.34-8.37 on computer: 8.47, 8.48 Jan 28 Chapter 8: (mini-case #1 due: Jan 28) Jan 30 Chapter 9: SP: 9.1-9.4 Transportation and Assignment Models PR: 9.1-9.6, 9.11-9.15, Sections: 9.1 - 9.11, 9.13 - 9.15 9.17-9.19, 9.21, 9.28-9.30, Appendix: 9.1 9.32-9.36 Feb 04 Chapter 9: (mini-case #2 due: Feb 04) Feb 06 Review
  4. 4. Feb 07 Test 1 Chapters: 1, 6, 7, 8, and 9 Feb 11 Chapter 3: SP: 3.1-3.3 Fundamentals of Decision Theory Models PR: 3.2-3.8, 3.10-3.17, Sections: 3.1 - 3.6; Appendix: 3.1 3.19-3.24, 3.30 (omit the section on pages (93-95) Feb 13 Chapter 3: Feb 18 Chapter 4: SP: 4.1 Decision Trees and Utility Theory PR: 4.1-4.3, 4.6-4.11, Sections: 4.1 - 4.2, 4.4 4.13-4.18, 4.22, Appendix: 4.1 4.32-4.33, 4.35 Note: Students are expected to review Chapter 2 on their own before studying Chapter 10 Chapter 2 SP: 2.1-2.8 Probability Concepts and Applications PR: 2.29-2.32, Sections: 2.1 - 2.5, 2.8 - 2.13 2.34-2.35, 2.37-2.45 Feb 20 Chapter 10: SP: 10.1-10.4 Waiting Lines and Queuing Theory Models PR: 10.1-10.7, 10.10-10.12, Sections: 10.1 - 10.9 10.15-10.18, 10.23, 10.27, Appendix: 10.1 10.29-10.31 Feb 25 Chapter 10: (mini-case #3 due: Feb 25) Feb 27 Chapter 5: SP: 5.1-5.3 Inventory Control Models PR: 5.1-5.9, 5.11-5.13, Sections: 5.1 - 5.9 5.16-5.23, 5.28- 5.29, (omit the section on pages (214-215) 5.31-5.32, 5.35-5.36, Appendix: 5.1 5.38-5.40, 5.42 Mar 04 Chapter 5: Mar 06 Review; Introduction to POM
  5. 5. Mar 07 Test 2 Chapters: 3, 4, 5, and 10

×