Scribd
Upload
125 views3 pages

BCA-4004 Optimization Techniques Notes

The document outlines detailed notes on Optimization Techniques, covering five main units: Linear Programming, Game Theory, Replacement Theory, PERT and CPM, and Job Sequencing. Each unit discusses key concepts, methods, and applications relevant to optimizing various problems in fields like economics and project management. The notes include techniques such as the Simplex Method, Maximin and Minimax principles, and Johnson's Rule for effective decision-making and resource allocation.

Uploaded by

Aryan Gupta
Copyright
© © All Rights Reserved
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
125 views3 pages

BCA-4004 Optimization Techniques Notes

The document outlines detailed notes on Optimization Techniques, covering five main units: Linear Programming, Game Theory, Replacement Theory, PERT and CPM, and Job Sequencing. Each unit discusses key concepts, methods, and applications relevant to optimizing various problems in fields like economics and project management. The notes include techniques such as the Simplex Method, Maximin and Minimax principles, and Johnson's Rule for effective decision-making and resource allocation.

Uploaded by

Aryan Gupta
Copyright
© © All Rights Reserved
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/ 3

BCA-4004: Optimization Techniques - Detailed Notes

UNIT I: Linear Programming

Linear Programming (LP) deals with optimizing a linear objective function subject to linear equality

and inequality constraints.

Topics:

- Introduction: Optimization problems, applications in economics, engineering, logistics.

- Formulation: Converting word problems into LP models (objective function, constraints,

non-negativity).

- Graphical Method: Solving 2-variable problems with feasible region, corner points, and optimal

solution.

- Simplex Method: A tabular method for solving LP problems with more than two variables.

* Slack, surplus, and artificial variables

* Iterative pivoting process to reach optimal solution

- Duality: Every LP problem (Primal) has a corresponding Dual; useful for sensitivity analysis.

- Transportation Problem:

* Methods: North-West Corner Rule, Least Cost Method, Vogel's Approximation

* Optimality test: MODI method

- Assignment Problem: Solved using Hungarian method, suitable for 1:1 job-machine assignments.

UNIT II: Game Theory

Game Theory is the study of strategic interaction between rational decision-makers.

Topics:
- Two-Person Zero-Sum Game: A scenario where one player's gain is another's loss.

- Payoff Matrix: Represents the gain/loss based on strategies.

- Pure Strategies: Players stick to one strategy; solved using Maximin and Minimax principles.

- Mixed Strategies: Used when no saddle point exists; players randomize over strategies.

- Dominance Principle: Eliminating dominated strategies to simplify matrix.

- Graphical Method: Used for 2×n or m×2 games; plotting expected payoffs to find optimal mixed

strategy.

UNIT III: Replacement Theory

Replacement models help determine the optimal time to replace equipment/assets to minimize cost.

Topics:

- Replacement of Deteriorating Items: Items that decrease in efficiency over time (e.g., machines).

- Replacement of Failed Items: Sudden failures (e.g., bulbs).

- Group vs Individual Replacement:

* Group: Replace items at fixed intervals, irrespective of condition.

* Individual: Replace upon failure.

- Cost Comparison: Determine optimal replacement policy by comparing costs.

UNIT IV: PERT and CPM

Project Management tools used to plan, schedule and control complex projects.

Topics:

- PERT (Program Evaluation and Review Technique):

* Used for uncertain activity times.

* Estimates: Optimistic, Pessimistic, Most Likely.


* Expected time = (O + 4M + P) / 6

- CPM (Critical Path Method):

* Used for predictable project durations.

* Critical Path: Longest duration path in the network.

- Network Diagram: Represents activities (arrows) and events (nodes).

- Slack Time: Time by which an activity can be delayed without affecting the project.

- Project Evaluation: Find earliest and latest start and finish times.

UNIT V: Job Sequencing

Job Sequencing is the process of determining the best order to process jobs to optimize criteria like

time or cost.

Topics:

- Job Sequencing Problem: n jobs on 2 or 3 machines.

- Johnson's Rule:

* For 2-machine problems: Sequence jobs based on min processing time.

* For 3-machine problems: Reduce to 2-machine problem using fictitious machines.

- Gantt Chart: Graphical representation of job sequences over time.

- Optimization Goals: Minimize makespan, idle time.

You might also like