Preview

Modeling and Operations Research

Satisfactory Essays
Open Document
Open Document
10952 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Modeling and Operations Research
TAYLMC04_0131961381.QXD

4/14/09

8:33 AM

Page 42

Chapter Four: Linear Programming: Modeling Examples
PROBLEM SUMMARY
1. “Product mix” example 2. “Diet” example 3. “Investment” example 4. “Marketing” example 5. “Transportation” example 6. “Blend” example 7. Product mix (maximization) 8. Sensitivity analysis (4–7) 9. Diet (minimization) 10. Product mix (minimization) 11. Product mix (maximization) 12. Product mix (maximization) 13. Product mix (maximization) 14. Ingredients mix (minimization) 15. Transportation (maximization) 16. Product mix (maximization) 17. Ingredients mix blend (minimization) 18. Crop distribution (maximization) 19. Monetary allocation (maximization) 20. Diet (minimization), sensitivity analysis 21. Transportation (maximization) 22. Transportation (minimization) 23. Warehouse scheduling (minimization) 24. School busing (minimization) 25. Sensitivity analysis (4–24) 26. Ingredients mixture (minimization) 27. Interview scheduling (maximization) 28. Multiperiod investments mixture (maximization) 29. Insurance policy mix (maximization) 30. Product mix (maximization) 31. Advertising mix (minimization), sensitivity analysis 32. Blend (maximization) 33. Multiperiod borrowing (minimization) 34. Multiperiod production scheduling (minimization) 35. Blend (maximization), sensitivity analysis 36. Assignment (minimization), sensitivity analysis 37. Transportation (minimization) 38. Scheduling (minimization) 39. Production line scheduling (maximization) 40. College admissions (maximization) 41. Network flow (minimization) 42. Blend (maximization) 43. Trim loss (minimization) 44. Multiperiod investment (maximization) 45. Multiperiod sales and inventory (maximization) 46. Multiperiod production and inventory (minimization) 47. Employee assignment (maximization) 48. Data envelopment analysis 49. Data envelopment analysis 50. Network flow (maximization) 51. Multiperiod workforce planning (minimization) 52. Integer solution (4–51) 53. Machine
Continue Reading
View Writing Issues

