The document discusses operations research and linear programming problems. It describes how to formulate linear programming problems by defining objectives and constraints. Examples are provided to demonstrate how to write the objective function and constraints mathematically. Solution methods for linear programs include graphical and algebraic approaches. Optimization techniques aim to maximize profit, score or sales or minimize cost or resource use.
The document discusses operations research and linear programming problems. It describes how to formulate linear programming problems by defining objectives and constraints. Examples are provided to demonstrate how to write the objective function and constraints mathematically. Solution methods for linear programs include graphical and algebraic approaches. Optimization techniques aim to maximize profit, score or sales or minimize cost or resource use.
The document discusses operations research and linear programming problems. It describes how to formulate linear programming problems by defining objectives and constraints. Examples are provided to demonstrate how to write the objective function and constraints mathematically. Solution methods for linear programs include graphical and algebraic approaches. Optimization techniques aim to maximize profit, score or sales or minimize cost or resource use.
9/15/2020 Operation Research by Engr. Zaeem Anjum Target Based Situation
Maximum Maximum Minimize
Objective Score Sales Cost 9/15/2020 Operation Research by Engr. Zaeem Anjum Optimization Problems Maximum Profit Minimum Cost Minimum use of Resources
Optimization Techniques
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum List of different types of Linear Problems
9/15/2020 Operation Research by Engr. Zaeem Anjum
Two important Aspects 1. Formulation Part 2. Solution Part 9/15/2020 Operation Research by Engr. Zaeem Anjum Steps in Formulating LP Problems Define the objective. (min or max) Define the decision variables. (positive, binary) Write the mathematical function for the objective. Write a 1- or 2-word description of each constraint. Write the right-hand side (RHS) of each constraint. Write <, =, or > for each constraint. Write the decision variables on LHS of each constraint. Write the coefficient for each decision variable in each constraint.
9/15/2020 Operation Research by Engr. Zaeem Anjum
Example
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum Objective function with Constraints
9/15/2020 Operation Research by Engr. Zaeem Anjum
Linear Programming Problem
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum Example 2
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum Solution Part
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum Graphical Model
9/15/2020 Operation Research by Engr. Zaeem Anjum
9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum 9/15/2020 Operation Research by Engr. Zaeem Anjum