Posts

Question Bank

Image
  UNIT-I 1. Objective Function 2. Decision Variable 3. Optimal Solution 4. Unbounded Solution 5. No Solution 6. Basic Feasible Solution 7. Degenerate 7. Linear Programming Problem 8. Standard Form of Linear Programming Problem 9. Inter Relationship between Primal and Dual. Essay Questions 1. Solve the following LPP using graphical method          Minimize Z = 20X1 + 10X2.          Subject to Constraints X1 + 2X2   ≤  40                                                       3X1 + X2   ≥ 30                                                       4X1 + 3X2  ≥ 60  and X1, X2  ≥ 0 2. Fi...

Transportation Problems

Image
  Transportation Problems ROW MINIMA METHOD Step 1.  Check whether ∑ a₁ =    ∑ bj. If not introduce a dummy origin or a dummy destination with the transportation cost 0, so that they are equal. Step 2.  Obtain the smallest cost in the first row of the transportation table and let be cij in the cell (i, j). Allocate as much as possible quantity xij = min (ai, bj) in the c (i, j). Step-3 Case (i): If x ij =ai cross off the ith row of the transportation table and decrease bj by bai Then go to next row. Case (ii):  If x ij =bj cross off the jth column of the transportation table and decrease ai by bj, Then go to next row. Case (iii):  If x ij =ai=bj cross off the first row of the transportation table and move down to the  second row. Step-4 Continue the step-2 and step-3 until, all the rim requirements are satisfied.  COLUMN MINIMA METHOD Step 1.  Check whether ∑ a₁ =    ∑ bj. If not introduce a dummy origin or a dummy destination ...

Operations Research

Image
  GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE AND PG COURSES (AUTONOMOUS) Affiliated to Andhra University || Accredited by NAAC and NBA VISAKHAPATNAM DEPARTMENT OF COMPUTER APPLICATIONS (MCA) OPERATIONS RESEARCH SYLLABUS UNIT-I: Overview of Operations Research Types of OR Models - Phases of Operations Research– OR Techniques, Introduction to Linear Programming problem: Formulation of Linear  Programming Problem, Graphical Solution; Standard Form of LPP, Basic Feasible Solutions – Unrestricted Variables, Simplex Algorithm- Artificial Variables -Big M Method- Two Phase Simplex Method-Degeneracy-Alternative Optimal, Unbounded Solutions-Infeasible Solutions, Primal And Dual Problems And Their Relations, Dual Simplex Method. UNIT-II: Transportation Problems: Initial Solutions- Northwest Corner Rule- Lowest Cost Method, Vogel’s Approximation Method- Optimum Solutions of TPP- Degeneracy in Transportation-Transportation Algorithms, Assignment ...