You May Also Find These Documents Helpful

  • Good Essays

    Operations Managements
    • 2532 Words
    • 11 Pages

    Operations Managements

    Consider a firm with a daily demand of 100 units, a production rate per day of 500 units, a setup cost of $200, and an annual holding cost per unit of $10. Suppose that the firm operates 300 days per year. How many units of inventory must their storage area be able to hold?…

    • 2532 Words
    • 11 Pages
    Good Essays
    Read More
  • Good Essays

    Quain Case Analysis
    • 1013 Words
    • 6 Pages

    Quain Case Analysis

    The objective of this analysis is to determine what blend of the four chemicals will allow Quain to minimize the cost of a 50-lb bag of the fertilizer. To do this we have used Linear Programming (LP) – a technique specifically designed to help managers make decisions relative to the allocation of resources. In this case, C-30 = , C-92 = , D-21 = , and E-11 = . The constraints for this case were translated into linear equations (i.e. inequalities) to mathematically express their meaning. The first constraint that C-11 must constitute for at least 15% of the blend can be expressed as: . The second constraint that C-92 and C-30 must together constitute at least 45% of the blend can be expressed as: . The third constraint that D-21 and C-92 can together constitute no more than 30% of the blend can be expressed as: . Lastly, the fourth constraint is that Quain-Grow is packaged and sold in 50-lb bags can be expressed as: . These equations were obtained and entered into a POM LP as a minimizing function. The objective function of this case was calculated and expressed as . The following table is the input…

    • 1013 Words
    • 6 Pages
    Good Essays
    Read More
  • Good Essays

    Quantitative Decision Models Exam
    • 2847 Words
    • 12 Pages

    Quantitative Decision Models Exam

    Question 1 Graphical solution (16 marks) For a linear programming model given below: Decision variables x1  Units of product 1 to produce. x2 – Units of product 2 to produce. Objective function Maximize 4.0x1 + 3.6x2 Constraints Constraint 1: 11x1 + 5x2 > 55 Constraint 2: 3x1 + 4x2 < 36 Constraint 3: 4x1 – 9x2 < 0 Nonnegativity: x1, x2 >= 0 Solve this linear programming model by using the graphical approach (Graph paper is provided on the next page). For your graphical solution,  Label the axes.  Draw and label each constraint. Show your procedure of drawing Constraint 3 only.  For each constraint line, determine and label which side is feasible. Briefly explain how to determine the feasible side for Constraint 3 only.  Shade and label the feasible region.  Identify all feasible corner points and determine the coordinates of each feasible corner point. Show only your calculations for the corner point determined by Constraints 1 and 2.  Determine the optimal solution and objective function value.  For all calculations in this question, please…

    • 2847 Words
    • 12 Pages
    Good Essays
    Read More
  • Better Essays

    Business Modeling
    • 2408 Words
    • 16 Pages

    Business Modeling

    CERTIFICATION OF AUTHORSHIP: I certify that I am the author of this paper and that any assistance I received in its preparation is fully acknowledged and disclosed in the paper. I have also cited any sources from which I used data, ideas or words, either quoted directly or paraphrased. I also certify that this paper was prepared by me specifically for this course.…

    • 2408 Words
    • 16 Pages
    Better Essays
    Read More
  • Powerful Essays

    Chapter Summary of an Introduction to Management Science: Quantitative Approaches to Decision-Making
    • 4205 Words
    • 17 Pages

    Chapter Summary of an Introduction to Management Science: Quantitative Approaches to Decision-Making

    South-Western Cincinnati, Ohio Contents Preface Chapter 1: Introduction ♦ Scheduling a Golf League Chapter 2: An Introduction to Linear Programming ♦ Workload Balancing ♦ Production Strategy ♦ Hart Venture Capital Chapter 3: Linear Programming: Sensitivity Analysis and Interpretation of Solution ♦ Product Mix ♦ Investment Strategy ♦ Truck Leasing Strategy Chapter 4: Linear Programming Applications in Marketing, Finance and Operations Management ♦ Planning an Advertising Campaign ♦ Phoenix Computer ♦ Textile Mill Scheduling ♦ Workforce Scheduling ♦ Duke Energy Coal Allocation Chapter 6: Distribution and Network Models ♦ Solution Plus ♦ Distribution Systems Design Chapter 7: Integer Linear Programming ♦ Textbook Publishing ♦ Yeager National Bank ♦ Production Scheduling with Changeover Costs Chapter 8: Nonlinear Optimization Models ♦ Portfolio Optimization with Transaction Costs Chapter 9: Project Scheduling: PERT/CPM ♦ R.C. Coleman Chapter 10: Inventory Models ♦ Wagner Fabricating Company ♦ River City Fire Department Chapter 11: Waiting Line Models ♦ Regional Airlines ♦ Office Equipment, Inc.…

    • 4205 Words
    • 17 Pages
    Powerful Essays
    Read More
  • Good Essays

    Mg375 Operations Management Student Study Guide Final Examination 1.12
    • 2409 Words
    • 10 Pages

    Mg375 Operations Management Student Study Guide Final Examination 1.12

    a. Steps of the product development process: planning, concept development, system level design, detail design, testing and refinement, production run-up.…

    • 2409 Words
    • 10 Pages
    Good Essays
    Read More
  • Good Essays

    Operations Management Final
    • 1717 Words
    • 7 Pages

    Operations Management Final

    Answer: Capacity is the maximum rate of output of a process or a system. And utilization is measured as the ratio of average output rate to maximum capacity. In Southwest, capacity can be measured in available seat-miles (AMS) pre month. Therefore, utilization can be measured as the ratio of average seat-mile rate to maximum seat-miles.…

    • 1717 Words
    • 7 Pages
    Good Essays
    Read More
  • Satisfactory Essays

    Tjs Product Mix
    • 260 Words
    • 2 Pages

    Tjs Product Mix

    This problem was solved using Excel Solver LP Programming. The decision variables are pounds of each type of Mix. The objective function was a formula of profit contribution for each Mix. The constraints are the nuts purchased the following shipment and the orders that need to be satisfied.…

    • 260 Words
    • 2 Pages
    Satisfactory Essays
    Read More
  • Satisfactory Essays

    Simulation analysis
    • 575 Words
    • 3 Pages

    Simulation analysis

    According to the data and information provided, MM currently is facing a tough time in all segments comparing to the competitors. As the data shows that, the revenue and gross margin are consistently decreasing from Q1-Q3.There is a big drop at the market. In order to improve our company profit and market share .It is important for us to find out the disadvantage and advantage. There are some factors that driving out profit and market share down, which are:…

    • 575 Words
    • 3 Pages
    Satisfactory Essays
    Read More
  • Satisfactory Essays

    business modeling
    • 406 Words
    • 2 Pages

    business modeling

    1- the file P02_01.xlsx indicates the gender and nationality of the MBA incoming class in two successive years at the Kelly school of business at Indiana university.…

    • 406 Words
    • 2 Pages
    Satisfactory Essays
    Read More
  • Powerful Essays

    Red Brand Canners
    • 2093 Words
    • 9 Pages

    Red Brand Canners

    By using resource allocation techniques with the support of Excel Solver, we were able to find an optimal solution that maximizes RBC's profit ($136,300) for this year's tomato crop, taking into consideration the known constrains. Then, using technical reasoning (rather than intuition alone), we were able to recommend the purchase of additional A grade and B grade tomatoes, with optimal allocation of raw materials to the three product lines; we also evaluated the target product and maximum permissible expenditure for an advertising campaign. Finally we analyse the profitability of running the three production lines and recommend the closure of one of the product lines in order to maximize profits.…

    • 2093 Words
    • 9 Pages
    Powerful Essays
    Read More
  • Satisfactory Essays

    Heinz Ketchup
    • 809 Words
    • 4 Pages

    Heinz Ketchup

    Problem Case: The management team of Heinz needed to maximize net profit by increasing the sales of their highest-margin items, yet they were experiencing constant pushback from retailers, on top of that, their shelf space was being reduced, as well as the promotional support for their high margin products, the team needs to come up with a plan…

    • 809 Words
    • 4 Pages
    Satisfactory Essays
    Read More
  • Powerful Essays

    System Modeling
    • 28464 Words
    • 114 Pages

    System Modeling

    2. This handbook is for guidance only. This handbook cannot be cited as a requirement.…

    • 28464 Words
    • 114 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Biopharma Case Study
    • 1265 Words
    • 6 Pages

    Biopharma Case Study

    Optimization was performed using Excel to determine what production/distribution allocation would minimize the overall cost while accounting for fixed and variable cost of production, as well as transportation and import costs. My particular optimization determined that Japan should be idled on production of both chemicals while Germany (Europe) should be idled on production of Relax. The following shows the amount of each chemical that each region should make as well as plant capacity in millions of kg.…

    • 1265 Words
    • 6 Pages
    Powerful Essays
    Read More
  • Good Essays

    Mr Sajan
    • 1033 Words
    • 5 Pages

    Mr Sajan

    Decision making is an important aspect of the Paper F5 syllabus, and questions on this topic will be common. The range of possible questions is considerable, but this article will focus on only one: linear programming. The ideas presented in this article are based on a simple example. Suppose a profit-seeking firm has two constraints: labour, limited to 16,000 hours, and materials, limited to 15,000kg. The firm manufactures and sells two products, X and Y. To make X, the firm uses 3kg of material and four hours of labour, whereas to make Y, the firm uses 5kg of material and four hours of labour. The contributions made by each product are $30 for X and $40 for Y. The cost of materials is normally $8 per kg, and the labour rate is $10 per hour. The first step in any linear programming problem is to produce the equations for constraints and the contribution function, which should not be difficult at this level. In our example, the materials constraint will be 3X + 5Y ≤ 15,000, and the labour constraint will be 4X + 4Y ≤ 16,000. You should not forget the non-negativity constraint, if needed, of X,Y ≥ 0. The contribution function is 30X + 40Y = C Plotting the resulting graph (Figure 1, the optimal production plan) will show that by pushing out the contribution function, 66 student accountant March 2008 the optimal solution will be at point B – the intersection of materials and labour constraints. The optimal point is X = 2,500 and Y = 1,500, which generates $135,000 in contribution. Check this for yourself (see Working 1). The ability to solve simultaneous equations is assumed in this article. The point of this calculation is to provide management with a target production plan in order to maximise contribution and therefore profit. However, things can change and, in particular, constraints can relax or tighten. Management needs to know the financial implications of such changes. For example, if new materials are offered, how much should be paid for them?…

    • 1033 Words
    • 5 Pages
    Good Essays
    Read More

Related Topics