Preview

An Introduction to Linear Programming 

Satisfactory Essays
Open Document
Open Document
280 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
An Introduction to Linear Programming 
An Introduction to Linear Programming

Introduction to Quantitative Management, Anderson

Iqra University, Main Campus(Management Science)
Course: Management Science Faculty: Iftikhar Mubbashir
Date: March 1, 2013

Spring 2013

Assignment‐1 (Solution)

Q‐1)
2
a, b, and e, are acceptable linear programming relationships. c is not acceptable because of − 2x 2 , d is not acceptable because of 2 x 1 , f is not acceptable because of 1x 1 x 2 Q‐2)
a)

b)

c)

Q‐3)

1

Chapter‐2

An Introduction to Linear Programming

Introduction to Quantitative Management, Anderson

a)

b)

c)

Q‐7)

Q‐9)

2

Chapter‐2

An Introduction to Linear Programming

Introduction to Quantitative Management, Anderson

Q‐10)

x1
0
0
3
1.72

3

Corner Points x2 0
3
0
2.14

Value of Objective Function
Z
0
9
6
9.86

Chapter‐2

An Introduction to Linear Programming

Introduction to Quantitative Management, Anderson

Optimal solution is x 1 = 1.72 and x 2 = 2.14 , where as the maximum value of the objective function is z = 9.86 Q‐11)

x1
0
100
0
100
40

Corner Points
Value of Objective Function x2 Z
0
0
0
500
80
400
50
750
80
600 Optimal solution is x 1 = 100 and x 2 = 50 , where as the maximum value of the objective function is z = 750 Q‐12)
a)

4

Chapter‐2

An Introduction to Linear Programming

Introduction to Quantitative Management, Anderson

x1
0
0
4
3

Corner Points
Value of Objective Function x2 Z
0
0
3
9
0
12
1.5
13.5 Optimal solution is x 1 = 3 and x 2 = 1.5 , where as the maximum value of the objective function is z =

You May Also Find These Documents Helpful

  • Good Essays

    b. The value of the optimal solution to the revised problem is 8(2.5) + 12(2.5) = 50.…

    • 730 Words
    • 11 Pages
    Good Essays
  • Satisfactory Essays

    Pt1420 Unit 4

    • 4123 Words
    • 17 Pages

    A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have…

    • 4123 Words
    • 17 Pages
    Satisfactory Essays
  • Good Essays

    ECO 550 FINAL EXAM

    • 1177 Words
    • 4 Pages

    9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.…

    • 1177 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Banner Tools produces two styles of steel hammers with wooden handles. The first sells for $6 and consists of .5 pounds of steel; the second sells for $15 and consists of 1 pound of steel. Since steel costs the firm $4 per pound and the handle, labor, and packaging costs amount to $1 for either hammer, the profits coefficients are $6 - .5($4) - $1 = $3 for the smaller hammer and $15 – 1($4) - $1 = $10 for the larger hammer. Thus the objective function for this model is MAX 3X1 + 10X2. Given that the shadow price for steel is $2, which of the following statements is correct?…

    • 1376 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Freaudian Analysis

    • 3380 Words
    • 14 Pages

    1. Consider the following linear programming problem: Maximize Z = 400 x + 100y Subject to 8 x + 10y ≤ 80 2 x + 6y ≤ 36 x≤ 6 x, y ≥ 0…

    • 3380 Words
    • 14 Pages
    Powerful 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
  • Good Essays

    Rock "N" Rap

    • 597 Words
    • 3 Pages

    Explain how you found an answer to Question 3 and why you think your answer gives the maximum profit. I know this because this is the highest point in the feasible region. I it’s hard to tell exactly just by graphing so the problem must be solved algebraically. I…

    • 597 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Brs Mdm3 Tif Ch04

    • 4332 Words
    • 20 Pages

    C) if the right-hand side value of the constraint increases by 1 unit, the objective function value will remain unchanged…

    • 4332 Words
    • 20 Pages
    Good Essays
  • Good Essays

    The objective is to maximize the profit by obtaining an optimal mix of Grade A and Grade B…

    • 974 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Delectation Delicatessen

    • 1216 Words
    • 5 Pages

    Conclusion: Delectation should produce 520 units of Fish-n-Fowl and 150 units of Surf-n-Turf sandwiches Delectation each day to make $3,902.50 revenue.…

    • 1216 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    Tomato paste

    • 292 Words
    • 2 Pages

    a) What is the optimal solution, and what are the optimal production quantities? W=1.0 M=1.250 PROFIT=800000…

    • 292 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    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.…

    • 552 Words
    • 3 Pages
    Good Essays
  • Good Essays

    the maximization of the minimum of x2 and x3. Formulate the problem as a linear model using…

    • 1241 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    The problem of maximization/minimization deals with choosing the ideal set of values of variables in order to find the extrema of an equation subject to constraints. The simplex method is one of the fundamental methods of calculating the Basic Feasible Solution (BFS) of a maximization/minimization. This algorithm implements the simplex method to allow for quick calculation of the BFS to maximize profit or minimize loss, depending on the requirement. It provides an intuitive user interface which can be used to provide all the input and then performs the required calculations, presenting the results in a clean format.…

    • 408 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Minimize Z = $6R1t + 10R1h + 8R1r + 10R1s + 7.2S1t + 12S1h + 9.6S1r + 12S1s + 6.2O1t +10.7O1h + 8.5O1r + 10.7O1s + 3R2t +5R2h + 4R2r + 5R2s + 3.1O2t + 5.4O2h + 4.3O2r +5.4O2s…

    • 344 Words
    • 2 Pages
    Satisfactory Essays