# Linear Programming Essay

2819 Words Aug 8th, 2011 12 Pages
Linear Programming (LP)

Linear programming, simply put, is the most widely used mathematical programming technique. It has a long history dating back to the 1930s. The Russian mathematical economist Leonid Kantorovich published an important article about linear programming in 1939. George Stigler published his famous diet problem in 1945 (“The Cost of Subsistence”). Of course, no one could actually solve these problems until George Dantzig developed the simplex method, which was published in 1951. Within a few years, a variety of American businesses recognized that they could save millions of dollars a year using linear programming models. And in the 1950s, that was a lot of money. In his book Methods of Mathematical Economics
Now we have a linear objective function and all linear inequality/equality constraints, hence the method’s name, linear programming. The optimization problem can be written out in full as

[pic].

Observe that we have expressed all constraint inequalities in a single direction ([pic]). This is not necessary, but they make intuitive sense for a problem whose objective is to be maximized. In this case, the right-hand side values can be thought of as resources that are depleted in the course of maximizing the objective. In most well-posed problems, these resource constraints ensure that the maximum is bounded. For problems with two variables, we can even draw a picture of the feasible set (F) and come up with a solution.

A little visualization regarding the optimization (minimization or maximization) of a linear function over the set F should convince you that at least one optimal solution occurs at a vertex. A vertex is sometimes called a corner solution or an extreme point. This observation is the key to the simplex algorithm proposed by Dantzig in 1951 and subsequently coded into most commercial software packages such as Excel's Solver. In the picture above, you can solve for the intersection of the lines and determine the vertices. The vertices have coordinates of (30,10), (30,70), and (75,25). It is a simple matter to determine that (75,25) is the optimal solution. For most real world problems, you will need a computer. Fortunately,

## Related Documents

• ###### Essay Linear Components Of Linear Programming

Linear programming which is also known as “Linear Optimization” is a way to achieve best outcomes in a Mathematical Model using different linear solutions .Linear Programming is a special case of Mathematical Optimization .Linear programming can be applied to a wide variety of fields of study, and has proved useful in planning, routing, scheduling, assignment, and design, such as in transportation or manufacturing industries. The method of Linear Programming was originally developed by American mathematicians…

Words: 4417 - Pages: 18
• ###### Essay Linear Programming Assignment

PART A – Linear Programming 1 a) Linear Programing Model Decision Variables: Let x = acres of watermelon Let y = acres of cantaloupe Objective Function: Maximize Z = 390x + 1300y – 5(20x + 15y) + 5(2x + 2.5y) = 270x + 300y – 100x + 75y + 10x + 12.5y = 256x + 284.5y where Z = total profit 390x = profit from watermelons 1300y = profit from cantaloupe 5(20x + 15y) = cost of fertilizer…

Words: 1614 - Pages: 7
• ###### Linear Programming Essay

Math 428 Operation Research Linear Programming Project This project is mainly to report on our analysis of the mathematical model established by the three-month production plan from the bicycle manufacturer. It includes what suggestions we’ve had for the client, details on how the model was set up and also how future change influences the results. Firstly, we’ll explain how and why the model was set up in this way: Our goal is to help the company minimize their cost on the production and…

Words: 1056 - Pages: 5
• ###### Essay The Simplex Method Of Linear Programming Problem

4 The Simplex Method As we have seen, a linear programming problem forms a convex polygon in the best possible scenario. It is imperative to obtain a process that would assist in determining the optimal solution without the need to examine the graphical representation. The need for an algorithm that would perform such process was essential in the early days of the formulations of linear programming problems. Although challenging, the task was accomplished by a mathematician of the twentieth century…

Words: 1035 - Pages:
• ###### Bsop 209 Week 5 Homework Problem Essay

us/question_des/BSOP209WEEK5HOMEWORKPROBLEM/193 contact us at: help@mindblows.us BSOP 209 WEEK 5 HOMEWORK PROBLEM BSOP 209 Week 5 Linear Programming Homework Problem B1, B2 BSOP 209 WEEK 5 HOMEWORK PROBLEM To purchase this tutorial visit here: http://mindsblow.us/question_des/BSOP209WEEK5HOMEWORKPROBLEM/193 contact us at: help@mindblows.us BSOP 209 WEEK 5 HOMEWORK PROBLEM BSOP 209 Week 5 Linear Programming Homework Problem B1, B2 BSOP 209 WEEK 5 HOMEWORK PROBLEM To purchase this tutorial visit here: http://mindsblow…

Words: 1398 - Pages: 6
• ###### Bsop 209 Coursework Week 1 – 8 Essay

(BSOP 209 Operations Analysis - DeVry) BSOP 209 Week 1 Assignment BSOP 209 Week 2 Assignment BSOP 209 Week 2 Quiz; Linear Regression, Correlation, and Forecast Error BSOP 209 Week 3 Assignment BSOP 209 Week 3 Case Study 1 BSOP 209 Week 4 Quiz; Waiting - Line Models and Linear Programming BSOP 209 Week 5 Linear Programming Concept Paper BSOP 209 Week 5 Linear Programming Homework Problem BSOP 209 Week 6 Quantitative Module A Decision: Making Tools Homework Problem 1 BSOP 209 Week 6 Quantitative…

Words: 748 - Pages: 3
• ###### Essay Business Math By George Dantzig And Harold Kuhn

mathematics such as matrix algebra, linear programming and mathematics of finance. Thus, it is perfect to use in the business management field. Not only is Business math a very important type of mathematics but so is Financial Mathematics because they two form important branches of math that are directly applied to business and economics. Examples of these applied math’s that are vital for business are management science, probability theory, time series analysis, linear programming and queuing theory. Business…

Words: 845 - Pages: 4
• ###### ECO 550 FINAL EXAM Essay

CLCIK HERE TO DOWNLOAD ECO 550 FINAL EXAM 1. Which of the following could be a linear programming objective function? 2. Which of the following could not be a linear programming problem constraint? 3. Types of integer programming models are _____________. 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…

Words: 1181 - Pages: 5
• ###### Essay Business Math And The Real World

incorporating it into their work. For example, George Dantzig is known for “developing the simplex algorithm to facilitate programming (military jargon for planning, rather than today 's computer use) in a linear structure ("Who Was George B. Dantzig? - INFORMS," n.d.). This helped many economists, mathematicians and many others. The result of his facilitating technique was called “Linear programming”. This technique became extremely popular and is now taught in business mathematics courses. Harold Kuhn, in the…

Words: 1812 - Pages: 8
• ###### Mat 540 Week 11 Final Exam Newly Taken 2016 Essay

lancehomework@gmail.com Final Draft of MAT 540 Final 1. Which of the following could be a linear programming objective function? (Points : 5) Z = 1A + 2BC + 3D Z = 1A + 2B + 3C + 4D Z = 1A + 2B / C + 3D Z = 1A + 2B2 + 3D all of the above 2. Which of the following could not be a linear programming problem constraint? (Points : 5) 1A + 2B 1A + 2B = 3 1A + 2B LTOREQ 3 1A + 2B GTOREQ 3 3. Types of integer programming models are _____________. (Points : 5) total 0 – 1 mixed all of the above 4…

Words: 1689 - Pages: 7