This action might not be possible to undo. Are you sure you want to continue?

) Assignment Set 1 (60 Marks) 1. Write down the algorithm of the graphical method to solve a L.P.P. Ans: 2. Explain the algorithm for solving a linear programming problem by graphical method. Ans: Linear programming (LP) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear equations. More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a real-valued affine function defined on this polytope, a linear programming method will find a point on the polytope where this function has the smallest (or largest) value if such point exists, by searching through the polytope vertices. An Algorithm for solving a linear programming problem by Graphical Method: (This algorithm can be applied only for problems with two variables). Step I: Formulate the linear programming problem with two variables (if the given problem has more than two variables, then we cannot solve it by graphical method). Step II: Consider a given inequality. Suppose it is in the form a1x1 + a2x2 <= b (or a1x1 + a2x2 >= b). Then consider the relation a1x1+ a2x2= b. Find two distinct points (k, l), (c, d) that lie on the straight line a1x1+ a2x2= b. This can be found easily: If x1= 0, then x2 = b / a2. If x2=0, then x1 = b / a1. Therefore (k, l) = (0, b / a2) and (c, d) = (b / a1, 0) are two points on the straight line a1x1+a2x2= b. Step III: Represent these two points (k, l), (c, d) on the graph which denotes X Y-axis plane. Join these two points and extend this line to get the straight line which represents a1x1+ a2x2= b. Step IV: a1x1 + a2x2= b divides the whole plane into two half planes, which are a1x1+ a2x2 <= b (one side) and a1x1+ a2x2 >= b (another side). Find the half plane that is related to the given inequality. Step V: Do step-II to step-IV for all the inequalities given in the problem. The intersection of the half-planes related to all the inequalities and x1 >= 0, x2 >= 0 , is called the feasible region (or feasible solution space). Now find this feasible region. Step VI: The feasible region is a multisided figure with corner points A, B, C, (say). Find the co-ordinates for all these corner points. These corner points are called as extreme points. Step VII: Find the values of the objective function at all these corner/extreme points. Step VIII: If the problem is a maximization (minimization) problem, then the maximum (minimum) value of z among the values of z at the corner/extreme points of the feasible region is the optimal value of z. If the optimal value exists at the corner/extreme point, say A (u, v), then we say that the solution x1= u and x2= v is an optimal feasible solution. Step IX: Write the conclusion (that include the optimum value of z, and the co-ordinates of the corner point at which the optimum value of z exists). 3. A manufacturing firm has discontinued production of a certain unprofitable product line. This created considerable excess production capacity. Management is considering to devote this excess capacity to one or more of three products: call them product 1, 2 and 3. The available capacity on the machines which might limit output are given below : Machine Type Milling Machine Lathe Grinder Available Time (in machine hours per week) 250 150 50

The number of machine-hours required for each unit of the respective product is given below : Productivity (in Machine hours/Unit) Machine Type Milling Machine Lathe Grinder Product 1 8 4 2 Product 2 2 3 Product 3 3 0 1

The unit profit would be Rs. 20, Rs. 6 and Rs. 8 for products 1, 2 and 3. Find how much of each product the firm should produce in order to maximize profit ? Ans: 4. Determine optimal solution to the problem given below. Obtain the initial solution by VAM. Ans: 5. Explain Project Management (PERT). Write down the differences between PERT and CPM.

total project duration is regarded as a random variable and therefore associated probabilities are calculated so as to characterize it. In addition PERT had the ability to cope with uncertain activity completion times (e. It is an event-oriented network because in the analysis of network emphasis is given an important stages of completion of task rather than the activities required to be performed to reach to a particular event or task. PERT was developed by the US Navy for the planning and control of the Polaris missile program and the emphasis was on completing the program in the shortest possible time. PERT is normally used for projects involving activities of non-repetitive nature in which time estimates are uncertain. 2. PERT: 1.g. for certain activities it may be possible to decrease their completion times by spending more money . Since PERT was developed in connection with an R and D work.how does this affect the overall completion time of the project?) Definition: In CPM activities are shown as a network of precedence relationships using activity-on-node network construction ± Single estimate of activity time ± Deterministic activity times USED IN : Production management . for a particular activity the most likely completion time is 4 weeks but it could be anywhere between 3 weeks and 8 weeks). It helps in pinpointing critical areas in a project so that necessary adjustment can be made to meet the scheduled completion date of the project. Basic difference between PERT and CPM: Though there are no essential differences between PERT and CPM as both of them share in common the determination of a critical path and are based on the network representation of activities and their scheduling that determines the most critical activities to be controlled so as to meet the completion date of the project.Ans: CPM was developed by Du Pont and the emphasis was on the trade-off between the cost of the project and its overall completion time (e.for the jobs of repetitive in nature where the activity time estimates can be predicted with considerable certainty due to the existence of past experience. 3. 2. therefore it had to cope with the uncertainties which are associated with R and D activities. CPM: 1. In PERT. CPM is suitable for establishing a trade-off for optimum balancing between schedule time and cost of the project.g. therefore it is basically deterministic. . Since CPM was developed in connection with a construction project which consisted of routine tasks whose resources requirement and duration was known with certainty. 4.

Project Planning. CPM is used for projects involving activities of repetitive nature.3. 2. Scheduling. . 3. scheduling and controlling. Project Control. Project scheduling by PERT-CPM: It consists of three basic phases: planning. 1.

- MC0079 Comp. Based Opti. Methods
- MC0076 – Management Information Systems
- mc0079
- MC0079 Computer based Optimization Methods
- mc0076
- MC0077 Advanced Database Systems
- MC0077
- smu mca -MC0079
- MC0080
- Mc0079 -1-( me )
- mc0078
- MC0077 – Advanced Database Systems
- MC0079 (1)
- MC0079_Computer Based Optimization Methods
- MC0076 Smu Mca 4th Sem 2012
- MC0080 Analysis and Design of Algorithms
- MC0077 SMU MCA SEM4 2011
- MC0076_Management Information Systems
- MC0077
- mc0080 set 1 july 2011
- Spring 2012 MC0076
- Java sample questions
- MC0078 Java Programming
- MC0077
- MC0078 SET 1 WINTER 2012 SOLVED
- MC0078 – Java Programming
- Master of Computer Application-mc0077
- MC0078
- Mc0077 Solved
- MC0078 Java Programming
- MC0079 – Computer Based Optimization Methods

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd