Preview

Linear Programming

Good Essays
Open Document
Open Document
11494 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Linear Programming
LP (2003) 1

OPERATIONS RESEARCH: 343

1. LINEAR PROGRAMMING 2. INTEGER PROGRAMMING 3. GAMES

Books: Ð3Ñ IntroÞ to OR ÐF.Hillier & J. LiebermanÑ; Ð33Ñ OR ÐH. TahaÑ; Ð333Ñ IntroÞ to Mathematical Prog ÐF.Hillier & J. LiebermanÑ; Ð3@Ñ IntroÞ to OR ÐJ.Eckert & M. KupferschmidÑÞ

LP (2003) 2

LINEAR PROGRAMMING (LP)
LP is an optimal decision making tool in which the objective is a linear function and the constraints on the decision problem are linear equalities and inequalities. It is a very popular decision support tool: in a survey of Fortune 500 firms, 85% of the responding firms said that they had used LP. Example 1: Manufacturer Produces: Ingredients used in the production of A & C: Each ton of A requires: Each ton of C requires: Supply of X is limited to: Supply of Y is limited to: 1 ton of A sells for: 1 ton of C sells for: A (acid) and C (caustic) X and Y 2lb of X; 1lb of Y 1lb of X ; 3lb of Y 11lb/week 18lb/week £1000 £1000

Manufacturer wishes to maximize weekly value of sales of A & C. Market research indicates no more than 4 tons of acid can be sold each week. How much A & C to produce to solve this problem. The answer is a pair of numbers: x" Ðweekly production of AÑ, x# Ðweekly p.of CÑ There are many pairs of numbers Ðx" , x# Ñ: Ð0,0Ñ, Ð1,1Ñ, Ð3,5Ñ.... Not all pairs Ðx" , x# Ñ are possible weekly productions Ðex. x" œ 27, x# œ 2 are not possibleÑ Ð Ð27, 2Ñ is not a feasible set of production figuresÑ. The constraints on x" , x# are such that Ðx" , x# Ñ represent a possible set of production figures: The amount each product is produced is non-negative: The amount of ingredient X required to produce x" tons of A & x# tons of C is 2x"  x# . As X is limited to 11lb/week: The amount of ingredient Y required combined with the supply restriction: We cannot sell more than 4 tons of A/week:

x" 0 x # 0

2x"  x# Ÿ 11 x"  3x# Ÿ 18 x" Ÿ 4 Conversely any Ðx" , x# Ñ satisfying these

A possible set of production figures satisfies these
Continue Reading
View Writing Issues

