BOZ 312

Elements of mathematical program

 Decision Variables: What can I control.

 Objective function: What I am trying to achieve.

We will only be dealing with Single Objectives

 Constraints: What limits my choices, any solution that does not satisfy my decisions will be
infeasible.

 Variables will change overtime; however, the parameters will stay the same.

Formulate a mathematical problem

 When making models, use diagrams.

Basic example: Formulate a LP that will maximise profit.

 Decision Variables: Amount of Hi-ph and Lo-ph to produce and sell.

 Objective function: To make the most profit (Maximising model)
 Constraints: Raw material availability
If we want to know how much raw materials we are using, we have to look at.
How much we use to make the Hi-ph and Lo-ph
 Parameters: The tons of raw materials made
The price of the raw materials per ton

Solving a mathematical program

 Feasible decisions are the max/extreme points of the solution.

 Test each of the extreme points and check which one of them yields the highest profit
 When calculating the gradient : use the objective eq.
Choose a random value (0,0) and get the values of x, which will
give the gradient

 Solution space is convex which makes a LP

 Exceptions: if your isoprofic line and the gradient line are in the same region
If you have an infeasible solution