Tutorials
Examples
Tests

# BCA Semester-IVth - Optimization Techniques Syllabus

Here you will find the syllabus of fourth subject in BCA Semester-IVth, which is Optimization Techniques.

Important - The syllabus may vary from college to college.

## Optimization Techniques Units

This course/subject is divided into total of 5 units as given below:

1. Linear Programming
2. Queuing Theory
3. Replacement Theory
4. Inventory Theory
5. Job Sequencing

Now let's expand the above listed units with its syllabus.

## Unit-I Syllabus - Linear Programming

Here are the list of topics that comes under the syllabus of unit-I, that is linear programming:

• Central Problem of linear Programming
• Various definitions including Statements of basic theorem and also their properties
• Simplex methods
• Primal and dual simplex method
• Transport problem
• Tic-Tac problem and its solution
• Assignment problem and its solution
• Graphical Method Formulation
• Linear Programming Problem

## Unit-II Syllabus - Queuing Theory

Here are the list of topics that comes under the syllabus of unit-II, that is queuing theory:

• Characteristics of queuing system
• Classification of Queuing Model Single Channel Queuing Theory
• Generalization of steady state M/M/1 queuing models (Model-I, Model-II)

## Unit-III Syllabus - Replacement Theory

Here are the list of topics that comes under the syllabus of unit-III, that is replacement theory:

• Replacement of item that deteriorates replacement of items that fail
• Group replacement and individual replacement

## Unit-IV Syllabus - Inventory Theory

Here are the list of topics that comes under the syllabus of unit-IV, that is inventory theory:

• Cost involved in inventory problem
• Single item deterministic model economics
• Long size model without shortage and with shortage
• Having production rate infinite and finite

## Unit-V Syllabus - Job Sequencing

Here are the list of topics that comes under the syllabus of unit-V, that is job sequencing:

• Introduction
• Solution of sequencing problem
• Johnson's algorithm for n jobs through 2 machines

« Previous Course Next Course »