OMIS 2010 Lecture Notes - Lecture 1: Feasible Region, Matrix Ring, Minimax

• School: York University
• Department: Operations Management and Information System
• Course: OMIS 2010
• Professor: Linda Lakats

Document Summary

Helps determine how to effectively convert inputs into outputs: how to economize the resources that we are provided. Linear programming: has many restrictions, applies to many problems and questions, what-ifs insights. Integer programming: harder to solve problems with them. Non-linear programming: complex, not as rich as linear programming. Requirements to a lp: all parts of the problem are linear; straight, cannot square, square root, divide by each other, etc, constraints always going to have an equal-to in the equations. Problem formulation: translating a verbal statement into a mathematical statement, the difficult part is how to set it up; the art part; how to turn ^ into mathematics. How to set up a linear program: begin with graphing, corner point method, determine the extremes of each intercept, and find the max/min, excel solver. Simplex: the background of the computer solving, matrix algebra.