Use the Tab and Up, Down arrow keys to select menu items.
Algorithmic solution methods for linear programming, transportation and integer problems; theory of duality, and sensitivity analysis. Direct follow-on to MSCI204 and mainstream course for MS/OR majors.
This course covers the standard algorithms for solving the various linear programming model structures. The emphasis is on the computational aspects and properties of the algorithms, rather than on the mathematical theory. The major topics are:1. The simplex method, including how to obtain a starting basis for the algorithm.2. The concept of duality.3. Sensitivity and post-optimal analysis.4. Degeneracy.5. The simplex method applied to transportation problems.
Students who pass MSCI216 will be able to:1.Solve linear programs by hand using the simplex method.2.Construct the dual of any linear program.In addition, students should be able to:3.Identify infeasible and unbounded linear programs.4.Interpret the optimal dual variables of a linear program.5.Use post-optimal analysis to investigate how changes to a linear program affect its optimal solution value. 6.Apply linear programming concepts to transportation problems.
(1) MSCI215(2) MATH104 or MATH105 or MATH106 or MATH107 or MATH108 or MATH109 or MATH116 or MATH127 or MATH171
MSCI201
John Giffin
Library portal
Grading:Your final mark will be calculated after the raw marks have been standardised. This is to ensure all assessment is given the weighting stated.
Domestic fee $364.00
International fee $1,486.00
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see Management, Marketing and Tourism .