Ie412l1 Lab Manual

Laboratory Exercise No 1
Basic Linear Programming

Course Code: Program:
Course Title: Date Performed:
Section: Date Submitted:
Members: Instructor:
1. Objective(s):
The activity aims to formulate linear programming maximization problems using Lindo Software.
2. Intended Learning Outcomes (ILOs):
The students shall be able to:
2.1 identify requirements in solving maximization problems of LP.
2.2 List down the procedures/steps in soling LP maximization problem using Lindo software.
2.3 interpret the results provided by Lindo software.
3. Discussion:
The word “linear” implies direct proportionality of relationship of variable. “Programming” means making
schedules or plans of activities to undertake in the future. “Linear Programming” therefore is planning by
the use of linear relationship of variables involved. It makes use of certain mathematical techniques to get
the best possible solution to a problem involving limited resources.
There are two ways of solving a linear programming problem: By the graphical and by the simplex
method. The graphical method can only be used if the problem has two or three variable, since there are
only two coordinate axis in a plan and three coordinates in space. The simplex method can handle a
problem having any number of variables.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Problem 1: Assume that a small machine shop manufactures two models, standard and deluxe. Each
standard model requires two hours of grinding and four hours of polishing; each deluxe module requires
five hours of grinding and two hours of polishing. The manufacturer has three grinders and two polishers.
Therefore in 40 hours week there are 120 hours of grinding capacity and 80 hours of polishing capacity.
There is a contribution margin of $3 on each standard model and $4 on each deluxe model. To maximize
1
the total contribution margin, the management must decide on: 1.) the allocation of the available production
capacity to standard and deluxe models 2.) the number of units of each model to produce.
Problem 2: (Production allocation problem) Four different typeof metals, namely, iron, copper, zinc and
manganese are required to produce commodities A, B and C. To produce one unit of A, 40kg iron, 30kg
copper, 7kg zinc and 4kg manganese are needed. Similarly, to produce one unit of B, 70kg iron, 14kg
copper and 9kg manganese are needed and for producing one unit of C, 50kg iron, 18kg copper and 8kg
zinc are required. The total available quantities of metals are 1 metric ton iron, 5 quintals copper, 2 quintals
of zinc and manganese each. The profits are Rs 300, Rs 200 and Rs 100 by selling one unit of A, B and C
respectively. Formulate the problem mathematically and solve it using Lindo software.
Procedure:
1. Identify all the given information from the problem.
2. Create a first draft of the LP program by determining its objective function and constraints.
3. Open the Lindo Application
4. Input the objective function and the given constraints in the problem in the worksheet.
5. In order to solve the objective function and constraints click “SOLVE” in the menu bar. The following
figure will appear.
6. Click the “YES” in “Do range (sensitivity) Analysis” dialog box.
7. The solution will be shown in a separate window.
8. Interpret the result.
9. Draw conclusions
6. Data and Results:
2
7. Data Analysis and Conclusion:
8. Assessment (Rubric for Laboratory Performance):
3
T IP - V P A A – 0 5 4 D
R e v is io n S ta tu s /D a te :0 /2 0 0 9 S e p te m b e r 0 9
T E C H N O L O G IC A L IN S T IT U T E O F T H E P H IL IP P IN E S
R U B R IC F O R L A B O R A T O R Y P E R F O R M A N C E
C R IT E R IA B E G IN N E R ACC EPTABLE P R O F IC IE N T SCO RE
1 2 3
L a b o r a to r y S k ills
M a n ip u la tiv e M e m b e rs d o n o t M e m b e r s o c c a s io n a lly M e m b e r s a lw a y s
S k ills d e m o n s tra te n e e d e d d e m o n s tra te n e e d e d d e m o n s tra te n e e d e d
s k ills . s k ills . s k ills .
E x p e r im e n ta l M e m b e r s a r e u n a b le to M e m b e r s a r e a b le t o M e m b e r s a r e a b le to
S e t-u p s e t- u p th e m a t e r ia ls . s e t - u p th e m a t e r ia ls s e t- u p th e m a te r ia l w ith
w ith s u p e r v is io n . m in im u m s u p e r v is io n .
P ro c e s s M e m b e rs d o n o t M e m b e r s o c c a s io n a lly M e m b e r s a lw a y s
S k ills d e m o n s tra te ta rg e te d d e m o n s tra te ta rg e te d d e m o n s tra te ta rg e te d
p r o c e s s s k ills . p r o c e s s s k ills . p r o c e s s s k ills .
S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s fo llo w s a fe ty M e m b e r s f o llo w s a f e t y

