Preview

Decision Modeling/Linear Programming

Better Essays
Open Document
Open Document
924 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Decision Modeling/Linear Programming
1. Discuss why and how you would use a liner programming model for a project of your choice, either from your own work or as a hypothetical situation. Be sure that you stae your situation first, before you develpp the LP model

Linear programming is a modeling technique that is used to help managers make logical and informed decisions. All date and input factors are known with certainty. Linear program models are developed in three different steps:
• Formulation
• Solution
• Interpretation

The formulation step deals with displaying the problem in a mathematical form. Once that is developed the solution stage solves the problem and finds the variable values. During the interpretation stage the sensitivity analysis gives managers the opportunity to answer hypothetical questions regarding the solutions that are generated. There are four basic assumptions of linear programming and they are as follows:
• Certainty
• Proportionality
• Additivity
• Divisibility

Linear programming is the development of modeling and solution procedures which employ mathematical techniques to optimize the goals and objectives of the decision-maker. Programming problems determine the optimal allocation of scarce resources to meet certain objectives. Linear Programming Problems are mathematical programming problems where all of the relationships amongst the variables are linear.

Components of a LP Formulation are as follows:
• Decision Variables
• Objective Function
• Constraints
• Non-negativity Conditions

Decision variables represent unknown quantities. The solutions for these terms are what we would like to optimize. Objective function states the goal of the decision-maker. There are two types of objectives:
• Maximization
• Minimization

Constraints put limitations on the possible solutions of the problem. The availability of scarce resources may be expressed as equations or inequalities which rule out certain combinations of variable values

You May Also Find These Documents Helpful

  • Satisfactory Essays

    OPRE/411 Week 4

    • 379 Words
    • 2 Pages

    1. Use Solver in EXCEL to solve each of the following linear programming problems. To do so,…

    • 379 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Imp 2 Cookies Cover Letter

    • 1219 Words
    • 5 Pages

    In these problems, we had to identify variables, constraints, and make equations that expressed them. In most cases, the variables represent a value for a certain item, for example in the unit problem, the variable, p, could represent the number of dozens of…

    • 1219 Words
    • 5 Pages
    Better Essays
  • Powerful Essays

    Freaudian Analysis

    • 3380 Words
    • 14 Pages

    1. Consider the following linear programming problem: Maximize Z = 400 x + 100y Subject to 8 x + 10y ≤ 80 2 x + 6y ≤ 36 x≤ 6 x, y ≥ 0…

    • 3380 Words
    • 14 Pages
    Powerful Essays
  • Better Essays

    Acme

    • 1450 Words
    • 8 Pages

    Linear programming is the “several related mathematical techniques used to allocate limited resources among competing demands in an optimal way” (Jacobs & Chase, 2013, appendix…

    • 1450 Words
    • 8 Pages
    Better Essays
  • Good Essays

    Cheat sheet OMIS 355

    • 727 Words
    • 3 Pages

    What is the goal in optimization? Find the decision variable values that result in the best objective function and 
satisfy all constraints.…

    • 727 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Week 8 Assignment 1

    • 783 Words
    • 8 Pages

    We are asked to formulate and solve the linear program in excel, write the sensitivity ranges for…

    • 783 Words
    • 8 Pages
    Good Essays
  • Satisfactory Essays

    Mat 540 Quiz 4

    • 1474 Words
    • 6 Pages

    In a transportation problem, a demand constraint (the amount of product demanded at a given destination) is a less-than-or equal-to constraint (≤).…

    • 1474 Words
    • 6 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Quiz 4

    • 1484 Words
    • 11 Pages

    In a transportation problem, a demand constraint (the amount of product demanded at a given destination) is a less-than-or equal-to constraint (≤).…

    • 1484 Words
    • 11 Pages
    Satisfactory Essays
  • Good Essays

    Mat 540 Week 9 Discussion

    • 374 Words
    • 2 Pages

    Integer programming is concerned with optimization problems in which some of the variables are required to take on discrete values. Rather than allow a variable to assume all real values in a given range, only predetermined discrete values within the range are permitted. In most cases, these values are the integers, giving rise to the name of this class of models. Models with integer variables are very useful. Situations that cannot be modeled by linear programming are easily handled by integer programming. Primary among these involve binary decisions such as yes-no, build-no build or invest-not invest. Although one can model a binary decision in linear programming with a variable that ranges between 0 and 1, there is nothing that keeps the solution from obtaining a fractional value such as 0.5, hardly acceptable to a decision maker. Integer programming requires such a variable to be either 0 or 1, but not in-between. Unfortunately integer programming models of practical size are often very difficult or impossible to solve. Linear programming methods can solve problems orders of magnitude larger than integer programming methods. A typical mathematical program consists of a single objective function, representing either a profit to be maximized or a cost to be minimized, and a set of constraints that circumscribe the decision variables. In the case of a linear program (LP) the objective function and constraints are all linear functions of the decision variables. At first glance these restrictions would seem to limit the scope of the LP model, but this is hardly the case. Because of its simplicity, software has been developed that is capable of solving problems containing millions of variables and tens of thousands of constraints.…

    • 374 Words
    • 2 Pages
    Good Essays
  • Good Essays

    7. When using linear programming model to solve the “diet” problem, the objective is generally to maximize profit.…

    • 894 Words
    • 6 Pages
    Good Essays
  • Good Essays

    7- An unbounded solution to a linear programing problem is usually due to omitting a constraint.…

    • 715 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Acme Mexico City Employee

    • 1454 Words
    • 6 Pages

    To develop this customer service employee scheduling proposal, the Acme Home Improvements operations analysts and AMC advance planners used linear programming. The linear programming technique made allocating hours to full-time and part-time employees fair and accurate within limitations. And linear programming is also a great tool to use during non-typical days that requires store staffing to reflect changes in the environment.…

    • 1454 Words
    • 6 Pages
    Powerful Essays
  • Satisfactory Essays

    Julia Booth

    • 404 Words
    • 2 Pages

    In this case study, I must create a linear programming model for Julia that will help her to decide whether or not she need to lease a booth. The three products or variable we must consider for this booth are pizza, hotdogs, and barbecue sandwiches. In this model, x 1 equal the number of pizza slices Julia should purchase, x2 equals the number of hotdogs Julia should purchase, and x3 equal the number of barbecue sandwiches Julia should purchase. The objective is to maximize total profit and the way to do that is to calculate each variable by subtracting cost from the selling price. For instance, if the pizza cost six dollar for eight slices then that mean she is only paying seventy-five cent for pizza and to make her money back she need to sell them for $1.50.…

    • 404 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Linear programming, the ability to find the smallest or biggest possible value under some constraints, is used in a typical optimization problem. In business this method helps to optimize solutions for politics, transportation scheduling, hospital stuffing, purchasing and many other problems. In biotechnology the same equation is used to optimize cell-factories, enabling the production of drugs, plastics, or any desired products.…

    • 501 Words
    • 3 Pages
    Satisfactory Essays