Construction Project Management

(CE 110401346)

6b. Construction Process

Optimization
Dr. Khaled Hyari
Department of Civil Engineering
Hashemite University

Linear Programming

Simplest and most widely used method of

optimization method.

Requires all mathematical functions in the

model to be linear.

General Form:

Maximize an objective function of:

Z= c1x1+c2x2+.+cnxn
2

 Linear Programming

Subject to the constraints of:

a11 x1+a12 x2..+a1n xn b1

a21 x1+a22 x2..+a2n xn b2

am1 x1+am2 x2..+amn xn bm

3

Linear Programming

More efficient form of a linear programming

model
Maximize

Subject to:

where i= 1,2,3, ..,m

and j= 1,2,3, ..,n
4

 Linear Programming Steps

Step 1: Formulating an Optimization Model

a. Identify the decision variables (X1, X2, .Xn) by
asking:
What are we trying to decide on or find out?
Example of decision variable:
Number of units to be produced, purchased, or
transported.
b. Develop a mathematical expression that
represents the objective function by asking:
What are we trying to achieve?
Examples of an Objective Function:
maximize income, profit, etc,
5

Linear Programming Steps II

c. Develop a mathematical expression that

represents the constraints of the problem by
asking:
What are the constraints imposed on the
problem?
Examples of constraints:
Limited resources such as money, material,
labor, equipment, etc.

 Linear Programming Steps

Linear Programming Steps

Maximize Z = 13 X1 + 11X2
Subject to
4X1+ 5X2 1500
5X1+ 3X2 1575
X1/60 + X2/30 7

 Linear Programming Steps

Step 2: Finding the Optimum Solution

Available Software
Simplex Algorithm

Example No. 2

WyndorGlass Co. makes two products: (i) doors,

and (ii) glass windows.
They have three plants. Producing a batch of doors
requires resources from multiple plants. Similarly,
producing a batch of windows requires resources
from multiple plants.
The profit per batch of doors is $5,000 and profit per
batch of windows is $3000.
Wyndor wants to decide the number of batches of
each product per week to maximize its profit
10

Example No. 2 (II)

11

Example No. 2 (III)

12