P r e c a u t io n s s a f e t y p r e c a u t io n s . p r e c a u t io n s m o s t o f t h e p r e c a u t io n s a t a ll
t im e . t im e s .
W o r k H a b its
T im e M e m b e r s d o n o t fin is h M e m b e r s fin is h o n tim e M e m b e r s f in is h a h e a d
M a n a g e m e n t/ o n tim e w ith in c o m p le t e w it h in c o m p le te d a t a . o f t im e w it h c o m p le t e
C onduct of d a ta . d a t a a n d t im e to r e v is e
E x p e r im e n t d a ta .
C o o p e r a tiv e
M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e rs a re o n ta s k s
and t h e ir ta s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f a n d h a v e
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . t h e t im e . G r o u p r e s p o n s ib ilit ie s a t a ll
G r o u p c o n flic ts h a v e to c o n flic ts a r e t im e s . G r o u p c o n f lic t s
b e s e ttle d b y th e c o o p e r a tiv e ly m a n a g e d a r e c o o p e r a tiv e ly
te a c h e r. Laboratorym o s t oExercise
f t h e t i m e . No 2 m a n a g e d a t a l l t i m e s .
N e a t n e s s a n d M e s s y w o r k p la c e d u r in g C le a n a n d o r d e r ly C le a n a n d o r d e r ly
O r d e r lin e s s
Linear Programming
a n d a fte r th e
- Maximization Problem
w o r k p la c e w ith w o r k p la c e a t a ll t im e s
Course Code: e x p e r im e n t . o c c a s i Program:
o n a l m e s s d u r in g d u r in g a n d a fte r t h e
Course Title: a n d a f tDatee r t h e Performed:e x p e r i m e n t .
Section: e x p e r i mDate e n t . Submitted:
Members: A b i l i t y t o d o M e m b e r s r e q u i r e M e m b e r s r e q u ir e
Instructor: M e m b e rs d o n o t n e e d
in d e p e n d e n t s u p e r v is io n b y th e o c c a s io n a l s u p e r v is io n t o b e s u p e r v is e d b y th e
w o rk te a c h e r. b y th e te a c h e r. te a c h e r.
O th e r C o m m e n ts /O b s e r v a tio n s :
TO TAL SCO RE
R A T IN G =
1. Objective(s):
The activity aims to introduce the basic linear programming including different
x 1 0 0cost
% and non-cost
variables related to manufacturing setting
2.1 Solve basic linear programming particularly maximization problems using Lindo software.
4
3. Discussion:
Linear programming is not a programming language like C++, Java, or Visual Basic. Linear programming
can be defined as: “A mathematical method to allocate scarce resources to competing activities in an
optimal manner when the problem can be expressed using a linear objective function and linear inequality
constraints.”
A linear program consists of a set of variables, a linear objective function indicating the contribution of
each variable to the desired outcome, and a set of linear constraints describing the limits on the values of
the variables. The “answer” to a linear program is a set of values for the problem variables that results in
the best — largest or smallest — value of the objective function and yet is consistent with all the
constraints. Formulation is the process of translating a real-world problem into a linear program. Once a
problem has been formulated as a linear program, a computer program can be used to solve the
problem. In this regard, solving a linear program is relatively easy. The hardest part about applying linear
programming is formulating the problem and interpreting the solution.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Practice Problem 1: A farmer has 10 acres to plant in wheat and rye. He has to plant at least 7 acres.
However, he has only $1200 to spend and each acre of wheat costs $200 to plant and each acre of rye
costs $100 to plant. Moreover, the farmer has to get the planting done in 12 hours and it takes an hour to
plant an acre of wheat and 2 hours to plant an acre of rye. If the profit is $500 per acre of wheat and $300
per acre of rye how many acres of each should be planted to maximize profits?
Practice Problem 2: A gold processor has two sources of gold ore, source A and source B. In order to kep
his plant running, at least three tons of ore must be processed each day. Ore from source A costs $20 per
ton to process, and ore from source B costs $10 per ton to process. Costs must be kept to less than $80
per day. Moreover, Federal Regulations require that the amount of ore from source B cannot exceed twice
the amount of ore from source A. If ore from source A yields 2 oz. of gold per ton, and ore from source B
yields 3 oz. of gold per ton, how many tons of ore from both sources must be processed each day to
maximize the amount of gold extracted subject to the above constraints?
5
3. Open the Lindo Application.
5. In order to solve the objective function and constraints click “SOLVE” in the menu bar
9. Draw conclusions.
6
T IP - V P A A – 0 5 4 D
1 2 3
S e t-u p s e t - u p th e m a t e r ia ls . s e t - u p th e m a t e r ia ls s e t - u p th e m a te r ia l w ith

