Preview

Graphical and Simplex Methods of Linear Programming

Good Essays
Open Document
Open Document
552 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Graphical and Simplex Methods of Linear Programming
Graphical and Simplex Methods of Linear Programming
The graphical method is the more popular method to use because they are easy to use and understand. Working with only a few variables at a time they allow operations managers to compare projected demand to existing capacity. The graphical method is a trial and error approach that can be easily done by a manager or even a clerical staff. Since it is trial and error though, it does not necessarily generate the optimal plan. One downside of this method though is that it can only be used with two variables at the maximum. The graphical method is broken down into the following five steps: 1) Determine the demand in each period. 2) Determine the capacity for regular time, over time, and subcontracting each period. 3) Find labor costs, hiring and labor costs, and inventory holding costs. 4) Consider company policy that may apply to the workers or to stock levels 5) Develop alternative plans and examine their total costs.
When a company has a LP problem with more than two variables it turns to the simplex method. This method can handle any number of variables as well as for certain give the optimal solution. In the simplex method we examine corner points in a methodical fashion until we arrive at the best solution which is either the highest profit or lowest cost.
LP is used in a wide variety of companies in numerous applications. Airline companies use it to schedule their flights to maximize profit. Another use is for firms to figure out how much of a certain product to manufacture in order to maximize total profits. It also is used by hospitals in order to figure out the most economic diet for patients. It is also a useful tool to figure out labor scheduling for a specific time period. Other applications include product mix planning, distribution networks, truck routing, financial portfolios, and corporate restructuring.
All LP problems have four properties in common. The first, LP problems

You May Also Find These Documents Helpful

  • 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
  • Good Essays

    Co370 Midterm

    • 3760 Words
    • 16 Pages

    Here xC , xS , and xM denote respectively the number of wire cloths, insect screens, and meshes manufactured, and s1 , s2 , and s3 are the slack variables for the aluminum, wiring, and weaving constraints respectively. Running the simplex method on this LP yields the following final tableau. z xC + 9xS − 3xS + s1 + 6xS − xS + xM + 11s2 + 0.5s3 − 2s2 + 4s2 − s3 − s2 + 0.5s3 = = = = 294 2 36 6…

    • 3760 Words
    • 16 Pages
    Good Essays
  • 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
  • Good Essays

    Cheat sheet OMIS 355

    • 727 Words
    • 3 Pages

    The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. 
X1 = number of product 1 produced in each batch X2 = number of product 2 produced in each batch 
MAX: 150 X1 + 250 X2
Subject to: 2 X1 + 5 X2 ≤ 200 − resource 1 
3 X1 + 7 X2 ≤ 175 − resource 2 X1, X2 ≥ 0. How many units of resource 1 are consumed by each unit of product 1 produced? 2…

    • 727 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    A. Julia Robertson is making an allowance for renting a food booth at her school. She is seeking ways to finance her last year and believed that a food booth outside her school’s stadium would be ideal. Her goal is to earn the most money possible thus increasing her earnings. In this case problem, she decided to sell pizza, hotdogs and BBQ sandwiches. The following LP model illustrates the maximum net profit and constraints that will determine whether or not to least the boot.…

    • 690 Words
    • 3 Pages
    Satisfactory 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
  • Powerful Essays

    CaseAssignment 0222

    • 1687 Words
    • 8 Pages

    level of capacity and the type of capacity—for example, the degree of flexibility in the…

    • 1687 Words
    • 8 Pages
    Powerful Essays
  • Powerful Essays

    In linear programming, the unit profit or unit contribution associated with one decision variable can be affected by the quantity made of that variable or of any other variable in the problem.…

    • 1510 Words
    • 7 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 Model in Operation Research study is usually mathematical type of model which contains set of equations that represent objective function and constraints. The keywords in this article are Objective Function and Constraints, according to Heizer & Render (2008) Objective Function are mathematical expression expressed in linear programming designed to maximizes or minimizes some quantity, for example profit can maximized while the cost might be reduced. The objective function is also called effectiveness function, it is the mathematical expression of the objectives which may be cost of operation or profit on operation (Kumar and Hira, 2008). Constraints which is also known as restrictions are mathematical expressions of the limitations that are involved in fulfilling the objectives; they are caused by scarce or limited resources which may include money, space, manpower, materials and so on. Heizer & Render (2008) defined constraints as restrictions which limit the extent to which a manager can pursue an objective…

    • 435 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
  • Good Essays

    Sensitivity Analysis

    • 1326 Words
    • 6 Pages

    The solution obtained by simplex or graphical method of LP is based on deterministic assumptions i.e. we assume complete certainty in the data and the relationships of a problem – namely prices are fixed, resources known, time needed to produce a unit exactly etc. However in the real world, conditions are seldom static i.e. they are dynamic. How can such discrepancy be handled? For example if a firm realizes that profit per unit is not Rs 5 as estimated but instead closer to Rs 5.5, how will the final solution mix and total profit change? If additional resources, such as 10 labor hours or 3 hours of machine time, should become available, will this change the problem's answer? Such analyses are used to examine the effects of changes in these three areas:…

    • 1326 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Henry Clements Car rental

    • 453 Words
    • 4 Pages

    From this data, as well as the data given on manufacturing methods and hours per method, a solution could be found utilizing the linear programming method of analysis. To analyze the data, the actual profit on each material was first calculated. This was done by taking the selling price and subtracting each cost associated with the given material. The results are $34.00 for the 75C, $30.00 for the 33C, $60.00 for the 5X, and $25.00 for the 7X. The next step was to determine how many constraints would be part of the analysis. There was determined to be 10 constraints in the analysis, 4 for the April orders, 4 for the manufacturing methods and 2 for the minimum orders promised by Vivian. With this data, the amount of each product to be produced to maximize profit for April could be determined. The results can be seen in Table 3.…

    • 453 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Quantitative Analysis

    • 838 Words
    • 4 Pages

    Golden Electronics manufactures several products, including 45-inch GE45 and 60-inch GE60 television. It makes a profit of $50 on each GE45 and $75 on each GE60 television produced. During each shift, Golden allocates up to 300 man-hours in its production area and 240 man-hours in its assembly area to manufacture the televisions. Each GE45 requires two man-hours in the production area and one man hour in the assembly area, whereas each GE60 requires two man-hours in the production area and three man-hours in the assembly area. Formulate the linear program for television production for Golden Electronics.…

    • 838 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Assignment In A Group Of 2

    • 2279 Words
    • 6 Pages

    Formulate the problem as LPM, solve the problem using Excel solver and provide a management report.…

    • 2279 Words
    • 6 Pages
    Satisfactory Essays

Related Topics