First Operations Investigation 2
Uploaded by
ScribdTranslationsFirst Operations Investigation 2
Uploaded by
ScribdTranslationsAutonomous University Corporation of Cauca
Faculty of Systems Engineering
First Operations Research
Teacher: José Vicente Vásquez P.
Presented by:
Felix Camargo
Andrés Giovanni Lara Collazos
Popayan, September 2012
1) Model the following Integer Linear Programming problems and
find the optimal solution using WIN QSB
1.1) Wayne Winston; Problem 6, page 503
To graduate from Basketweavers University with a major in Operations Research, a student must
complete at least two mathematics courses, at least two operations research courses, and at least two
computer skills courses.
Some courses may serve to fulfill more than one requirement: Calculus may serve the Mathematics
requirement; Operations Research, serves the Mathematics and Operations Research requirements;
information structures serves the requirements of computer skills and mathematics; statistics for
business, covers the requirements of Mathematics and Operations Research; Computer Simulation is
for Operations Research and Computer Management requirements: Introduction to Computer
Programming, for the Computing and Forecasting requirement, for Operations Research and
Mathematics.
Some courses are prerequisites for others: Calculus is a prerequisite for Statistics for Business,
Introduction to Computer Programming, Computer Simulation, and Information Structures; Business
statistics is a prerequisite for Forecasting.
Plan a PE that minimizes the number of courses necessary to satisfy the requirements of the specialty.
Solution
Organization of subjects
Math Operations research Computer handling
Calculation Operations research Information structures
Operations research business statistics computer simulation
Information structures Computer simulation Introduction to programming
business statistics Forecasts
Forecasts
variable name Subject Requirement
x1 Calculation
x2 business statistics (X1) Calculation
X3 Introduction to programming
x4 Computer simulation (X3) Introduction to programming
X5 Information structures (X3) Introduction to programming
X6 Forecasts (X2) Business statistics
X7 Operations research
Decision variable
1 If you take the class
Xi
0 If you don't take the class
Minimize
X1 + X2 + X3 + X4 + X5 + X6 + X7
Restrictions
X1 + X7 + X5 + X2 + X6 ≥ 2
X7 + X2 + X4 + X6 ≥ 2
X5 + X4 + X3 ≥ 2
X2 ≤ X1
X4 ≤ X3
X5 ≤ X3
X6 ≤ X2
WinQSB
OBJ/Constraint/Bound
Maximize X1+X2+X3+X4+X5+X6+X7
CL X1+X7+X5+X2+X6>=2
C2 X7+X2+X4+X6>=2
C3 X5+X4+X3>=2
C4 X2<=X1
C5 X2<= X3
C6 X2<=X3
C7 X2<=X2
Integer:
Binary: X1, X2, X3, X4, X5, X6, X7
Unrestricted:
x1 >=0, <=1
x2 >=0, <=1
X3 >=0, <=1
x4 >=0, <=1
X5 >=0, <=1
X6 >=0, <=1
X7 >=0, <=1
1.2) Wayne Winston; Problem 35, page 508
An electric power generation plant has three boilers. If a given boiler is in operation, it is possible to
use it to generate a certain amount of steam (in tons) between the minimum and maximum given in
table 34. The cost of production of one ton of steam in each boiler is also provided. The steam from
the boilers is used to generate electrical energy in the three turbines.
If they operate, each turbine processes an amount of steam (in tons) between the minimum and
maximum given in table 35. The cost of processing one ton of steam and the energy produced by each
turbine is also provided.
Pose a PE with which the cost of producing 8000 kwh of electrical energy can be minimized.
Table 34
Boiler Minimum steam Maximum steam Cost / Ton (DLL)
1 500 1000 10
2 300 900 8
3 400 800 6
Table 35
Turbine Minimum steam Maximum steam kWh per ton of
steam Cost / Ton (DLL)
1 300 600 4 2
2 500 800 5 3
3 600 900 6 4
Solution
Boiler 1 and turbine 1 analysis graph
Boiler 2 and turbine 2 analysis graph
Boiler 3 and turbine 3 analysis graph
Decision variable
Xi = Amount of steam produced i = 1, 2, 3
Minimize
12 X1 + 11 X2 + 10 X3
Restrictions
X1 ≥ 500
X1 ≤ 600
X2 ≥ 500
X2 ≤ 800
X2 ≥ 600
X2 ≤ 800
4X1 + 5 X2 + 6 X3 = 8000
WinQSB
OBJ/Constraint/Bound
Minimize 12X1+11X2+10X3
CL XI>=500
C2 XI<=600
C5 X2>=500
C6 X2<=800
C9 X3>=600
CIO X3<=800
C13 4X1 +5X2+6X3>=8000
Integer: X1,X2,X3
Binary:
Unrestricted:
XI >=0, <=M
x2 >=0, <=M
X3 >=0 r <=M
It is unfeasible
2) Use WIN QSB To find the optimal solution to problem 2 posed
in class. Attach all the answers given by the program to this
resolved workshop
A paper manufacturing company must determine the best cutting pattern scheme for 60-inch-wide rolls
to meet weekly demand for smaller rolls. The weekly order:
Rolls type Amount
28 inches 30
20 inches 60
15 inches 18
Any leftover roll less than 15 inches wide is considered waste.
Develop a model to determine how the streams should be cut to meet demand and obtain the least
possible waste. Assume that a sufficient number of streams 60 inches wide are available.
Integer Linear Programming Model
Minimize
4 X1 + 0 X2 + 0X3 + 5X4 + 12 X5 + 2X6 + 10 X7
Restrictions
2 X1 + X5 + X6 ≥ 30
3 X3 + 2 X4 + X5 + X7 ≥ 60
4 X2 + X4 + 2 X6 + 2 X7 ≥ 18
Win QSB
3) Use the graphical method (isocost line “isoutility”) to find the
optimal solution to the following Integer Linear Programming
model.
Minimize
2 X1 + 3 X2
Restrictions
2 X1 + 0 X2 ≤ 5
3 X1 – 5 X2 ≤ 0
2 X1 - X2 + ≥ 1
X1 ≥ 0 X2 ≥ 0
X1 and X2
integers
Fo = 2 X1 + 3 X2 m = 2/-3
x1 x2 FO
2 1 7
2 0 4
1 0 2 (Optimal Solution)
The optimal solution is: 2, because it is the Minor Fo.
This work is licensed under a Creative Commons license, its use is free (Copy, modification and redistribution); as long as the
author is named (Andrés Giovanni Lara Collazos and Felix Camargo). For more information visit:
http://co.creativecommons.org/
“Knowledge is free, share it”