t im e . t im e s .
W o r k H a b its
M a n a g e m e n t/ o n tim e w ith in c o m p le t e w it h in c o m p le te d a t a . o f t im e w it h c o m p le te
C o o p e r a tiv e M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e rs a r e o n ta s k s
and t h e ir ta s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . t h e tim e . G r o u p r e s p o n s ib ilit ie s a t a ll
te a c h e r. m o s t o f th e tim e . m a n a g e d a t a ll tim e s .
N e a tn e s s a n d M e s s y w o r k p la c e d u r in g C le a n a n d o r d e r ly C le a n a n d o r d e r ly
O r d e r lin e s s a n d a fte r th e w o r k p la c e w ith w o r k p la c e a t a ll t im e s
e x p e r im e n t . o c c a s io n a l m e s s d u r in g d u r in g a n d a fte r t h e
a n d a fte r th e e x p e r im e n t .
e x p e r im e n t.
A b ility to d o M e m b e r s r e q u ir e M e m b e r s r e q u ir e M e m b e rs d o n o t n e e d
O th e r C o m m e n t s /O b s e r v a t io n s :
TO TAL SCO RE
R A T IN G =
x 100%
Linear Programming - Minimization Problem
7
1. Objective(s):
The activity aims to formulate linear programming minimization problems using Lindo Software.
2.4 identify requirements in solving minimization problems of LP.
3. Discussion:
The word “linear” implies direct proportionality of relationship of variable. “Programming” means making
schedules or plans of activities to undertake in the future. “Linear Programming” therefore is planning by
the use of linear relationship of variables involved. It makes use of certain mathematical techniques to get
the best possible solution to a problem involving limited resources.
There are two ways of solving a linear programming problem: By the graphical and by the simplex
method. The graphical method can only be used if the problem has two or three variable, since there are
only two coordinate axis in a plan and three coordinates in space. The simplex method can handle a
problem having any number of variables.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Problem 1: Assume that a pharmaceutical firm is to produce exactly 40 gallons of mixture in which the basic
ingredients, x and y, cost $8 per gallon and $15 per gallon, respectively, No more than 12 gallons of x can
be used, and at least 10 gallons of y must be used. The firm wants to minimize cost.
Problem 2: A patient needs daily 5mg, 20mg and 15mg of vitamins A, B and C respectively. The vitamins
available from a mango are 0.5mg of A, 1mg of B, 1mg of C, that from an orange is 2mg of B, 3mg of C and
that from an apple is 0.5mg of A, 3mg of B, 1mg of C. Ifthe cost of a mango, an orange and an apple be Rs
8
0.50, Rs 0.25 and Rs 0.40respectively, find the minimum cost of buying the fruits so that the
dailyrequirement of the patient be met. Formulate the problem mathematically and solve it using Lindo.
Procedure:
figure will appear.

9
10
T IP -V P A A – 0 5 4 D
C R IT E R IA B E G IN N E R AC C EPTABLE P R O F IC IE N T SCO RE
1 2 3
M a n ip u la t iv e M e m b e rs d o n o t M e m b e r s o c c a s io n a lly M e m b e r s a lw a y s
E x p e r im e n ta l M e m b e r s a r e u n a b le to M e m b e r s a r e a b le to M e m b e r s a r e a b le to
S e t-u p s e t- u p th e m a te r ia ls . s e t- u p th e m a t e r ia ls s e t - u p th e m a t e r ia l w it h
S k ills d e m o n s tra te ta r g e te d d e m o n s tra te ta r g e te d d e m o n s tra te ta rg e te d
S a fe ty M e m b e r s d o n o t f o llo w M e m b e r s f o llo w s a f e t y M e m b e r s fo llo w s a f e ty

P r e c a u t io n s s a f e t y p r e c a u t io n s . p r e c a u t io n s m o s t o f t h e p r e c a u t io n s a t a l l
tim e . t im e s .
W o r k H a b its
T im e M e m b e r s d o n o t f in is h M e m b e r s fin is h o n tim e M e m b e r s fin is h a h e a d
M a n a g e m e n t/ o n t im e w it h in c o m p le t e w it h in c o m p le te d a t a . o f t im e w it h c o m p le te
C onduct of d a ta . d a ta a n d tim e to r e v is e
C o o p e r a tiv e M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e rs a re o n ta s k s
and t h e ir t a s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . th e tim e . G r o u p r e s p o n s ib ilitie s a t a ll
b e s e ttle d b y th e c o o p e r a t iv e ly m a n a g e d a r e c o o p e r a t iv e ly
O r d e r lin e s s a n d a fte r th e w o r k p la c e w it h w o r k p la c e a t a ll tim e s
e x p e r im e n t . o c c a s io n a l m e s s d u r in g d u r in g a n d a f te r th e
e x p e r im e n t.
A b ilit y t o d o M e m b e r s r e q u ir e M e m b e r s r e q u ir e M e m b e rs d o n o t n e e d
O th e r C o m m e n t s /O b s e r v a tio n s :
TOTAL SCO RE
R A T IN G =
x 100%
Laboratory Exercise No. 4

Linear Programming - Simplex Minimization Problem
11
1. Objective(s):
The activity aims to formulate linear programming, simplex minimization problems using Lindo Software.
2.6 identify requirements in solving simplex minimization problems of LP.
3. Discussion:
Although >= and = symbols are occasionally used in constraints of maximization problems, these are more
common among minimization problems. This is how to change these constraints with >= and = symbols to
equations. Subtraction to slack variables is permitted in minimization, but not in maximization, because if
we intend to minimize, it is but logical to subtract, but if we intend to maximize, it is otherwise.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Problem 1: The owner of a shop producing automobile trailers wishes to determine the best mix for his
three products: at-bed trailers, economy trailers, and luxury trailers. His shop is limited to working 24 days
per month on metalworking and 60 days per month on woodworking for these products. The following table
indicates the production data for the trailers.
Problem 2: A small petroleum company owns two refineries. Refinery 1 costs $25,000 per day to operate,
and it can produce 300 barrels of high-grade oil, 200 barrels of medium-grade oil, and 150 barrels of low-
grade oil each day. Refinery 2 is newer and more modern. It costs $30,000 per day to operate, and it can
produce 300 barrels of high-grade oil, 250 barrels of medium-grade oil, and 400 barrels of low-grade oil
each day. The company has orders of 35,000 barrels of high-grade oil, 30,000 barrels of medium-grade oil,
and 40,000 barrels of low-grade oil. How many days should the company run each refinery to minimize its
costs and still meet its orders?
Procedure:
1. Identify the requirements of the problem.
12
2. Create a first draft of the LP program by determining its objective function and constraints
figure will appear.
7. The solution will be shown in a separate window

13
14
T IP - V P A A – 0 5 4 D
R e v is io n S ta tu s / D a te :0 / 2 0 0 9 S e p te m b e r 0 9
C R IT E R IA B E G IN N E R AC C EPTABLE P R O F IC IE N T SCO RE
1 2 3
S e t-u p s e t- u p th e m a te r ia ls . s e t- u p th e m a te r ia ls s e t- u p th e m a te r ia l w ith
S k ills d e m o n s tra te ta rg e te d d e m o n s tra te ta r g e te d d e m o n s tra te ta rg e te d
S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s f o llo w s a f e ty M e m b e r s fo llo w s a fe ty

