Preview

Quality Management

Satisfactory Essays
Open Document
Open Document
5344 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Quality Management
Introduction to Optimization Linear Programming 1. If an LP model has more than one optimal solution it has an infinite number of alternate optimal solutions. In Figure 2.8, the two extreme points at (122, 78) and (174, 0) are alternate optimal solutions, but there are an infinite number of alternate optimal solutions along the edge connecting these extreme points. This is true of all LP models with alternate optimal solutions. 2. There is no guarantee that the optimal solution to an LP problem will occur at an integer-valued extreme point of the feasible region. (An exception to this general rule is discussed in Chapter 5 on networks). 3. We can graph an inequality as if they were an equality because the condition imposed by the equality corresponds to the boundary line (or most extreme case) of the inequality. 4. The objectives are equivalent. For any values of X1 and X2, the absolute value of the objectives are the same. Thus, maximizing the value of the first objective is equivalent to minimizing the value of the second objective. 5. a. linear b. nonlinear c. linear, can be re-written as 4 X1 - .3333 X2 75 d. linear, can be re-written as 2.1 X1 1.1 X2 - 3.9 X3 SYMBOL 163 f Symbol 0 e. nonlinear 6. 7. 8. 9. 10. 11. 12. 13. X1 of TV spots, X2 of magazine ads MAX 15 X1 25 X2 (profit) ST 5 X1 2 X2 100 (ad budget) 5 X1 0 X2 SYMBOL 163 f Symbol 70 (TV limit) 0 X1 2 X2 SYMBOL 163 f Symbol 50 (magazine limit) X1, X2 SYMBOL 179 f Symbol 0 SHAPE MERGEFORMAT 14. X1 tons of ore purchased from mine 1, X2 tons of ore purchased from mine 2 MIN 90 X1 120 X2 (cost) ST 0.2 X1 0.3 X2 8 (copper) 0.2 X1 0.25 X2 6 (zinc) 0.15 X1 0.1 X2 5 (magnesium) X1, X2 SYMBOL 179 f Symbol 0 15. X1 number of generators, X2 number of alternators MAX 250 X1 150 X2 ST 2 X1 3 X2 SYMBOL 163 f Symbol 260 1 X1 2 X2 SYMBOL 163 f Symbol 140 X1, X2 SYMBOL 179 f Symbol 0 16. X1 number of

You May Also Find These Documents Helpful

  • 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
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Food Booth Mat 540

    • 517 Words
    • 3 Pages

    Julia Robertson is considering renting a food booth at her school. She is seeking ways to finance her last year and thought that a food booth outside her school’s stadium would be ideal. Her goal is to earn the most money possible thereby increasing her earnings. In this case problem, she decided to sell pizza, hotdogs and BBQ sandwiches. The following LP model illustrates the maximum net profit and constraints that will determine whether or not to least the booth.…

    • 517 Words
    • 3 Pages
    Good 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
  • Satisfactory Essays

    A. Julia Robertson is making an allowance for renting a food booth at her school. She is seeking ways to finance her last year and believed that a food booth outside her school’s stadium would be ideal. Her goal is to earn the most money possible thus increasing her earnings. In this case problem, she decided to sell pizza, hotdogs and BBQ sandwiches. The following LP model illustrates the maximum net profit and constraints that will determine whether or not to least the boot.…

    • 690 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Ch 12 Prac Test Kinetics1

    • 1596 Words
    • 17 Pages

    MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.…

    • 1596 Words
    • 17 Pages
    Satisfactory Essays
  • Good Essays

    5. The production manager for Liquor etc. produces 2 kinds of beer: light and dark. Two of his resources are constrained: malt, of which he can get at most 4800 oz per week: and wheat, of which he can get at most 3200 oz per week. 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. What is the objective function?…

    • 894 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Math 540

    • 905 Words
    • 4 Pages

    1. For a linear programming problem, assume that a given resource has not been fully used. In other words, the slack value associated with that resource constraint is positive. We can conclude that the shadow price associated with that constraint:…

    • 905 Words
    • 4 Pages
    Satisfactory Essays
  • Good Essays

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

    MATH%$)

    • 535 Words
    • 4 Pages

    4. If a maximization linear programming problem consist of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will ______ result in a(n) _____ solution to the integer linear programming problem.…

    • 535 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Q3) If cars sell for $500 profit and trucks sell for $300 profit which of the following represents the objective function? (2-points)…

    • 608 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Optimization Exam Paper

    • 1236 Words
    • 5 Pages

    Time allowed: 2 hours Attempt four questions. All questions carry equal marks. In all questions, you may assume that all functions f (x1 , . . . , xn ) under consideration are sufficiently ∂2f ∂2f continuous to satisfy Young’s theorem: fxi xj = fxj xi or ∂xi ∂xj = ∂xj ∂xi . The following abbreviations, consistent with those used in the course, are used throughout for commonly occurring optimisation terminology: LPM – leading principal minor; PM – (non-leading) principal minor; CQ – constraint qualification; FOC – first-order conditions; NDCQ – non-degenerate constraint qualification; CSC – complementary slackness condition; NNC – non-negativity constraint.…

    • 1236 Words
    • 5 Pages
    Satisfactory Essays
  • Powerful Essays

    In linear programming, a statement such as "maximize contribution" becomes an objective function when the problem is formulated.…

    • 1510 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    Quality Management

    • 1536 Words
    • 7 Pages

    After analyzing your data, you are now prepared to present your findings to the company CEO. Discuss ten quality management improvement initiatives you would recommend, including quality tools to improve company poor performance.…

    • 1536 Words
    • 7 Pages
    Good Essays
  • Satisfactory Essays

    Haya

    • 537 Words
    • 3 Pages

    Students cannot choose EDUC 219, EDUC 227, ECON 213, STAT 201, STAT 210, STAT 234, ITEC 242,…

    • 537 Words
    • 3 Pages
    Satisfactory Essays