Beruflich Dokumente
Kultur Dokumente
Instructor: Vincent WS Chow Office: WLB 818 Ext: 7582 E-mail: vwschow@hkbu.edu.hk URL: http://ww.hkbu.edu.hk/~vwschow Office hours:
(to p2)
Tues day
Wednes day
Thurs day
Friday
*
14:30
*
ISEM
*
BUS
15:30 16:30
17:30 17:3018:30 *
(to p3)
(subject outline)
* Office hours
Subject outline
Subject outline (see handout)
Textbook:
Bernard W. Taylor III, Introduction to Management Science, 10th Edition, Prentice Hall, 2010
(to p4)
Refer to handout
Start from 3rd hr of 3rd week lecture Typically, we assign few questions in each lecture and then taken them up for discussion in the next week session. (to p5) (to p6) 3 How you are being graded?
(lecture)
Grading:
Assignments Class Participation
Tutorial performance
15%
Most likely be1-3 assignments Group Memberships (refer to our web site)
15%
20% 50%
(to p3)
Test
One mid-term exam
Examination
One final exam
Linear Programming
(to p13)
Management Science
Management science uses a scientific approach to solving management problems. It is used in a variety of organizations to solve many different types of problems. It encompasses a logical mathematical approach to problem solving. History of Management Science
(to p8)
(to p6)
It is thus more emphasizing on the analysis of solution applications than learning their on how models were derived. Other names for management science: quantitative methods, quantitative analysis and decision sciences.
(to p7)
(2)
(3)
(4)
Steps
1. 2. 3. Observation Identification of a problem that exists in the system or organisation. Definition of the Problem Problem must be clearly and consistently defined showing its boundaries and interaction with the objectives of the organisation. Model Construction Development of the functional mathematical relationships that describe the decision variables, objective function and constraints of the problem. Model Solution Models solved using management science techniques. Model Implementation Actual use of the model or its solution.
10
(to p9)
4. 5.
* * * * * *
* *
* Their Characteristics
(to p12) (to p6)
11
12
Linear Programming
Or denote as LP Overview of LP How does LP look like? Components of LP General LP format Example 1: Maximizing Z Example 2: Minimizing Z We will talk about more LP formulations and its solutions in next lecture
(to p14) (to p20) (to p15) (to p21) (to p23) (to p25)
13
Objectives of business firms frequently include maximizing profit or minimizing costs, or denote as Max Z or Min Z
Linear programming is an analysis technique in which linear algebraic relationships represent a firms decisions given a business objective and resource constraints. Steps in application: 1- Identify problem as solvable by linear programming. 2- Formulate a mathematical model of managerial problems. 3- Solve the model.
14
(to p13
4 Components of LP
1. Decision variables: mathematical symbols (to p16) representing levels of activity of a firm. 2. Objective function: a linear mathematical relationship describing an objective of the firm, in terms of decision variables, that is maximized (to p17) or minimized 3. Constraints: restrictions placed on the firm by the operating environment stated in linear relationships of the decision variables. (to p18) 4. Parameters: numerical coefficients and constants used in the objective function and (to p19) constraint equations. (to p13) 5. Non-negativity (or necessary) constraints 15
x1=number of bowls to produce/day x2= number of mugs to produce/day How of them are needed is depended on the nature of the problem!
16
(to p15)
Objective Functions
It is used to represent the type of problems we are to solve
In this subject, we only emphasize to either
1. Maximizing a profit margin or 2. Minimizing a production cost
Constraints
It is also referred to resource constraints They are to indicate how much resources made available in a firm Example:
Resource Constraints: 1x1 + 2x2 40 hours of labor 4x1 + 3x2 120 pounds of clay
18
(to p15)
Non-negativity constraints
We assumed that all decision variables are carried out positive values (why?) Example:
Non-negativity Constraints:
x10; x2 0
(to p15)
19
Sample of LP
Let xi be denoted as xi product to be produced, and i = 1, 2
or Let and x1 be numbers of product x1 to be produced x2 be numbers of product 21 to be produced
Decision variables
Cost
(to p13)
20
General LP format
Max/Min Z : cixi
subject to
aij xij (=, , ) bj , j = 1,., n xij 0, for i=1,,m, j=1,,n
(to p22)
General steps for LP formulation It means there are total of m decision variables n resource constraints
(to p13)
21
(to p21)
22
Resource available: 40 hours of labour per day and 120 pounds of clay per day. How many bowls and mugs should be produced to maximizing profits give these labour resources? LP formulation
(to p24)
23
Max LP problem
Step 1: define decision variables Let x1=number of bowls to produce/day x2= number of mugs to produce/day Step 2: define the objective function maximize Z = $40x1 + 50x2 where Z= profit per day Step 3: state all the resource constraints
1x1 + 2x2 40 hours of labor ( resource constraint 1) 4x1 + 3x2 120 pounds of clay (resource constraint 2) Step 4: define non-negativity constraints x10; x2 0
Complete Linear Programming Model: \ maximize Z=$40x1 + 50x2 subject to 1x1 + 2x2 40 4x2 + 3x2 120 x1, x2 0
24
(to p13
Example 2: Min Z
A farmer is preparing to plant a crop in the spring. There are two brands of fertilizer to choose from, Supper-gro and Crop-quick. Each brand yields a specific amount of nitrogen and phosphate, as follows:
The farmers field requires at least 16 pounds of nitrogen and 24 pounds of phosphate. Super-gro costs $6 per bag and Crop-quick costs $3 per bag. The farmer wants to know how many bags of each brand to purchase in order to minimize the total cost of fertilizing. LP formulation (to p26)
25
Min Z
Step 1: define their decision variables
x1 0, x2 0 Overall LP: Minimise Z 6x1 3x2 subject to 2x1 4x2 16, 4x1 3x2 24, x1 0, x2 0
26
(to p13