Scribd
Upload
2K views4 pages

950 Math M (PPU - STPM) Semester 3 Topics-Syllabus

This document outlines the topics and learning outcomes for the third semester of a mathematics course. The course covers financial and decision mathematics including interest, annuities, depreciation, cost and profit analysis, linear programming, critical path analysis, inventory models, and game theory. Some of the key concepts covered are calculating simple and compound interest, determining break-even points, using linear programming models and the simplex method, constructing activity networks for projects, and solving two-person zero-sum games.

Uploaded by

Josh, LRT
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2K views4 pages

950 Math M (PPU - STPM) Semester 3 Topics-Syllabus

This document outlines the topics and learning outcomes for the third semester of a mathematics course. The course covers financial and decision mathematics including interest, annuities, depreciation, cost and profit analysis, linear programming, critical path analysis, inventory models, and game theory. Some of the key concepts covered are calculating simple and compound interest, determining break-even points, using linear programming models and the simplex method, constructing activity networks for projects, and solving two-person zero-sum games.

Uploaded by

Josh, LRT
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

[PPU] Semester 3 Topics-Syllabus

950
MATHEMATICS M
Sources from:

Sharing Agent: LRT Documents

THIRD TERM: FINANCIAL AND DECISION MATHEMATICS Topic 13 Interest, Annuity and Depreciation 13.1 Interest Teaching Period 20 Learning Outcome Candidates should be able to:

(a) calculate simple interest and compound interest; (b) calculate the compound amount involving a number of interest periods; (c) determine an effective interest rate; (d) solve problems related to savings and loans;

13.2 Annuity

(e) calculate the future value of an annuity; (f ) solve problems related to sinking funds; (g) calculate the present value of an annuity; (h) solve problems related to amortisation;

13.3 Depreciation

(i ) (j )

use the flat rate depreciation method; use the reducing balance depreciation method.

14 Cost, Revenue and Profit

16

Candidates should be able to: (a) find cost, revenue and profit functions, and use their relationship; (b) determine the break-even point; (c) find average cost, average revenue and average profit functions; (d) find marginal cost, marginal revenue and marginal profit functions; (e) determine the minimum cost, maximum revenue and maximum profit; (f ) find demand and supply functions; (g) determine the equilibrium price and equilibrium demand; (h) calculate and interpret the consumers surplus and producers surplus.

Sharing Agent: LRT Documents

Page 1 of 3

Topic 15 Linear Programming 15.1 Problem formulation

Teaching Period 20 4

Learning Outcome Candidates should be able to: (a) determine the constraints; (b) find an objective function; (c) state a linear programming model;

15.2 Graphical method

(d) identify a feasible region; (e) determine the optimal solution; (f ) identify special cases: infeasibility, unbounded solutions and multiple optimal solutions;

15.3 Simplex method

(g) obtain the standard simplex form using slack and/or surplus variables; (h) construct simplex tableaux for a maximisation problem with at most three variables and three constraints in addition to non-negativity conditions; (i ) determine the optimal solution.

16 Critical Path Analysis 16.1 Networks

20 4

Candidates should be able to: (a) identify activities on arcs and activities on nodes; (b) construct an activity network for a project;

16.2 Critical paths

(c) calculate the earliest and latest start and finish times for activities; (d) calculate and interpret the total float for an activity; (e) identify critical activities and critical paths; (f ) determine the minimum completion time of a project;

16.3 Scheduling and crashing

(g) construct a Gantt chart and resource histogram for a project; (h) determine the minimum number of workers to complete a project in a given time; (i ) determine the minimum time to complete a project for a given number of workers;

Sharing Agent: LRT Documents

Page 2 of 3

Topic

Teaching Period (j )

Learning Outcome determine the effect of adjusting the duration of an activity on the critical path and completion time;

(k) determine the effect of adjusting the number of workers on the critical path and completion time. 17 Inventory Models 16 Candidates should be able to: (a) identify assumptions of the basic economic order quantity model; (b) use the basic economic order quantity model; (c) use the economic order quantity model with planned shortages; (d) find the holding cost and ordering cost; (e) find the reorder point, cycle time and number of orders per year; (f ) determine the minimum total cost order quantity;

(g) determine the minimum total cost per year. 18 Game Theory 16 Candidates should be able to: (a) explain the meaning of a two-person zero-sum game; (b) determine the outcomes for players from a given pay-off matrix; (c) determine play-safe strategies and identify a stable solution; (d) find the expected value of a game; (e) use a dominance argument to reduce a pay-off matrix; (f ) determine optimal mixed strategies for a game with no stable solution;

(g) use a graphical method to solve a game, where appropriate.

Sharing Agent: LRT Documents

Page 3 of 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy