Angeles University Foundation

Angeles City
COLLEGE OF BUSINESS & ACCOUNTANCY
Accountancy and Finance Department
Course Syllabus for BS Accountancy, BS in Management Accounting, BSBA Major in Management and Entrepreneurship
1st Semester, A.Y. 2012-2013
I.

COURSE CODE

: MATH 22

II.

COURSE TITLE

: Quantitative Techniques in Business

III.

COURSE DESCRIPTION

: This course provides students with a solid foundation in quantitative methods and
management science.

A strong emphasis is placed on model building and computer

applications to help students understand how the techniques are actually used in business
today. In each of the lesson, managerial problems are presented to provide motivation for
learning the techniques that can be used to address these problems. The mathematical models
are presented in a clear and concise fashion. The techniques will be applied to sample
problems in order for the students appreciate the course.
IV.

COURSE CREDIT

: 3 units

V.

WEEKLY CONTACT HOURS

: 3 hours

VI.

PREREQUISITE

: MATHSTA

VII.

GENERAL OBJECTIVES
At the end of the course, the students are expected:

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

1. demonstrate proficiency in linear algebra alongside its applications to problems in the context of business management;
2. acquire proficiency in applying linear and nonlinear programming;
3. develop a clear understanding on the application of various quantitative analysis models and techniques;
4. demonstrate commitment to learning toward economic and social improvement for the total development of man, for God and humanity.
viii. COURSE CONTENTS

SPECIFIC OBJECTIVES

CONTENTS

TIME TABLE

INSTRUCTIONAL MODES

At the end of the course, the students

shall:

1. Linear Algebra

1. acquire proficiency in discussing

3 hrs

Problem-Based Learning

1.1 Matrices and Vectors

Skill Demonstration

the building blocks of linear

1.2 Matrices and Systems of Linear Equations

Case Analysis

algebra;

1.3 The Gauss-Jordan Method

Multiple Representations

use

knowledge

of

matrices and vectors to develop a

1.4 Linear Independence and Linear

Forward and Backward References

systematic procedure (the Gauss- Dependence

Jordan method) for solving linear

1.5 The Inverse of a Matrix

equations;

1.6 Determinants

Meta-Communication

3 hrs
2. Fundamentals of Decision Theory
2. list the steps of the decisionmaking process; describe the
AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

Problem-Based Learning
Skill Demonstration

2.1 Decision Theory

Case Analysis

2.2 Types of Decision-Making Environments

Multiple Representations

types

of

decision-making

2.3 Decision- Making under Risk

Forward and Backward References

environments; use probability

2.4 Decision-Making under Uncertainty

Meta-Communication

values to make decision under

2.5 Marginal Analysis

risk; and make decisions under

uncertainty, where there is risk

3 hrs

Problem-Based Learning

but probability values are not 3. Linear Programming

Skill Demonstration

known;

3.1 Linear Programming Problems

Case Analysis

3.2 Graphical Solutions of Two-Variable Linear

Multiple Representations

3. describe

the

characteristics

general

shared

by

Programming Problems

Forward and Backward References

all

Meta-Communication

linear programming problems;

solve graphically those linear
problems that involve only two
variables;

solve

optimization

problems in industries as diverse

as banking, education, forestry,
petroleum;

and

trucking;

formulate linear programming

models of real-life situations;
4. explain

how

the

simplex

algorithm can be used to find

optimal solutions to LPs with
multiple

constraints

and

variables; acquire proficiency in

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

6 hrs
4. Simplex Algorithm and Goal Programming

Problem-Based Learning
Skill Demonstration

4.1 Converting LP to Standard Form

Case Analysis

4.2 Simplex Algorithm

Multiple Representations

4.3 Maximization Models

Forward and Backward References

4.4 Minimization Models

Meta-Communication

4.5 Non-Standard Models

4.6 Special Cases

using Karmarkars pioneering

approach

for

solving

LPs;

understand the utility of goal

programming which enables the
decision maker to consider more
than one objective function;
PRELIM EXAMINATION 3 hrs.
5. explain how changes in an LPs 5. Duality and Sensitivity Analysis

5 hrs

Problem-Based Learning

parameter affect the optimal

5.1 Basic Concepts

Skill Demonstration

solution; acquire proficiency in a

5.2 Establishing Duality Solutions

Case Analysis

graphical

of

5.3 Sensitivity Analysis

Multiple Representations

sensitivity analysis; understand

5.4 Range of Optimality

Forward and Backward References

the concept of duality alongside

5.5 Range of Feasibility

Meta-Communication

its

explanation

interpretation

and

significance; formulate the dual

of a problem; perform duality
and sensitivity analysis;
6. structure

LP

6. Transportation, Assignment, and

problems

for Transshipment Models

5 hrs

Problem-Based Learning
Skill Demonstration

transportation; use the Northwest

6.1 The Transportation Problem

Case Analysis

Corner

6.2 The Assignment Problem

Multiple Representations

approximation method to find

6.3 The Transshipment Problem

Forward and Backward References

initial solutions to transportation

6.4 The Transportation Algorithm

Meta-Communication

problems; apply the stepping-

6.5 Facility Location Analysis

stone and MODI methods to find

6.6 The Assignment Algorithm

method

and

Vogels

optimal solutions; solve facility

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

location and other application

problems with the transportation
model;

solve

assignment

5 hrs

Problem-Based Learning

problems with the Hungarian 7. Integer Programming, Goal Programming, and

Skill Demonstration

(matrix reduction) method;

Nonlinear Programming

Case Analysis

7.1 Integer Programming

Multiple Representations

7.2 Modeling with Binary Variables

Forward and Backward References

programming; understand and

7.3 Goal Programming

Meta-Communication

solve the three types of integer

