This website uses cookies to ensure you have the best experience. Learn more

Linear Programming Essay

635 words - 3 pages

Problem 1
A company produces two types of dolls (D1 and D2). The following table gives the selling price, the labor time, machine time and raw material required for the production of each type of doll, D1 and D2 respectively. Each week, up to 450 kg of raw material can be purchased. The company employs four workers, who regularly work 40 hours per week. Each week 400 hours of machine time are available.
| D1 | D2 |
Selling price | € 12 | € 8 |
Labor required | 0.7 hour | 0.5 hour |
Machine time required | 1.5 hours | 0.8 hour |
Raw Material required | 2 kg | 1 kg |
At most 50 dolls D1 and 60 toys D2 are expected to be demanded each week.
The production manager is interested in developing the optimal production plan that maximizes the total profit.
The problem can be formulated as the following linear program.
...view middle of the document...

Type ofToy | Required Content in | Price ($) |
| Plastic | Metal | Material | |
T1 | 1 | 2 | 3 | 20 |
T2 | 1.5 | 1.7 | 1.4 | 17 |
T3 | 1.8 | 1.6 | 2 | 15 |
Cost ($) | 5 | 6 | 4.5 | |
Available Quantities | 400 | 200 | 250 | |
The firm wishes to determine the optimum production level of each toy that maximizes its total profit.
The problem can be formulated as the following linear program.
Let:
Χ1 = the number of toys type T1 to be produced
Χ2 = the number of tools type T2 to be produced
Χ3 = the number of tools type T3 to be produced
The objective function is:
Ζ =15Χ1+11Χ2+10.5Χ3
Subject to the constraints:
Χ1+1.5Χ2 + 1.8Χ3 400 (1)
2Χ1 + 1.7Χ2 + 1.6Χ3 200 (2)
3Χ1 + 1.4Χ2 + 2Χ3 250 (3)
Χ1, Χ2, Χ3 0

Problem 3
A company produces three types of tools (A, B, C). The resources used to produce each type of tool are shown in the following table.
| Tools |
| A | B | C |
Iron (kg) | 9 | 8 | 7.5 |
Machine time (minutes) | 50 | 110 | 90 |
Labor time (minutes) | 60 | 40 | 55 |
Profit (€) | 12 | 15 | 13.5 |
The company works on a weekly schedule of 5 days, with 2 shifts of 7.5 hours each. It has 4 machines available for production and 15 employees on each shift.
The marketing department requires that at least 300 tools of all types be produced each week.
The company’s capacity is 3 tons of iron.
The production manager is interested in developing the optimal production plan that maximizes the company’s total profit.
The problem can be formulated as the following linear program.
Χ1 = the number of tools type A to be produced
Χ2 = the number of tools type B to be produced
Χ3 = the number of tools type C to be produced
The objective function is:
Ζ=12Χ1+15Χ2+113.5Χ3
Subject to the constraints:
9Χ1 + 8Χ2 + 7.5Χ3 3000 (1)
50Χ1 + 110Χ2 + 90Χ3 18000 (2)
60Χ1 + 40Χ2 + 55Χ3 135000 (3)
Χ1 + Χ2 + Χ3 300 (4)
Χ1, Χ2, Χ3 0

Other Papers Like Linear Programming

The Reusability of a Code Essay

593 words - 3 pages behaviors of an object. When you only allow the object to be accessed and changed through certain behaviors, these values are held within an objects state can be controlled. The hiding of the details of how an object works is the only part of an object that is accessible to the outside world is how it acts (behaviors). Procedural vs. object- oriented programming; procedural programming is also known as linear programming, a couple of things

Or - Farm Mode Essay

2429 words - 10 pages Research Journal of Management Sciences ____________________________________________ ISSN 2319–1171 Vol. 2(5), 20-23, May (2013) Res. J. Management Sci. Modeling a Small Farm Livelihood System using Linear Programming in Bindura, Zimbabwe Majeke Felix, Majeke Judith, Mufandaedza Jonathan and Shoko Munashe Department, Great Zimbabwe University, Masvingo, ZIMBABWE Available online at: www.isca.in Received 30th January 2013, revised

Diet Planning for Human Beings Using Optimization Techniques

4270 words - 18 pages 1.1. INTRODUCTION The aim of this study is to use linear programming to optimize nutrients intakes in human diet. Also this study aims to propose a cost effective one month diet for the various categories of the population . 1.2. STATEMENT OF THE PROBLEM Observations show that eating habit of most persons of Huye district and other district like Huye are

540 Math Strayer Quiz Week 6

1009 words - 5 pages MAT 540 Week 6 Quiz 4: 1. The standard form for the computer solution of a linear programming problem requires all variables to the right and all numerical values to the left of the inequality or equality sign True/ False 2. _________ is maximized in the objective function by subtracting cost from revenue. Profit Revenue Cost Productivity 3. A croissant shop produces 2 products: bear claws (B) and almond filled croissants

