50% found this document useful (2 votes)
836 views2 pages

Exercises in POM

The document describes 6 linear programming and network analysis problems to be solved using POM software: 1) A linear programming problem to maximize an objective function subject to constraints. 2) A linear programming problem to minimize an objective function subject to constraints using the Big M method. 3) A transportation problem to obtain the initial basic feasible solution and transportation cost. 4) An assignment problem to assign tasks to operators with given costs. 5) A critical path method (CPM) problem to determine the critical path and total time using a precedence table. 6) A Program Evaluation and Review Technique (PERT) problem to find the critical path and project duration.

Uploaded by

mondalbrojo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
50% found this document useful (2 votes)
836 views2 pages

Exercises in POM

The document describes 6 linear programming and network analysis problems to be solved using POM software: 1) A linear programming problem to maximize an objective function subject to constraints. 2) A linear programming problem to minimize an objective function subject to constraints using the Big M method. 3) A transportation problem to obtain the initial basic feasible solution and transportation cost. 4) An assignment problem to assign tasks to operators with given costs. 5) A critical path method (CPM) problem to determine the critical path and total time using a precedence table. 6) A Program Evaluation and Review Technique (PERT) problem to find the critical path and project duration.

Uploaded by

mondalbrojo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Exercises in POM 1.

Linear Programming Solve the Linear Programming problem through the analytical method using the POM Software. Determine the Optimal solution. What is the value of the objective Function? Maximize Z = 5x1+6x2 Subject to the constraints, 2x1+x2<=2000 X1<=800 X2<=200 Where x1 and x2 >=0 2. Big M Method Solve the following Linear Programming Problem Minimize Z = 3x1+x2 Subject to the constraints 4x1+x2=4 5x1+3x2>=7 3x1+2x2<=6 Where x1, x2>=0 3. Using Linear Programming for solving Transportation Problem The cost of Transportation per unit from three sources and four destinations are given below. Obtain the initial basic feasible solution and the transportation cost using POM software Transportation Model Destination Source 1 2 3 Demand 1 4 3 9 200 2 2 7 4 400 3 7 5 3 300 4 3 8 1 300 Supply 250 450 500 1200

4. Using Linear Programming for solving Assignment Model Assign the four tasks to Four Operators. The assigning costs are given in the below table Assignment Problem Tasks A B C D 5. Critical Path Method A project consists of seven activities. The Precedence relationship of activities and time to complete (in days) are given in table Activity A B C D E F G Immediate Predecessor A A A B C D,E,F Time(in days) 10 7 5 6 5 12 8 1 20 15 40 21 Operators 2 3 28 19 30 31 21 20 28 26 4 13 28 17 12

Determine the Critical Path and the total time taken to complete the project using POM software. 6. PERT For the PERT problem find the critical path and project duration. The customer required time for finishing the project being 30 days. Activity Predecessor Optimistic A B C D E F G H I A A C D B E,F G 2 1 0 1 3 3 1 5 3 Time Most Pessimistic likely 5 14 10 12 0 6 4 7 10 15 5 7 2 3 10 15 6 9

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy