Essay Zone.com - Free essays!
REGISTER NOW!
Login to an existing account
     
GCSE essays
A Level essays
University essays
Forum
Why join?
Essay quality
FAQ

Search forums
About us
Contact us

 

 
Operations research Free essay! Download now

Home > University > Computer science > Operations research

Operations research

You can download this essay for free. All you need to do is register and submit at least one of your essays to us.

Or you can purchase this essay for just $2 instantly without registering

Downloads to date: N/A | Words: 17583 | Submitted: 19-Mar-2012
Spelling accuracy: 96.5% | Number of pages: 150 | Filetype: Word .doc


This is what the first 3 pages of the essay look like

Operations research essay previewOperations research essay previewOperations research essay preview

Description

computer mathamatics

Preview

AIM OF THE SUBJECT:

To provide various mathematical tools for analysis of systems in the Business environment.

To provide techniques which would be needed in analysis of Business Systems to managerial decision-making.

To provide tools to solve complex business problems.

To represent the concepts of “efficiency” and “scarcity in well defined mathematical model of a given situation.

To provide Science Techniques of the derivation of computational methods for solving such models.




DESIGN LENGTH:

THEORY 190: HOURS
LABORATORY 10: HOURS
TOTAL 200: HOURS




















HIGHER NATIONAL DIPLOMA IN INFORMATION TECHNOLOGY

SUBJECT: OPERATIONS RESEARCH

CODE: 710 / 04 /S02

UNIT 1 APPROXIMATIONS

HOURS: 20

OBJECTIVE

At the end of the unit the student should be able to:

Apply given Technologies in estimating solutions in Business environment.

Newton-Raphson iteration method for solving polynomial equations.

Trapezium Rule for approximating a definite integral.

Simpson Rule for approximating a definite integral

Maclaurin Series expansion.























HIGHER NATIONAL DIPLOMA IN INFORMATION TECHNOLOGY

SUBJECT: OPERATIONS RESEARCH

CODE: 710 / 04 /S02

UNIT 2 LINEAR PROGRAMMING

HOURS: 20

OBJECTIVE

To formulate and solve linear programming models using the Graphical and other techniques.

Model formulation.

Solution of L.P model by graphical and simplex method.

Duality and the Dual Simplex method.

Sensitivity Analysis using the Simplex method.

Assignment problem.

Transportation problem.

UNIT 3: NON-LINEAR FUNCTIONS:

HOURS: 20.

OBJECTIVE

To develop an optimization theory using differential calculus to determine maximum and minimum points for Non Linear Functions.

Overview of differentiation and integration.

Continuous functions and partial derivatives.

Necessary and sufficient conditions for extreme points.

The gradient vector

The Hessian matrix



HIGHER NATIONAL DIPLOMA IN INFORMATION TECHNOLOGY

SUBJECT: OPERATIONS RESEARCH

CODE: 710 / 04 /S02

UNIT 4 PROJECT MANAGEMENT WITH PERT/CPM

HOURS: 20

OBJECTIVE
To select a method which is appropriate in a given situation to find the shortest route between two given nodes in a network and determine the route and its length.

Introduction.

The project network diagram.

Critical Path Analysis.

Determination of the critical path.

Project activity crushing.

Probabilistic time duration of activities.

UNIT 5: RANDOM VARIABLES AND THEIR PROBABILITY:

HOURS: 20.

OBJECTIVE
To appreciate the properties of a probability function and be able to apply it in Business environment.

Introduction
Probability density functions (pdf)

Discrete random variables.

Continuous random variables.

Cumulative density functions (CDF)

Relations among probability distributions

Joint probability distributions with two variables


HIGHER NATIONAL DIPLOMA IN INFORMATION TECHNOLOGY

SUBJECT: OPERATIONS RESEARCH

CODE: 710 / 04 /S02

UNIT 6 DECISION THEORY

HOURS: 20

OBJECTIVE

Apply the concept of optimistic approach, conservative approach, and minimax regret approach to decision-making problems.

Decisions under risk

Expected value criterion

Expected profit with perfect information

Minimizing expected loss.

Expected value of perfect information

Decision trees in multistage decision-making

Decisions under uncertainty

Laplace criterion

Minimax/Maximin criterion

Savage Minimax Regret criterion

Hurwicz criterion












UNIT 7: THEORY OF GAMES:

HOURS: 20

OBJECTIVES:

Use analytical criteria for decisions under uncertainty with the assumptions that “nature” is the opponent.

Pure strategy games

Two-Person Zero Sum games

Saddle point solutions

Mixed strategy games

Solution of games by Linear ...

Download this essay in full now!

Just upload at one of your essays to our database and instantly download your selection! Registration takes seconds

Or you can download this essay for $2 immediately without registering


Comments and reviews

Reviews are written by members who have downloaded the essay

No comments yet. If you download the essay you can review it afterwards.