P r e c a u t io n s s a fe ty p r e c a u tio n s . p r e c a u t io n s m o s t o f t h e p r e c a u t io n s a t a ll
tim e . tim e s .
W o rk H a b its
T im e M e m b e r s d o n o t fin is h M e m b e r s f in is h o n tim e M e m b e r s fin is h a h e a d
M a n a g e m e n t/ o n t im e w it h in c o m p le t e w ith in c o m p le te d a t a . o f tim e w ith c o m p le te
C onduct of d a ta . d a ta a n d tim e to r e v is e
C o o p e r a t iv e M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e rs a re o n ta s k s
and th e ir ta s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . th e t im e . G r o u p r e s p o n s ib ilit ie s a t a ll
G r o u p c o n flic ts h a v e to c o n flic ts a r e tim e s . G r o u p c o n flic ts
b e s e ttle d b y th e c o o p e r a tiv e ly m a n a g e d a r e c o o p e r a t iv e ly
e x p e r im e n t. o c c a s io n a l m e s s d u r in g d u r in g a n d a fte r th e
a n d a fte r th e e x p e r im e n t.
e x p e r im e n t.
in d e p e n d e n t s u p e r v is io n b y th e o c c a s io n a l s u p e r v is io n to b e s u p e r v is e d b y th e
O th e r C o m m e n ts /O b s e r v a tio n s :
TO TAL SCO RE
R A T IN G =
x 100%
Laboratory Exercise No. 5

Linear Programming - Simplex Maximization Problem
15
1. Objective(s):
The activity aims to formulate linear programming simplex maximization problems using Lindo Software.
2.8 identify requirements in solving simplex maximization problems of LP.
3. Discussion:
The simplex method of linear programming was developed by George B. Dantzig of Stanford University. It
is a repetitive optimizing technique. It repeats the process of mathematically moving from an extreme
point (in the graphical method) until an optimal solution is reached. Unlike the graphical, the simplex can
handle infinite number of variables.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Problem 1: An agriculture company has 80 tons of type I fertilizer and 120 tons of type II fertilizer. The
company mixes these fertilizers into two products. Product X requires 2 parts of type I and 1 part of type II
fertilizers. Product Y requires 1 part of type I and 3 parts of type II fertilizers. If each product sells for $2000,
what is the maximum revenue and how many of each product should be made and sold to maximize
revenue?
Problem 2: A company has budgeted a maximum of $600,000 for advertising a certain product nationally.
Each minute of television time costs $60,000 and each one-page newspaper ad costs $15,000. Each
television ad is expected to be viewed by 15 million viewers, and each newspaper ad is expected to be
seen by 3 million readers. The company’s market research department advises the company to use at most
90% of the advertising budget on television ads. How should the advertising budget be allocated to
maximize the total audience?
16
Procedure:
figure will appear.
17
18
T IP - V P A A – 0 5 4 D
1 2 3
S e t-u p s e t- u p th e m a t e r ia ls . s e t - u p th e m a t e r ia ls s e t- u p th e m a te r ia l w ith

