Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
What do you mean by exhaustive search method? What do you understand by saddle print?
solve the following equation by using Big-M method. Minimize z = 4x1 + 3x2
Deduce the optimal solution from Kuhn-Tucker conditions for problem given below. Determine the following using Monte Carlo simulation method.
Write down the name of the methods of random number generation.
Resolve the assignment problem given below by using Hungarian method. Matrix entries are processing times in hours.
Find out the optimum distribution for this company to minimize shipping costs using Vogel’s Approximation method for initial solution.
What is balanced and unbalanced assignment problem?
Write down the different algorithms for solving an Integer Linear programming problem? Describe branch and bound technique in detail.
Describe the role of Operations Research in the decision making.
Properties of Gomery’s cutting plane method and the steps comprised to solve Integer Linear Programming Problem.
List and describe the suppositions of the linear programming problem.
Write down the economic interpretation of the complementary slackness theorem of duality.
Describe the ‘Scope of Operations Research’ in different fields of its application.
What do you mean by deterministic dynamic programming? Describe.
Brief the requirement of sensitivity analysis for the linear programming.
As well write the general mathematical form of the Integer programming problems.
Describe the Acceptance-Rejection Method for the generation of the pseudo-random numbers.
Describe various stages in an Operations Research study. Describe the role of computers in this field.
Explain in brief the different Operations Research methods.
Describe Monte Carlo Simulation. List out some of the differences between Monte Carlo Method and simulation?
By using the backward computational procedure for this Dynamic Programming problem, compute the optimal decision for each possible value of the state variable.
Describe the concept of cycling and degeneracy in the linear programming problems.
Describe the fundamental elements and structure of the Linear Program formulation.
Write brief note on any two of the following: Rules for Network construction, Types of Maintenance and EOQ.
What is degeneracy in transportation problems? When does it creep into the solution?