7.4 Nonlinear Programming

7. understand
between

the
LP

and

programming
formulate

difference
integer

problems;

and

programming

solve

goal

problems;

formulate and solve nonlinear

programming problems;
8. connect all points of a network
while minimizing total distance
using the minimal-spanning tree
technique;

determine

maximum

flow

through

MID-TERM EXAMINATION 3 hrs.

a. 8. Network Models

3 hrs

8.1 Minimal-Spanning Tree Problem

8.2 Maximal-Flow Problem
8.3 Shortest-Route Problem

Problem-Based Learning
Skill Demonstration
Case Analysis

the

Multiple Representations

Forward and Backward References

network using the maximal-flow

Meta-Communication

technique and LP; find the

shortest path through a network
using

the

technique and LP;

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

shortest-route

9. Project Management
9.1 PERT/CPM

3 hrs

Problem-Based Learning
Skill Demonstration

9. understand how to plan, monitor,

and control projects with the use

9.2 PERT/Cost
9.3 Project Crashing

Case Analysis
Multiple Representations

of PERT and CPM; define

Forward and Backward References

earliest start, earliest finish, latest

Meta-Communication

start, latest finish, and slack

times for each activity, along
with the total project completion

3 hrs

10. Forecasting
10.1 Types of Forecasts
time at least total cost by
10.2 Scatter Diagrams and Time Series
10.3 Measures of Forecasting Accuracy
crashing the network;
10.4 Time-Series Forecasting Models
10. understand and know when to
10.5 Monitoring and Controlling Forecasts
time; reduce the total project

Problem-Based Learning
Skill Demonstration
Case Analysis
Multiple Representations
Forward and Backward References

use forecasting models; compare

Meta-Communication

moving averages, exponential

smoothing, and other time-series
models; understand Delphi and 11. Inventory Control Models
11.1 Inventory Control and Inventory
other qualitative decision making
Decisions
approaches; compute variety of
11.2 Economic Order Quantity
11.3 Reorder Point
error measures;
11.4 Quantity Discount Models
11. understand the importance of
11.5 Use of Safety Stock
11.6 Single-Period Inventory Models
inventory control and ABC
11.7 ABC Analysis
analysis; use economic order
11.8 Material Requirements Planning
11.9 Just-in-Time Inventory Control
quantity (EOQ) to determine
how much to order; compute the
reorder

point

(ROP)

in

determining when to order more

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

3 hrs

Problem-Based Learning
Skill Demonstration
Case Analysis
Multiple Representations
Forward and Backward References
Meta-Communication

inventory;

handle

inventory

problems that allow quantity

discounts or noninstantaneous

3 hrs

receipt; understand the use of

Skill Demonstration

safety stock; describe the use of 12. Markov Analysis

12.1 States and State Possibilities
material requirements planning
12.2 Matrix of Transition Probabilities
in solving dependent-demand
12.3 Predicting Future Market Shares
12.4 Markov Analysis of Machine Operations
inventory problems; discuss just12.5 Equilibrium Conditions
in-time inventory concepts to
12.6 Accounts Receivable Applications

Case Analysis

reduce

inventory

levels

and

states

and

costs;
12. determine

future

conditions by using Markov

analysis; compute long-term or
steady-state conditions by using
only the matrix of transition
probabilities; understand the use
of absorbing state analysis in
predicting future conditions.
FINAL EXAMINATION 3 hrs.

IX.

Problem-Based Learning

COURSE REQUIREMENTS

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

Multiple Representations
Forward and Backward References
Meta-Communication

X.

XI.

Major Exams Prelims, Mid-terms, Finals.

Quizzes minimum of 2 for each of the following: Prelims, Mid-terms, Finals.
Seatworks - minimum of 2 for each of the following: Prelims, Mid-terms, Finals.
Assignments - minimum of 2 for each of the following: Prelims, Mid-terms, Finals.
Recitation
Attendance
Other policies/course requirements: Integrity of the students grades, security of test questions, University policies as per student
handbook, BSA Admission, Promotion and Retention Policies (Please refer to form: AUF-POL-CBA).

ASSESSMENT CRITERIA
Component

Weight

Quizzes
Seatworks
Assignments
Recitations
Attendance

70%
10%
5%
10%
5%

VALUES

At the end of the course, learners are expected to appreciate and exercise values of honesty, integrity, fairness/transparency, technical competence,
and professional ethics to become MABUTI, MAGALING AT MAY MALASAKIT SA KAPWA.

REFERENCES
Books
Cabrero, Salamat, and Sta. Maria, (2009). Quantitative techniques in management 3rd Edition, National Bookstore.
AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

Ragsdale, (2011). Managerial decision modeling 6th Edition, South-western CENAGE Learning.
Render, Stair, and Hanna, (2012). Quantitative analysis for management 11th Edition, Pearson Education Limited.
Sirug, (2012). Quantitative techniques for business, Mindshapers Co.
Swift and Piff, (2010). Quantitative methods

Websites
Solving Linear Equations. w.w.w. purplemath.com/moler/ln.pdf. Accessed on June 2, 2012.
Special Product and Factoring w.w.w. mathalino.com/reviewer / algebra/special products. Accessed on June 2, 2012.
Time series analysis for Business Forecasting w.w.w. home ubalt/ntsh/stat-data /forecast /html. Accessed on June 2, 2012.
Introduction to linear Programming. w.w.w. purplemath.com/midule3, htm. Accessed on June 2, 2012.

Prepared by:

Jesusa N. Calma, MBA

Instructor

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00

Evaluated by: Lovell M. Abello, CPA, MBA

Chairperson

Approved by: Dr. Chere C. Yturralde

Dean

AUF-SYL-CBA/ACCTG-40
June 09, 2014-Rev.00