t im e . t im e s .
W o r k H a b its
M a n a g e m e n t/ o n tim e w ith in c o m p le t e w it h in c o m p le t e d a t a . o f t im e w it h c o m p le t e
C o o p e r a tiv e M e m b e rs d o n o t k n o w
M e m b e r s h a v e d e fin e d M e m b e rs a r e o n ta s k s
and t h e ir ta s k s a n d h a v e n o
r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s .
t h e tim e . G r o u p r e s p o n s ib ilit ie s a t a ll
G r o u p c o n flic ts h a v e to
c o n flic ts a r e t im e s . G r o u p c o n f lic t s
N e a tn e s s a n d M e s s y w o r k p la c e d u r in g
C le a n a n d o r d e r ly C le a n a n d o r d e r ly
a n d a f t e Exercise
Laboratory r th e No. 6e x p e r i m e n t .
e x p e r im e n t.
Linear Programming – Transportation Problems
Coursei n dCode:
ependent s u p e r v is io n b y th e o c c a s i o n Program:
a l s u p e r v is io n t o b e s u p e r v is e d b y th e
Coursew oTitle:
rk te a c h e r. b y t h e t e Date
a c h e r . Performed: te a c h e r.
Section:
O th e r C o m m e n ts /O b s e r v a tio n s : Date Submitted:
Members: Instructor: TO TAL SCO RE
R A T IN G =
x 100%
1. Objective(s):
The activity aims to formulate linear programming transportation problems using Lindo Software.
2.1 identify requirements in solving transportation problems of LP.
19
3. Discussion:
Transportation problems are concerned with selecting routes from the source of supply to distribution
outlets. The objective is either to minimize cost of trandportation to maximize the contribution to profit.
Repetitive procedures are used in going from one table to another, to come up with an optimum solution.
In the minimization process, the table is said to be optimum if the improvement computations are all
positive; while in the maximization process, the table is said to be optimum if the improvements are all
negative.
4. Resources:
Lindo Software
Textbooks
5. Procedure:
Problem 1: Wheat is harvested in the Midwest and stored in grain elevators in three different cities—
Kansas City, Omaha, and Des Moines. These grain elevators supply three flour mills, located in Chicago,
St. Louis, and Cincinnati. Grain is shipped to the mills in railroad cars, each of which is capable of holding
one ton of wheat. Each grain elevator is able to supply the following number of tons (i.e., railroad cars) of
wheat to the mills on a monthly basis:
Each mill demands the following number of tons of wheat per month.
The cost of transporting one ton of wheat from each grain elevator (source) to each mill (destination) differs
according to the distance and rail system. These costs are shown in the following table. For example, the
cost of shipping one ton of wheat from the grain elevator at Omaha to the mill at Chicago is $7.
The problem is to determine how many tons of wheat to transport from each grain elevator to each mill on a
20
monthly basis in order to minimize the total cost of transportation.
Problem 2: National Foods Company has five plants where it processes and packages fruits and
vegetables. It has suppliers in six cities in California, Texas, Alabama, and Florida. The company has
owned and operated its own trucking system in the past for transporting fruits and vegetables from its
suppliers to its plants. However, it is now considering outsourcing all its shipping to outside trucking firms
and getting rid of its own trucks. It currently spends $245,000 per month to operate its own trucking system.
It has determined monthly shipping costs (in $1,000s per ton) using outside shippers from each of its
suppliers to each of its plants as shown in the following table:
Should National Foods continue to operate its own shipping network or sell its trucks and out- source its
shipping to independent trucking firms?
Procedure:
figure will appear.
21
22
23
T IP - V P A A – 0 5 4 D
R e v is io n S ta tu s / D a t e :0 /2 0 0 9 S e p t e m b e r 0 9
C R IT E R IA B E G IN N E R AC CEPTABLE P R O F IC IE N T SCO RE
1 2 3
S e t-u p s e t - u p th e m a t e r ia ls . s e t - u p th e m a t e r ia ls s e t- u p th e m a te r ia l w ith
w it h s u p e r v is io n . m in im u m s u p e r v is io n .
S k ills d e m o n s tra te ta r g e te d d e m o n s tra te ta rg e te d d e m o n s tra te ta rg e te d
S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s f o llo w s a f e ty M e m b e r s f o llo w s a fe ty

