OMIS 2010 Lecture Notes - Lecture 2: Feasible Region, Linear Programming, Audit

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

Document Summary

To complete / lay out the graph: formulate the model, all within excel. Invoke the solver tool: solves the linear program, sensitivity analysis. Inputs and data: changing cells, target/objective cell, constraints, non-negativity. If not, which parts don"t: auditability, modifiability. Problem comprehension: understand the problem, describe the objective, describe each constraint. Increase the feasible region: change the optimal solution, if binding. Range of optimality: a interval range in which the optimal solution stays the optimal solution. If ofc slope changes beyond slope of constraints, there will be a new optimal solution. If the resource availability changes, the constraint line shifts over: could be binding or active, could be non-binding or inactive, common terms, shadow price, amount of objective function value that changes automatically. Range of feasibility: the range between which you can add/drop the allowable increase/decrease of a constraint. Tightening a constraint: making the constraint more restrictive, may make the solution worse.