MSCI 2200 Chapter Notes - Chapter 2: Feasible Region, Nonlinear Programming, Goal Programming
24 Jan 2017
School
Department
Course
Professor
Document Summary
Seeks to optimize an objective function subject to constraints. Types of mathematical programming problems: linear programming, integer programming, goal programming, non-linear programming. If both the objective function and the constraints are linear, the problem is referred to as a linear programming problem. Linear functions are functions in which each variable appears in a separate term raised to the first power and is multiplied by a constant (which could be. Linear constraints are linear functions that are restricted to be (cid:950), =, or (cid:951) a constant. Proportionality assumption contribution of a variable is proportional to its value. Additivity assumption contributions of variables are independent. Divisibility assumption decision variables can take fractional values. Certainty assumption each parameter is known with certainty. Objective function and constraints are linear functions. Constraint types are (cid:950), =, or (cid:951) Step 1: decision variables: t = # of tables, c = # of chairs. Step 2: objective function: maximize profit = 16t + 10c.