Operation Research Development

1292 words - 6 pages , x3 ≥ 0 We are looking for optimum sol for x1 , x2 , x3 to maximize objective function subject to constraints Introduction to optimization & linear programming Examples of decision making situations that depend on mathematical programming 1 - Product mix: each product require different amount of row materials and labor. Manger must decide how many of each product to produce in order to maximizes profit and minimize cost → EX (lecture 1) 2

Project Management and Operational Research

2094 words - 9 pages , we have chosen one of the most widely used model, known as linear programming model. According to Thomas Ferguson a linear programming is defined as the problem of maximizing or minimizing a linear function subject to constraints. In other words linear programming is the process of finding the “best” value obtainable under various linear inequalities related to some conditions. A typical example related to Bay City Movers would be taking the

Mat 540 Q5

1126 words - 5 pages | | | | | * Question 4 2 out of 2 points | | | The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function.   Answer | | | | | Selected Answer: |  True | Correct Answer: |  True | | | | | * Question 5 2 out of 2 points | | | If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2

Mat 540 Quiz 4

1901 words - 8 pages HRM LAW LDR MAT MGT MKT OPS 571 QNT QRB 501 RES SCI STR 581 DeVry * Marked fields are required. $15.00 1 PURCHASE Price $15.00 $15.00 $15.00 SET 1 1. The standard form for the computer solution of a linear programming problem requires all variables to the right and all numerical values to the left of the inequality or equality sign 2. _________ is maximized in the objective function by subtracting cost from revenue. 3. A

Linear Optimization in Retail Settings

3432 words - 14 pages this paper, I will use both linear optimization and goal programming to take a number of sets of data to analyze and discover the optimal use of various constraints of resources. The paper will be divided into three different sections with a specific method applied in the first two sections, and a final section to describe the possible errors in the solutions presented in the prior two sections. In the first section, I will use linear

Chi-Square Analysis

2291 words - 10 pages before tax household income? | 27.5% | 72.5% | 100.0% | | % within likemod | 100.0% | 100.0% | 100.0% | Chi-Square Tests | | Value | df | Asymp. Sig. (2-sided) | Pearson Chi-Square | 305.177a | 6 | .000 | Likelihood Ratio | 335.550 | 6 | .000 | Linear-by-Linear Association | 232.485 | 1 | .000 | N of Valid Cases | 400 | | | a. 1 cells (7.1%) have expected count less than 5. The minimum expected count is 4.40. | Education

Prg 210 Week 4 Paper

1301 words - 6 pages execution if a condition is false. Repetition control structure or looping is the process of repeating execution of one or more steps of an algorithm or computer program. Essentially in programming, many performed calculations have repetitious tasks. Examples of both a selection control structure statement and a repetition control structure statement identifies and helps understand the importance of available computer operations to the programmer

Related Essays

Linear Programming Essay

4364 words - 18 pages LINEAR PROGRAMMING II 1 Linear Programming II: Minimization © 2006 Samuel L. Baker Assignment 11 is on page 16. Introduction A minimization problem minimizes the value of the objective function rather than maximizing it. Minimization problems generally involve finding the least-cost way to meet a set of requirements. Classic example -- feeding farm animals. Animals need: 14 units of nutrient A, 12 units of nutrient B, and 18 units of

Linear Programming Case Problem Essay

589 words - 3 pages layered from north to south in the city. So if a sector were laid out east to west, all of it would tend to be in one demographic layer. Ms. Maris indicated that she had almost enough information to develop a model, except that she also needed to know the average travel speed the patrol cars could travel. Sergeant Davies told her that cars moving vertically traveled an average of 15 miles per hour, whereas cars traveled horizontally an average of 20 miles per hour. He said that the difference was due to different traffic flows. Develop a linear programming model for this problem and solve it by using the graphical method.

Linear Programming Using Solver In Excel Essay

2420 words - 10 pages Linear Programming: Using Solver in Excel Linear Programming was conceptually developed before World War II by the outstanding Russian mathematician A.N.Kolmogorov and gained its popularity ever since the development of Simplex method by George B. Dantzig in 1947. Linear programming deals with problems of maximizing or minimizing a linear function in the presence of linear equality and/or inequality constraints. In these problems, we find the

Linear Programming Case Study

331 words - 2 pages The owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4600 ounces of salt, 9400 ounces of flour, and 2200 ounces of herbs. A bag of Lime chips requires 1.5 ounces of salt, 5 ounces of flour, and 2 ounces of herbs to produce; while a bag of Vinegar chips requires 4 ounces of salt, 6 ounces of flour, and 2 ounces of