1. Trang chủ
  2. » Luận Văn - Báo Cáo

Lecture Operations management: Creating value along the supply chain (Canadian edition) - Chapter 14S

26 48 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 26
Dung lượng 490,57 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

Chapter 14 supplement - Linear programming. This chapter includes contents: Model formulation, graphical solution method, linear programming model solution, solving linear programming problems with excel, sensitivity analysis.

Trang 1

Robert S Russell, Bernard W Taylor III, Ignacio Castillo, Navneet Vidyarthi

CHAPTER 14

SUPPLEMENT

Linear Programming

OPERATIONS

MANAGEMENT: Creating Value

Along the Supply Chain,

Canadian Edition

Trang 2

Lecture Outline

Trang 3

Linear Programming (LP)

representing a firm’s objective and resource

constraints

determines a level of operational activity in order to achieve an objective, subject to restrictions called constraints

Trang 4

Types of LP

Trang 5

Types of LP

Trang 6

Types of LP

Trang 7

LP Model Formulation

— symbols representing levels of activity of an operation

— linear relationship for the objective of an operation

— most frequent business objective is to maximize profit

— most frequent objective of individual operational units (such as a production or packaging department) is to

minimize cost

— linear relationship representing a restriction on decision making

Trang 8

xj = decision variables

bi = constraint levels

cj = objective function coefficients

aij = constraint coefficients

Constraints

Trang 9

Highlands Craft Store

Labor Clay Revenue

Product (hr/unit) (lb/unit) ($/unit)

There are 40 hours of labor and 120 pounds of clay

available each day

Decision variables

x1 = number of bowls to produce

x2 = number of mugs to produce

Resource Requirements

Trang 10

Highlands Craft Store

Trang 11

Graphical Solution Method

plane

where all constraints are satisfied simultaneously

boundary of this space that maximizes (or

minimizes) value of objective function

Trang 12

Graphical Solution Method

4 x1 + 3 x2 120 lb

x1 + 2 x2 40 hr

Area common toboth constraints

Trang 13

Computing Optimal Values

| 20

| 30

| 40

x1

x2

24 8

Trang 14

Extreme Corner Points

x1 = 224 bowls x2 = 8 mugs

|20

|30

|40

Trang 15

Z = $2,100

Trang 17

Z = $24

Z = 6x1 + 3x2

Trang 18

Simplex Method

— Mathematical procedure for solving LP problems

— Follow a set of steps to reach optimal solution

— Slack variables added to ≤ constraints to represent unused resources

Trang 19

Solution Points With Slack Variables

Trang 20

Solution Points With Surplus Variables

Trang 21

Solving LP Problems with Excel

Click on “Data”

to invoke “Solver”

Trang 22

Solving LP Problems with Excel

After all parameters and constraintshave been input, click on “Solve”

Trang 23

LP Solution

Trang 25

Sensitivity Range for Labor Hours

Trang 26

Copyright © 2014 John Wiley & Sons Canada, Ltd All rights reserved Reproduction or translation of this work beyond that permitted by Access Copyright (The Canadian Copyright Licensing Agency) is unlawful Requests for further information should be addressed to the Permissions Department, John Wiley & Sons Canada, Ltd The purchaser may make back-up copies for his or her own use only and not for distribution or resale The author and the publisher assume no responsibility for errors, omissions, or damages caused by the use of these programs or from the use of the information contained herein.

Ngày đăng: 16/01/2020, 05:09

TỪ KHÓA LIÊN QUAN