Programação Aula 1 (C. Lima)
Programação Aula 1 (C. Lima)
Model-Building Tools
Model-Building Tools
2023/24
Contents
A Quick Introduction
• Managerial issues: the key to profitable operations is making the best use of available resources
of people, material, plant & equipment, and money.
• Technique: a mathematical modeling tool is available for this purpose with linear programming (LP).
• Course objective: to show how the use of the Excel Solver to solve LP problems opens a whole
world to managers and provides an invaluable addition to his/her technical skill set.
• Course organization: a quick introduction to LP is started. Then, LP problems are later
introduced.
• Decision-making process: managers often must make decisions on how best to allocate scarce
resources among competing activities.
• Highlight: scarce resources (e.g., machinery, time, etc.) are used to manufacture various products or
provide diverse services.
• The management’s problem: to find the best way to produce products, given the scarcity of resources.
• Linear programming (LP): a mathematical technique designed to aid in the planning and
allocation of key organizational resources.
• Linear: all equations and inequalities associated with the problem have linear relationships.
• Programming: the iterative process that is used to derive an optimum solution.
• The best-known linear programming methods: the Simplex method and the graphical method.
• The graphical method: used only for problems with two or three variables. Therefore, it is of limited use.
• The simplex method: it can solve very large LP problems involving thousands of variables. It consists of a
set of step-by-step rules, which are ideally suited for computerization.
Maximize Z = C1 X1 + C2 X2 + . . . + Cn Xn
Subject to resource constraints in the form:
A11 X1 + A12 X2 + ... + A1n Xn ≤ B1
A21 X1 + A22 X2 + ... + A2n Xn ≤ B2
.
.
.
Am1 X1 + Am2 X2 + ... + Amn Xn ≤ Bm
• Where Cn, Amn and Bm are given constants. Depending on the problem, the constraints also may
be stated with equal signs (=) or greater-than-or-equal-to (≥) signs (in a minimize direction).
• Integer numbers: often, solutions to LP problems make sense only if they have integer values.
• Example: quantities such as 23!⁄" employees or 12!⁄" tables are unrealistic. Simply rounding off the LP
solution to the nearest whole number may not produce a feasible solution.
• Integer programming (IP): the term used to describe an LP problem that requires the solution to have
integer values.
• Multiple objectives: a limitation of LP is that it allows only one objective function to be optimized.
Thus, the decision-maker must focus on a single objective or goal at a time.
• Example: how to maximize both production and profits or to maximize profits while minimizing risk.
• Goal programming (GP): a variation of LP that provides for multiple objective optimization.
Excel’s Solver
References
Suggested Books
• Barlow, J.F., 2005. Excel Models for Business and Operations Management, Second Edition. John
Wiley & Sons Ltd.
• Jacobs, F.R., Chase, R.B., 2018. Operations and Supply Chain Management, Fifteenth Edition.
McGraw-Hill Education.
• Powell, S.G., Baker, K.R., 2014. Management Science: The Art of Modeling with Spreadsheets
Fourth edition. John Wiley & Sons.
• Ragsdale, C., 2008. Spreadsheet Modeling & Decision Analysis: A Practical Introduction to
Management Science, Fifth Edition. Thomson South-Western.