Karla Hoffman
Home
Presentations
Courses
Recent Papers
Curr. Vitae

Professor
Systems Engineering and Operations Research Dept.
Volgenau School of Information Technology and Engineering
Engineering Building, room 2207, Mail Stop 4A6
George Mason University
Fairfax, VA 22030-4444
phone: 703-993-1679
fax: 703-993-1521
email: khoffman@gmu.edu

___________________________________________________________________________________________________________

Courses I have taught in the recent past (with syllabi):

OR 441 - Deterministic Operations Research
Cross-Listed with MATH 441
Survey of deterministic methods for solving real-world decision problems. Covers linear programming model and simplex method of solution, duality, and sensitivity analysis; transportation and assignment problems; shortest path and maximal flow problems; and introduction to integer optimization. Emphasizes modeling and problem solving.
Prerequisites : MATH 203, or permission of instructor.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
When Offered : F, S
Syllabus: seor.vse.gmu.edu/~khoffman/OR441_syllabus.pdf  

OR 541 - Deterministic Operations Research
This is the graduate level version of OR441 and covers more material.
Survey of deterministic methods for solving real-world decision problems. Covers linear programming model and simplex method of solution, duality, and sensitivity analysis; transportation and assignment problems; shortest path and maximal flow problems; covers the network simplex method and introduction to integer and nonlinear programming. Emphasizes modeling and problem solving.
Prerequisites : MATH 203, or permission of instructor.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
When Offered : F, S
Syllabus: seor.vse.gmu.edu/~khoffman/OR541_Syllabus.pdf  

SYST521 - Network Modeling
This course is cross-listed with OR643.
Introduction to network problems in operations research, computer science, electrical engineering, and systems engineering. Solution techniques for various classes of such problems are developed. Topics include minimal-cost network flow, maximal flow, shortest path, and generalized networks; plus stochastic networks, network reliability, and combinatorially based network problems. Complexity of each problem class analyzed.
Prerequisites : OR 541, or permission of instructor.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
When Offered : F
Syllabus: seor.vse.gmu.edu/~khoffman/OR643_SYST521_Syllabus.pdf  

OR 642 - Integer Programming
Cutting plane and enumeration algorithms for solution of integer linear programs; bounding strategies and reformulation techniques; heuristic approaches to the solution of complex problems; knapsack problems, matching problems, set covering and partitioning problems; applications to problems in OR/MS, such as capital budgeting, facility location, political redistricting, engineering design, and scheduling.
Prerequisites : OR 541, or permission of instructor.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR642_Syllabus.pdf
 

OR 643 - Network Modeling
Introduction to network problems in operations research, computer science, electrical engineering, and systems engineering. Solution techniques for various classes of such problems are developed. Topics include minimal-cost network flow, maximal flow, shortest path, and generalized networks; plus stochastic networks, network reliability, and combinatorially based network problems. Complexity of each problem class analyzed.
Prerequisites : OR 541, or permission of instructor.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
When Offered : F
Syllabus: seor.vse.gmu.edu/~khoffman/OR643_SYST521_Syllabus.pdf  

OR 649 - Topics in Optimization
Special topics, applications, or recent developments in optimization. This course provides an overview of a number of topics in optimization that are not regularly taught in the SEOR curriculum. Each topic will be a 2-week-long module and the various modules may be taught by different instructors
Prerequisites : OR 541 or 542, and 600-level optimization course
Notes : May be repeated for credit when topics are distinctly different.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR649_Syllabus.pdf  

OR 699 - Project Course in Operations Research
This course is cross listed with SYST699.
Capstone course for both the master's program in operations research and certificate in computational modeling. Can also be used in lieu of the project in master's program in systems engineering. Focus is on model development and implementation involved in the practice of operational modeling. Key activity is completion of a major applied group project. Work includes project proposal planning, completion, documentation, and presentation. To be taken in last spring semester of studies.
Prerequisites : 21 graduate credits in OR or SYST.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR699_SYST699_Syllabus.pdf  

OR 751 - Advanced Topics in Operations Research for Planning, Scheduling, and Network Design
Introduces network and combinatorial optimization problems in logistics, computer science, electrical engineering, and systems engineering. Solution techniques for various classes of such problems are developed. Topics include scheduling algorithms, capital budgeting, minimal cost network flow, optimal routings, and generalized networks. Scheduling algorithms, network reliability, stochastic networks, and combinatorially based network problems are discussed.
Prerequisites : OR 642, 643, or 690.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR751_syllabus.pdf  

OR 782 - Advanced Topics in Combinatorial Optimizations
Cross-Listed with IT 782
Studies problems using most recent developments. Topics include cutting plane procedures based on polyhedral combinatorics; column-generation procedures for large, complex problems; heuristic approaches such as genetic algorithms, simulated annealing, and tabu search; study of special structures; reformulation techniques; and bounding approaches. Topics stress most recent developments in field.
Prerequisites : OR 641 and 642.
Notes : May be repeated for credit when topics are distinctly different.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR782_Syllabus.pdf  

OR 783 - Advanced Topics in Network Optimization
Cross-Listed with IT 783
Recent developments in solving optimization problems on networks. Prepares doctoral students to perform advanced research on network-related problems. Topics include linear, discrete, nonlinear, and stochastic problems. Several aspects of problems also studied, including computational complexity, exact algorithms, heuristics, solvable special cases, and computer implementation issues.
Prerequisites : OR 643.
Hours of Lecture or Seminar per week : 3
Hours of Lab or Studio per week : 0
Syllabus: seor.vse.gmu.edu/~khoffman/OR783_Syllabus.pdf  

Home  Presentations  Courses  Recent Papers  Curr. Vitae