Preview

Quantitative Methods- Ii

Satisfactory Essays
Open Document
Open Document
274 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Quantitative Methods- Ii
QUANTITATIVE METHODS- II

Module I (6 Hours) Introduction to Operations Research. Definition, scope of Operations Research, characteristics, advantages and limitations. Quantitative approach to decision making, models & modeling in Operations Research.

Module II (8 Hours) Linear programming, Structure of linear program model, Assumption, Advantages, Limitations, General mathematical model, Guidelines for formulation of linear programming model, Graphical method, algorithm (Only illustrative problems) Duality in linear programming..

Module III (8 Hours) Transportation problem, General structure of transportation problem, methods of finding initial basic feasible solution (NWCM,LCM & VAM), test for optimality (MODI Method), degeneracy (theory only), Assignment problems, Introduction, General structure. problems on minimization & maximization

Module IV (8 Hours) Decision theory – decision under uncertainty- Maxmin & Minmax, decision under Risk- Expected Value, decision tree problems. Job Sequencing- N Jobs-two machines and N Jobs-three machines, 2 jobs-M machines cases.

Module V (8 Hours) Theory of games- formulation of game models, Two person Zero sum games & their solution, 2 x N and M x 2 games, pure strategy games with saddle point, Mixed strategies (Graphical and algebraic methods), Limitations of game theory. Module VI (6 Hours) Simulation, process of simulation, types of simulation, steps in simulation process, Monte Carlo simulation, application in queuing, inventory,finance, marketing and HR areas, Advantages & Disadvantages . Module VII (4 Hours) Queuing theory, General structure of queuing system, Operating characteristics of queuing system, Queuing models (Problems on M/M/1) Module VIII (8 Hours) Project management, Structure of projects, phases of project management-planning, scheduling, controlling phase, work break down structure, project control charts, network planning,

PERT & CPM, Network components & precedence relationships,

You May Also Find These Documents Helpful

  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    ECO 550 FINAL EXAM

    • 1177 Words
    • 4 Pages

    9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.…

    • 1177 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Acme

    • 1450 Words
    • 8 Pages

    Linear programming is the “several related mathematical techniques used to allocate limited resources among competing demands in an optimal way” (Jacobs & Chase, 2013, appendix…

    • 1450 Words
    • 8 Pages
    Better Essays
  • Satisfactory Essays

    In the Capacity Management game, students can buy and sell machines at each of the three workstations. They can also change the way Station 2 (the testing station) is scheduled. They can choose first-in-first-out (FIFO), give priority to step 2 or give priority to step 4. The purpose of this assignment is for students to utilize queuing concepts and forecasting methods to manage capacity. This game takes 7 days.…

    • 343 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Mat 540 Quiz 4

    • 1474 Words
    • 6 Pages

    The standard form for the computer solution of a linear programming problem requires all variables to be to the right and all numerical values to be to the left of the inequality or equality sign…

    • 1474 Words
    • 6 Pages
    Satisfactory Essays
  • Powerful Essays

    McLeod Motors LTD

    • 1142 Words
    • 6 Pages

    -----. 1989. A solution to the multiple set-up problem with dynamic demand. IIE Trans. 21(3) 266-270.…

    • 1142 Words
    • 6 Pages
    Powerful Essays
  • Satisfactory Essays

    Mb300 Unit 1

    • 4739 Words
    • 19 Pages

    Welcome to the unit on Operations Research Management. Operations Research Management focuses on the mathematical scoring of consequences of a…

    • 4739 Words
    • 19 Pages
    Satisfactory Essays
  • Good Essays

    Linear programming is one of the most useful types of word problems we learn in Algebra 2. It takes a collection of information and produces the best possible solution. However, each problem is unique. This requires an overall understanding of how to set these up.…

    • 718 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Quantitative Methods

    • 1632 Words
    • 7 Pages

    An inspector correctly identifies defective products 90% of the time. For the next 10 products, the probability that he makes fewer than 2 incorrect inspections is 0.736.…

    • 1632 Words
    • 7 Pages
    Satisfactory Essays
  • Powerful Essays

    4D1 + 2D2 − 30 CP - 3 Chapter 2 Hence, −1D1 + 4D2 ≤ 30 −1D1 + 4D2 ≥ −30 Rewriting the second constraint by multiplying both sides by -1, we obtain −1D1 + 4D2 ≤ 30 1D1 − 4D2 ≤ 30 Adding these two constraints to the linear program formulated in part (2) and resolving using The Management Scientist, we obtain the optimal solution D1 = 96.667, D2…

    • 4205 Words
    • 17 Pages
    Powerful Essays
  • Good Essays

    Linear Optimization

    • 1790 Words
    • 8 Pages

    If the model consists of a linear objective function and linear constraints in decision variables, it is called a linear programming model. Linear programming is a technique used to solve models with linear objective function and linear constraints. The Simplex is used to solve linear programming problems. In this report it shows how to use spreadsheet modeling and Excel Solver for solving linear programming problems.…

    • 1790 Words
    • 8 Pages
    Good Essays
  • Good Essays

    Quantitative Analysis

    • 1777 Words
    • 8 Pages

    11 magnets, 350 users, 4 locations in RAL, Noyes, CLSL NMR Lab tours later in the semester if you ask…

    • 1777 Words
    • 8 Pages
    Good Essays
  • Better Essays

    This paper analyzes a quantitative research report selected because it focuses on enhancing patient education by attention to patient perceptions of the nurse educator. “Quantitative research is the formal, objective, systematic process used to describe variables, test relationships between them, and examine cause and effect interactions among variables” (Burns & Grove, 2007, p. 530). The report being analyzed is titled, “Nurses’ Body Size and Public Confidence in Ability to Provide Health Education” (Hicks, Rouhana, Schmidt, Seymour, & Sullivan, 2008). It replicates a 2006 original study by Wells, Lever, and Austin, listed among its references.…

    • 1843 Words
    • 8 Pages
    Better Essays
  • Powerful Essays

    Let us assume there are m sources supplying n destinations. Source capacities, destinations requirements and costs of material shipping from each source to each destination are given constantly. The transportation problem can be described using following linear programming mathematical model and usually it appears in a transportation tableau.…

    • 2672 Words
    • 11 Pages
    Powerful Essays