AD8501 Optimization techniques

                                       

Prepared by  
     S.Santhosh (Admin) 
Important questions 
share it a link alone

Don't waste my hardwork and valuable time
Don't share as screenshot kind request

UNIT I

1. GRAPHICAL METHOD
2. SIMPLEX METHOD *
3. BIG M METHOD *
4. TWO PHASE METHOD 

UNIT II
1. BRANCH & BOUND *
2. TRANSPORTATION & ASSIGNMENT PROBLEM *
3. TSP  rare

UNIT III
1. CPM 
2. PERT *

UNIT IV
1. NEWTON RAPHSON**
2. LAGRANGIAN **
3. KUHN TUKER rare 
 
UNIT V
1. MODEL 1 *
2. MODEL 2
3. MODEL 3 *
4. MODEL 4

**Very important questions are bolded and may be asked based on this topic

PART-C

1.Compulsory Questions {a case study where the student will have to read and analyse the subject }
mostly asked from unit 2, 5(OR) a situation given and you have to answer on your own

don't waste my hardwork and valuable time

As Engineer i think you know how to respect another
Share it as link alone . don't share it as screenshot or any text material if u found this anywhere kindly report me . #Admin   WhatsApp

Contact uS for more updates *These questions are expected for the exams This may or may not be asked for exams
    All the best.... from admin Santhosh

          Thanks for your love and support guys keep supporting and share let the Engineers know about Us and leave a comment below for better improvements 
If there is any doubt feel free to ask me I will clear if I can or-else I will say some solutions ..get me through WhatsApp for instant updates                                                      ~$tuff$£ctor
SYllabuS

 UNITI LINEAR MODELS
Introduction of Operations Research mathematical formulation of LPP- Graphical Methods tosolve LPP. Simplex Method- Big M method, Two-Phase method
UNIT II INTEGER PROGRAMMING AND TRANSPORTATION PROBLEMS 
Integer programming: Branch and bound method- Transportation and Assignment problems. Travelling salesman problem.
UNIT III PROJECT SCHEDULING 
Project network -Diagram representation
 Floats Critical path method (CPM) PERT- Cost considerations in PERT and CPM.
UNIT IV CLASSICAL OPTIMISATION THEORY 
Unconstrained problems - necessary and sufficient conditions Newton-Raphson method, Constrained problems - equality constraints - inequality constraints Kuhn-Tucker conditions.
UNIT V QUEUING MODELS
Introduction, Queuing Theory, Operating characteristics of a Queuing Queuing system, Service facility, Queue discipline, Single channel models, multiple service system, Constituents of a channels.

Santhosh (Admin)

TO THE ENGINEER FOR THE ENGINNEER BY AN ENGINEER Kindly join Us on social media's link at the top corner

Post a Comment

Please Select Embedded Mode To Show The Comment System.*

Previous Post Next Post