Академический Документы
Профессиональный Документы
Культура Документы
◼ Linear function
◼ When the function is linear (without any power
function, logarithmic function, inverse function or
trigonometric function)
◼ ax + by + cz + dw = e (a, b, c, d, e = real valued; x, y,
z, w = variables)
◼ Linear programming
◼ All of the Objective function and Constraints are linear
combination of variables
◼ Non-linear programming
◼ At least one of the objective function or constraints will
be non-linear
Dipankar Bose - XLRI
Excel Solver – Main Solution
Procedures
◼ Simplex LP
◼ Linear problem
◼ Variable can be real, binary or integer
◼ For binary or integer variable
◼ Branch-and-bound technique is used
◼ GRG (Generalized Reduced Gradient) Nonlinear
◼ Used for non-linear problem
◼ Concept based on derivative
◼ Generates local optimal solution
◼ Evolutionary
◼ Used for non-linear problem
◼ Compares across the ranges of variables
Dipankar Bose - XLRI
Example of a Linear Maximization
Problem
◼ A carpenter can produce Chairs and Tables
◼ Profits are as follows:
◼ Chair = 1 per unit; Table = 5 per unit
◼ The carpenter can decide the number of chairs and tables
he will produce
◼ These are known as variables
◼ In other words, variables are controllable in real life
◼ Assume he will prepare x chairs and y tables
◼ Then his total profit = x + 5y
◼ This is linear function of x and y
◼ Carpenter’s objective is to maximize the profit
◼ In absence of constraints → The profit can take any
value Dipankar Bose - XLRI
Constraints → Makes us to act within
certain boundary
Must be function of
Variable cells
◼ Use the data given in Excel file and use the data to get
values in
◼ Exhibit 1
◼ Exhibit 2
◼ Exhibit 3