Slides - Chapter Linear Programming Basic concepts
Slides - Chapter Linear Programming Basic concepts
and Application
❖ Note: add integer constraints (as needed) and seclect a solving method (simplex LP)
2.3 Formulate linear programming model
• Output cells: show quantities that are calculated from the changing cells
• Identify the decisions to be made (the production rates for the two new
products)
Graphical method
❑ To find the optimal solution (the best feasible solution), we first need to
display graphically where the feasible solutions are
❑ To do this, we must consider each constraint, identify the solutions graphically
that are permitted by that constraint, and then combine this
information to identify the solutions permitted by all the constraints
❑ The solutions permitted by all the constraints are the feasible solutions
and the portion of the two-dimensional graph where the feasible solutions
lie is referred to as the feasible region
2.5 The graphical method for solving two-variable problems
❖ Formulating
• We introduce algebraic symbols to represent the measure of performance and
the decisions. Let:
o C = Cost (total advertising cost, in million dollars)
o TV = Number of units of advertising on television
o PM = Number of units of advertising in the print media
• Algebraic Model
o Choose the values of TV and PM so as to minimize: C = 1TV + 2PM
(million dollars)
o Subject to satisfying all the following constraints:
o PM ≤ 3
o 3TV+ 2PM ≤ 18
o -TV + 4PM≤ 4 and TV ≥ 0 PM ≥ 0 ; TV and PM must be integers
2.6 A minimization example-the profit & gambit Co. Advertising-mix problem
❖ Solving by Excel’s solver
2.6 A minimization example-the profit & gambit Co. Advertising-mix problem