You May Also Find These Documents Helpful

  • Good Essays

    ECO 550 FINAL EXAM
    • 1177 Words
    • 4 Pages

    ECO 550 FINAL EXAM

    4. The production manager for Beer etc. produces 2 kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. He can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle. If the production manager decides to produce of 0 bottles of light beer and 400 bottles of dark beer, it will result in slack of…

    • 1177 Words
    • 4 Pages
    Good Essays
    Read More
  • Good Essays

    Linear Programming
    • 737 Words
    • 3 Pages

    Linear Programming

    The EI Paso plant was expanded when the company began marketing its meters in Arizona, California, Nevada, and Utah. With the growth of the West Coast business, the Darby…

    • 737 Words
    • 3 Pages
    Good Essays
    Read More
  • Good Essays

    Solver: Constraint Satisfaction and Dialogue Box
    • 766 Words
    • 4 Pages

    Solver: Constraint Satisfaction and Dialogue Box

    We will use Microsoft Excel Solver to solve the four LP examples discussed in last class.…

    • 766 Words
    • 4 Pages
    Good Essays
    Read More
  • Satisfactory Essays

    Executive Summary of Shelby Shelving

    • 885 Words
    • 3 Pages

    Executive Summary of Shelby Shelving

    Shelby Shelving is a manufacturing firm who produces shelves for grocery stores. They have two types of shelves named Model S and Model LX. These two models have three main steps in production which are: Forming, Stamping and Assembly. Forming and Stamping departments can produce both models on same line whereas Assembly lines are different for each model. Firm’s problem is to determine how much to produce monthly Model S and Model LX in order to maximize the profit. The decision depends on the optimal quantity that must be produced for each model. The key issue is the marketing department of the company and the controller of the firm have conflicts about Model S. The marketing department think that they should cut back Model S production because its’ cost is higher than the selling price which make them having losses but Controller disagreed and he argues that they will be worse-off with lower production because Model S has a contribution to make overhead. The solution is the optimal quantity to produce each model at which the total profit will be the maximum.…

    • 885 Words
    • 3 Pages
    Satisfactory Essays
    Read More
  • Good Essays

    Langauge Model for Mathematics
    • 593 Words
    • 3 Pages

    Langauge Model for Mathematics

    Gowers, T., Barrow-Green, J., Leader, I., & Princeton University. (2008). The Princeton companion to mathematics. Princeton, NJ, USA: Princeton University Press.…

    • 593 Words
    • 3 Pages
    Good Essays
    Read More
  • Powerful Essays

    Personal Finance Problem - Linear Programming
    • 980 Words
    • 4 Pages

    Personal Finance Problem - Linear Programming

    Bob and Pina Ing, 31 and 28, a newly-wed couple found themselves in the midst of an interesting decision making problem. It appeared that their fortune had turned overnight when they won a mega lottery and received one million dollars after tax in price money. They were confused about how to invest their money, such that it gives them the maximum return on their investment. The couple consulted Jayhawks Financial Services LLC (JFS) to prepare a personal investment portfolio for them.…

    • 980 Words
    • 4 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Optimization and Linear Programming
    • 1510 Words
    • 7 Pages

    Optimization and Linear Programming

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

    Linear Programming and Capacity
    • 898 Words
    • 4 Pages

    Linear Programming and Capacity

    We've analyzed our potential suppliers for each gauge, taking into account their capacity, cost of production for each plant, and transportation costs (The model and our objective function can be found in the appendix.) Our goal was to allocate spinning production (at Filatoi Riuniti and six local mills) in a manner that would minimize overall costs, while meeting the demand and operating within the capacity constraint of each plant. Given the output of our optimization model, we should be outsourcing the spinning of our yarn in this way:…

    • 898 Words
    • 4 Pages
    Good Essays
    Read More
  • Good Essays

    Pgcbm/531 Week 4 Linear Programming Approach
    • 1401 Words
    • 6 Pages

    Pgcbm/531 Week 4 Linear Programming Approach

    Mr. Ramesh Chandra is a Software Development Project Manager in one of the renowned Indian Software Services Company, namely “ABC Technologies”. The company’s business division has recently won a project from a major…

    • 1401 Words
    • 6 Pages
    Good Essays
    Read More
  • Satisfactory Essays

    Shelby Shelving Decision Model Essay
    • 473 Words
    • 2 Pages

    Shelby Shelving Decision Model Essay

    Shelby Shelving LP Decision Variables: Let S = # of Model S shelves to produce, and LX = # of Model LX shelves to produce. Shelby Shelving Linear Program 260 S 245 LX 385;000 (Net Profit) (S assembly) (LX assembly) (Stamping) (Nonnegativity) 0:3 S (Forming) 0:25 S S LX 0:3 LX 0:5 LX S; LX 1900 1400 800 800 0…

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

    Case analysis Red brand canners
    • 697 Words
    • 1 Page

    Case analysis Red brand canners

    The problem: Mr Mitchell Gordon, vice president of operations of Red Brand Canners, wants to determine the amount of tomato products to pack that season based on the demand for the coming year. A total of 3 million pounds of tomato crop was purchased, however, according to Dan Tucker, the production manager, about 20% of the tomato crop was grade A quality and the remaining portion was grade B. In addition, although the company has ample production capacity, the production manager alerted that it was impossible to produce all whole tomatoes because only a small portion of the crop was grade A quality. The demand per cases, the contribution per product (Canned whole tomatoes, Tomato juice and Tomato paste) and quality results were given to us for the analysis and are detailed on Appendix A. You want to determine the optimal canning policy for the season’s crop.…

    • 697 Words
    • 1 Page
    Satisfactory Essays
    Read More
  • Satisfactory Essays

    Quiz on Linear Programming Models: Graphical and Computer Methods
    • 2781 Words
    • 17 Pages

    Quiz on Linear Programming Models: Graphical and Computer Methods

    3) A redundant constraint is eliminated from a linear programming model. What effect will this have on the optimal solution?…

    • 2781 Words
    • 17 Pages
    Satisfactory Essays
    Read More
  • Good Essays

    Linear Programming Applications
    • 743 Words
    • 3 Pages

    Linear Programming Applications

    The longer contract periods are more expensive because Workforce Unlimited experiences greater difficulty finding temporary workers who are willing to commit to longer work assignments.…

    • 743 Words
    • 3 Pages
    Good Essays
    Read More
  • Satisfactory Essays

    quant assignment
    • 1146 Words
    • 5 Pages

    quant assignment

    QAUNTITATIVE TECHNIQUES SOLUTION FOR THE CASE CUTTING CAFETERIA COSTS LPP MODEL FOR CAFETERIA COST CUTTING Objective: To reduce the purchase of potato and green beans, so as to meet the conditions of the various constraints to achieve the goal of minimizing the purchase cost. Constraint conditions: Potatoes Green Beans Protein 1.5 g per 100 g → 1.5% 2 g per 100 g → 2% Iron 0.3 mg per 100 g → 0.3% 1.2 mg per 100 g → 1.2% Vitamin C 12 mg per 100 g → 12% 10 mg per 100 g → 10%…

    • 1146 Words
    • 5 Pages
    Satisfactory Essays
    Read More
  • Powerful Essays

    Mathematical Programming
    • 18473 Words
    • 55 Pages

    Mathematical Programming

    Management science is characterized by a scientific approach to managerial decision making. It attempts to apply mathematical methods and the capabilities of modern computers to the difficult and unstructured problems confronting modern managers. It is a young and novel discipline. Although its roots can be traced back to problems posed by early civilizations, it was not until World War II that it became identified as a respectable and well defined body of knowledge. Since then, it has grown at an impressive pace, unprecedented for most scientific accomplishments; it is changing our attitudes toward decision-making, and infiltrating every conceivable area of application, covering a wide variety of business, industrial, military, and public-sector problems. Management science has been known by a variety of other names. In the United States, operations research has served as a synonym and it is used widely today, while in Britain operational research seems to be the more accepted name. Some people tend to identify the scientific approach to managerial problemsolving under such other names as systems analysis, cost–benefit analysis, and cost-effectiveness analysis. We will adhere to management science throughout this book. Mathematical programming, and especially linear programming, is one of the best developed and most used branches of management science. It concerns the optimum allocation of limited resources among competing activities, under a set of constraints imposed by the nature of the problem being studied. These constraints could reflect financial, technological, marketing, organizational, or many other considerations. In broad terms, mathematical programming can be defined as a mathematical representation aimed at programming or planning the best possible allocation of scarce resources. When the mathematical representation uses linear functions exclusively, we have a linear-programming model. In 1947, George B. Dantzig, then…

    • 18473 Words
    • 55 Pages
    Powerful Essays
    Read More

Related Topics