Database Development Process
Goals
Learn how to design database
Steps to design database
Determine the purpose of the database- This helps prepare for the remaining steps.
Find and organize the information required- Gather all of the types of informato
Database Project
The objective of this project is to build a database system from an existing application
that uses simple tables.
The Barkley Brothers Real Estate firm has contracted you and your team to convert the
simple table base system described in
Lecture 11: Transportation Models
what is a transportation problem?
The transportation problem is one of the subclasses of linear
programming problem where the objective is to transport various
quantities of a single homogeneous product that are initially
Lecture 2: Introduction to linear programming
And
Problem formulation& Graphical Method
Definition and Characteristics of Linear Programming
Many applications in business and economics involve a process called optimization, in which
we are required to fin
Lecture 9: Duality In Linear Programming
Introduction
For every LP formulation there exists another unique linear
programming formulation called the 'Dual' (the original
formulation is called the 'Primal').
The Dual formulation can be derived from the s
Lecture 10: Dual Simplex Method
Introduction
The Dual Simplex Method is used in situations where the optimality
criterion (i.e. zj cj 0 in the maximization case ) is satisfied, but the
basic solution is not feasible because under the XB column of the
simp
Lecture 6: Special cases of LPP
The Special cases of Linear Programming Problem are listed below:
Alternate Optimal Solutions.
Degeneracy.
Unboudedness.
Infeasibility.
a) Alternative Optima
When the objective function is parallel to a binding constrai
Lecture 5: Artificial Variable Technique
2-Two Phase Simplex Method
The two phase is used to solve LPPs which contain constraints of types as or =
, by introducing "artificial variable" to start with a basic feasible solution.
Phase I
In this phase, the s
Lecture 3: The simplex method
The graphical method, as discussed in the previous lecture, is capable of solving problems
having a maximum of two variables. The simplex method can solve LP problems with
any number of variable or constraints, the regular si
Lecture 4: Artificial Variable Technique
1-The Big M Method ( Penalty Method )
In the previous lecture we have seen that the Regular Simplex algorithm must
start with a basic feasible solution, to solve LPP problem has an all slack
starting solution. An a
Lecture 1: Introduction to Operational Research
Introduction to Operational Research This teaching module is designed to
be an entertaining and representative introduction to the subject of Operational
Research. It is divided into a number of sections eac