1. Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
ASSIGNMENT
Course Code : MS - 51
Course Title : Operations Research
Assignment Code : MS-51/TMA/SEM - I /2014
Coverage : All Blocks
Note : Attempt all the questions and submit this assignment on or before 30th
April, 2014
to the coordinator of your study center.
1. Explain computational aspect of simplex method for solving Linear Programming
Problems (LPP). Take a problem and apply M- method for solving the LPP.
Answer : Simplex method is one of the techniques to solve linear programming
problem. Decision making is the most important aspect of any business or industry.
Standard Form of Linear Programming
The main reason for using linear programming is to achieve the best allocation of some
company resources. The allocation process involves assigning resources like manpower,
money, machines, material etc., to specific activities in order to optimize the objectives.
Linear programming helps in attaining the
2. Five employees of a company are to be assigned to five jobs, which can be done by
any of them. The workers get different wages per hour. These are: Rs 5 per hour for A,
B, and C each, and Rs 3 per hour for D and E each. The amount of time taken by each
employee to do a given job is given in the following table. Determine the assignment
pattern that (a) minimizes the total time taken, and (b) minimizes the total cost, of
getting five units of work done.

2. Answer : Step 1: The given matrix is a square matrix and it is not necessary to add a dummy
row/coloumn.
Step2: Reduce the matrix by selecting the smallest value in each row and subtracting from
other values in that corresponding row. The
3. What is the importance of integer programming models in supporting managerial
decisions? Describe the rationale behind Cutting Plane Method used for solving integer
programming models.
Answer : Integer Programming
A linear programming problem in which all or some of the decision variables are constraint
to assume non-negative integer values is called an integer programming problem. In
integer programming some of the decision variables are required to take on integer values.
An Integer Linear Programming Model, or Integer Optimization Model (notation: ILP-
model) is a linear programming
4 . (a) Minicomputer Company purchases a component for which it has a steady usage of
1,000 units per year. The ordering cost is Rs. 50 per order. The estimated cost of money
invested in inventory is 25 per cent per year. The unit cost of the component is Rs 40.
Calculate the optimal ordering policy and total cost of the inventory system, including
purchase cost of the components.
(b) If, in this, the component supplier agrees to offer price discounts of minimum lot
supplies as per schedule given, reassess the decision on the optimal ordering policy
and the total cost as before.
Lot size (Units) Price per unit
Up to 149 Rs. 40
150-499 Rs. 39
500 or more Rs. 38
Solution:
(a) Here Demand
Ordering cost

3. 5. Explain why simulation may be the only method in situations where it will be
extremely difficult to observe actual environment.
Answer : In certain cases, it might not be possible to formulate the entire problem or solve
it through mathematical models. In such cases, simulation proves to be the most suitable
method, which offers a near-optimal solution. Simulation is a reflection of a real system,
representing the characteristics and behaviour within a given set of conditions. In
simulation, the problem must be defined first. Secondly, the variables of the model are
introduced with logical relationship among
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )