MCA-204 Computer Oriented Optimization Techniques

[vc_row][vc_column width=”2/3″][vc_column_text]

MCA-204 Computer Oriented Optimization Techniques !

Introduction: The Historical development, Nature, Meaning and Management Application of Operational research. Modeling, Its Principal and Approximation of O.R. Models, Main characteristics and phases, General Methods of solving models, Scientific Methods, Scope, Role on Decision Making and Development of Operation Research in India.

Linear Programming : Formulation, Graphical solution, standard and matrix form of linear programming problems, Simplex method and its flow chart, Two-phase Simplex method, Degeneracy.

Duality : Definition of Dual Problem, General Rules for converting any Primal into its Dual Simplex method and its flow chart.

Integer Programming : Importance, Application and Classification, Gomory’s all integer programming problem technique and its flow chart, Branch and Bound Method.

Assignment Models : Formulation of problem, Hungarian Method for Assignment Problem, Unbalanced Assignment Problems.

Queuing Models : Introduction, Applications, Characteristics, Waiting and Ideal time costs, Transient and steady states, Kendall’s Notations, M/M/1, M/M/C. M/Ek/1 and Deterministic Models ( No Mathematical derivation included).

PERT and CPM : Basic steps in PERT/CPM, Techniques, Network Diagram Representation, Forward and Backward Pass-computation, Representation in Tabular form, Determination of Critical path, Critical activity, Difference between CPM and Pert, Floats and Slack Times.

[/vc_column_text][/vc_column][vc_column width=”1/3″][vc_wp_custommenu nav_menu=”160″][/vc_column][/vc_row]

Leave a Reply

Your email address will not be published. Required fields are marked *