You can keep up to 10 CVs here -- delete one you don't need.
You can keep up to 10 CVs here -- delete one you don't need.

Optimization Techniques

BCA · Semester 4 — Linear programming, simplex method, transportation and assignment problems, game theory and queuing.

6 महीनेअवधि 1Subject 5Chapters ऑनलाइनTests & result

Your roadmap · आपका रोडमैप

  1. 1
    Admission & first meetingप्रवेश और पहली मुलाकात

    Enquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.

  2. 2
    Part 1 of the syllabusपाठ्यक्रम भाग 1

    Unit-wise coaching with notes and doubt classes.

    Unit 1: Linear Programming and Graphical MethodUnit 2: Simplex Method and DualityUnit 3: Transportation Problem
  3. 3
    Part 2 of the syllabusपाठ्यक्रम भाग 2

    Unit-wise coaching with notes and doubt classes.

    Unit 4: Assignment ProblemUnit 5: Game Theory and Queuing
  4. 4
    Unit tests & assignmentsयूनिट टेस्ट

    Regular tests in the university / board pattern.

  5. 5
    Semester 4 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षा

    Previous papers and full revision before the exam.

  6. 6
    Online tests & resultऑनलाइन टेस्ट और रिज़ल्ट

    Take the tests online; your marks and result show in your student login and at the centre.

सिलेबस · पाठ्यक्रम

1 subject · 5 chapters · 24 topics

01Unit 1: Linear Programming and Graphical Method 5 टॉपिक
  1. Introduction to operations research
  2. Formulation of LPP
  3. Graphical method
  4. Feasible region and corner-point solution
  5. Special cases - unbounded, infeasible, multiple optima
02Unit 2: Simplex Method and Duality 4 टॉपिक
  1. Standard form - slack and surplus variables
  2. Simplex algorithm
  3. Big-M method and artificial variables
  4. Duality in LPP
03Unit 3: Transportation Problem 6 टॉपिक
  1. Balanced and unbalanced problems
  2. North-West Corner rule
  3. Least cost method
  4. Vogel's approximation method
  5. MODI method for optimality
  6. Degeneracy
04Unit 4: Assignment Problem 4 टॉपिक
  1. Formulation
  2. Hungarian method
  3. Unbalanced and maximisation problems
  4. Travelling salesman problem basics
05Unit 5: Game Theory and Queuing 5 टॉपिक
  1. Two-person zero-sum games
  2. Saddle point - maximin and minimax
  3. Mixed strategies and dominance
  4. Queuing system characteristics
  5. M/M/1 model

About this course

आप यह कर पाएँगे

  • Formulate linear programming problems and solve two-variable LPPs graphically
  • Solve LPPs by the simplex method, including Big-M, and write the dual
  • Find initial and optimal solutions of transportation problems
  • Solve assignment problems by the Hungarian method
  • Solve two-person zero-sum games using saddle points and mixed strategies
  • Compute basic performance measures of an M/M/1 queue

यह किसके लिए है

  • BCA students of Semester 4 (UP state universities, Lucknow University pattern)
  • Students interested in operations research and analytics

आपको क्या चाहिए

  • Mathematics-I and Mathematics-II (matrices, linear equations)
Online tests & result Practice and unit tests online; marks and result show in your student login and at the centre. Student login →

सवाल

Which syllabus does this Optimization Techniques course follow?

It follows the common UP state university BCA syllabus (University of Lucknow pattern) for BCA Semester 4. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.

Is this subject only numericals?

Mostly. Every unit has standard problem types; the trainer drills each method with table-by-table solutions.

Can software be used?

For understanding, yes - Excel Solver or TORA can verify answers, but the exam requires hand working.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? अभी पूछताछ करें — our centre will call you.