ENGI 310 Operations and Research Logistic

Introduction to basic principles and application of deterministic analytical methods. Topics include linear programming, dynamic programming, nonlinear optimization, and genetic algorithms.

The purpose of this course is to introduce students to Operations Research (OR) with an emphasis on the application of deterministic models and algorithms. The course will use relevant examples to teach students about fundamental OR concepts. Students will gain the skills required to apply OR principles to solve real-world problems that exists in industrial processes and business management. These skills include formulating and implementing OR deterministic models and algorithms mathematically and with Excel Solver. Overall, students will develop values, knowledge and gain the experience required to contribute significant Engineering solutions that will impact lives for Christ. 

No details available.

After reading the Course Syllabus and Student Expectations, the student will complete the related checklist found in the Course Overview.

Discussions are collaborative learning experiences. Therefore, the student is required to provide a thread in response to the provided prompt for each Discussion. Each thread must be at least 300 words and demonstrate course-related knowledge. For each thread, the student must support assertions with at least two (2) scholarly sources. The student must CITE and LIST the sources consulted (even if it is the textbook) using the APA format for reference citing and listing. In addition to the thread, the student is required to reply to one other classmate’s thread. Each reply must be at least 150 words.

The assigned problem set will enable the student to implement the guidelines for creating good spreadsheet models, and will allow the student to enter, organize, and manipulate collected data in an Excel spreadsheet.

The assigned problem set will enable the student to formulate mathematical Linear Programming (LP) models for small size OR problems, and solve OR problems using LP graphical and algebraic solution methods. The student should explicitly show his/her working steps that lead to his/her answer for full credit.

The assigned problem set will enable the student to solve Linear Programming problems using the Simplex Algebraic, Tabular and Matrix methods. The student should explicitly show the calculation working steps that leads to his/her answer to earn full credit.

The assigned problem set will enable the student to use the Northwest Corner rule to solve transportation problems, formulate and reformulate transportation and assignment problems, and construct parameter tables and draw the network diagrams for transportation and assignment problems. The student should explicitly show the calculation working steps that leads to his/her answer in order to receive full credit.

The assigned problem set will enable the student to formulate and construct network representation diagrams for shortest-path problems, and implement the shortest-path algorithm. The student should explicitly show the calculation working steps that leads to his/her answer for full credit.

The assigned problem set will enable the student to solve Binary IP and Mixed IP problems with the branch and bound method. The student should explicitly show the calculation working steps that leads to his/her answer to earn full credit.

The assigned problem set will enable the student to formulate non-linear programming problems, and use Bisection and Newton methods to solve unconstrained non-linear programming problems. The student should explicitly show the calculation working steps that leads to his/her answer to earn full credit.

The assigned problem set will enable the student to construct and use KKT conditions to solve constrained non-linear programming problems. The student should explicitly show the calculation working steps that leads to his/her answer to earn full credit.

These assignments are based on case study, examples, or specific scenario problems from required textbook. The student will use Microsoft Excel Solver package to solve problems presented in the scenarios and case studies. Each assignment is based on a concept in the week’s assigned Read Item. The student will experience practical application of such concepts using Microsoft Excel Solver.  

Each quiz will cover the Textbook material assigned for the Module: Week. Each quiz will be open-book/open-notes, consist of 10-11 multiple-choice, true/false, calculations, short answer, etc. questions, and have a time limit of 40-80 minutes. The quizzes will allow for 2 attempts with the last attempt counting towards the grade.