P r e c a u t io n s s a fe ty p r e c a u tio n s . p r e c a u t io n s m o s t o f t h e p r e c a u t io n s a t a ll
tim e . tim e s .
W o r k H a b its
T im e M e m b e r s d o n o t fin is h M e m b e r s f in is h o n t im e M e m b e r s f in is h a h e a d
M a n a g e m e n t/ o n t im e w ith in c o m p le t e w it h in c o m p le te d a ta . o f t im e w ith c o m p le te
C onduct of d a ta . d a ta a n d t im e to r e v is e
C o o p e r a tiv e M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e r s a r e o n ta s k s
and t h e ir t a s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . th e tim e . G r o u p r e s p o n s ib ilit ie s a t a ll
G r o u p c o n f lic ts h a v e t o c o n f lic ts a r e tim e s . G r o u p c o n f lic ts
b e s e t tle d b y th e c o o p e r a tiv e ly m a n a g e d a r e c o o p e r a t iv e ly
te a c h e r. m o s t o f th e t im e . m a n a g e d a t a ll tim e s .
O r d e r lin e s s a n d a fte r th e w o r k p la c e w it h w o r k p la c e a t a ll tim e s
e x p e r im e n t. o c c a s io n a l m e s s d u r in g d u r in g a n d a fte r t h e
a n d a fte r th e e x p e r im e n t.
e x p e r im e n t .
A b ilit y t o d o M e m b e r s r e q u ir e M e m b e r s r e q u ir e M e m b e rs d o n o t n e e d
in d e p e n d e n t s u p e r v is io n b y th e o c c a s io n a l s u p e r v is io n to b e s u p e r v is e d b y th e
TO TAL SCO RE
R A T IN G =
x 100%
Final Project – Case Study Company
24
1. Objective(s):
The activity aims to apply several techniques of Operations Research in an actual operation of an
existing company.
2.2 Analyze the existing operations of the selected company.
2.3 Apply Operations Research tools and techniques to the identified problem(s) or goal(s).
2.4 Apply design of experiment structured methodologies in the chosen study.
2.5 Communicate problems and solutions through written and oral presentation.
3. Discussion:
1. The students will choose a practical problem for their final project. They will be expected in each
case to define a problem, collect data and present recommendations.
2. Students will apply design of experiment structured methodologies in the conduct of the study.
3. Final projects will be presented in written and oral presentations.
4. Prepare a report paper in 15-20 pages double space.
4. Resources:
5. Procedure:
1. Choose a company and select an area of study

2. Identifies problems/goals
3. Collect pertinent data
4. Use appropriate modern tools in Operations Research to solve the identified problems/goals.
5. Discuss in written and oral presentations the detailed measurement of the identified system.
25
T IP - V P A A – 0 5 4 D
1 2 3
S e t-u p s e t - u p th e m a t e r ia ls . s e t - u p th e m a t e r ia ls s e t - u p th e m a te r ia l w ith

t im e . t im e s .
W o r k H a b its
M a n a g e m e n t/ o n tim e w ith in c o m p le t e w it h in c o m p le te d a t a . o f t im e w it h c o m p le te
C o o p e r a tiv e M e m b e rs d o n o t k n o w M e m b e r s h a v e d e fin e d M e m b e rs a r e o n ta s k s
and t h e ir ta s k s a n d h a v e n o r e s p o n s ib ilit ie s m o s t o f and have
T e a m w o rk d e f in e d r e s p o n s ib ilit ie s . t h e tim e . G r o u p r e s p o n s ib ilit ie s a t a ll
e x p e r im e n t.
in d e p e n d e n t s u p e r v is io n b y th e o c c a s io n a l s u p e r v is io n t o b e s u p e r v is e d b y th e 26
TO TAL SCO RE
R A T IN G =
27

Ie412l1 Lab Manual

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ie412l1 Lab Manual

Uploaded by

Copyright:

Available Formats

Laboratory Exercise No 1

Basic Linear Programming

6. Data and Results:

8. Assessment (Rubric for Laboratory Performance):

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s fo llo w s a fe ty M e m b e r s f o llo w s a f e t y

6. Data and Results:

7. Data Analysis and Conclusion:

8. Assessment (Rubric for Laboratory Performance):

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s fo llo w s a fe ty M e m b e r s f o llo w s a f e t y

6. Data and Results:

7. Data Analysis and Conclusion:

S a fe ty M e m b e r s d o n o t f o llo w M e m b e r s f o llo w s a f e t y M e m b e r s fo llo w s a f e ty

Laboratory Exercise No. 4

6. Data and Results:

7. Data Analysis and Conclusion:

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s f o llo w s a f e ty M e m b e r s fo llo w s a fe ty

Laboratory Exercise No. 5

8. Assessment (Rubric for Laboratory Performance):

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s fo llo w s a fe ty M e m b e r s f o llo w s a f e t y

6. Data and Results:

8. Assessment (Rubric for Laboratory Performance):

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s f o llo w s a f e ty M e m b e r s f o llo w s a fe ty

1. Choose a company and select an area of study

6. Data and Results:

7. Data Analysis and Conclusion:

S a fe ty M e m b e r s d o n o t fo llo w M e m b e r s fo llo w s a fe ty M e m b e r s f o llo w s a f e t y

You might also like