Even though Bechtel is over 100 years old, the Kuwaiti oil fields was its first "project."
Bechtel is the world's premier manager of massive construction and engineering projects.
Bechtel's competitive advantage is supply chain management.
While its projects are worldwide, its network of suppliers is largely in the U.S.
All of the above are true.
Has been established by the Project Management Institute
Has been formulated by the Federal government
Has been formulated by the World Trade Organization
Is inappropriate, since everyone should use the same guidance on ethical issues
Does not exist at this time
Gantt charts give a timeline and precedence relationships for each activity of a project.
Gantt charts use the four standard spines of Methods, Materials, Manpower, and Machinery.
Gantt charts are visual devices that show the duration of activities in a project.
Gantt charts are expensive.
All of the above are true.
The shortest of all paths through the network is the critical path.
Some activities on the critical path may have slack.
Every network has exactly one critical path.
On a specific project, there can be multiple critical paths, all with exactly the same duration.
The duration of the critical path is the average duration of all paths in the project network.
The critical path is A-B-C, duration 15.
The critical path is A-C, duration 12.
The critical path is A-B-C, duration 13.5
The critical path cannot be determined without knowing PERT expected activity times.
The network has no critical path.
The critical path is D-E-F, duration 15.
The critical path is D-F, duration 12.
Slack at D is 3 units
Slack at E is 3 units
Both a and c are true
There are two paths in this network.
There are four paths in this network.
There are five paths in this network.
There are 25 paths through this network.
None of these statements is true.
There can be multiple critical paths on the same project, all with different durations.
The early finish of an activity is the latest early start of all preceding activities.
The late start of an activity is its late finish plus its duration.
If a specific project has multiple critical paths, all of them will have the same duration.
All of the above are true.
The early finish of an activity is the early start of that activity plus its duration.
The late finish is the earliest of the late start times of all successor activities.
The late start of an activity is its late finish less its duration.
The late finish of an activity is the earliest late start of all preceding activities.
The early start of an activity is the latest early finish of all preceding activities.
A-B-D; 10
A-B-E; 11
C-E; 12
A-D-E; 13
A-B-C-D-E; 22
A-D-E; 5
B-E; 6
B-D-E; 7
A-C-E; 10
B-C-E; 12
A-C; 12
A-D-E; 19
B-E; 13
A-B-C-D-E; 29
None of the above
Expected time is an estimate of the time an activity will require if everything goes as planned.
The optimistic time estimate is an estimate of the maximum time an activity will require.
The probable time estimate is calculated as t = (a+4m+b)/6.
Pessimistic time estimate is an estimate of the minimum time an activity will require.
Most likely time estimate is an estimate of the maximum time an activity will require.
1-3, 3-4, 4-5
2-3, 3-4, 4-5
2-3, 3-5
1-4, 4-5
Two of the Above
2X ≥ 7X*Y
2X*7Y≥500
2X+7Y≥100
2X2+7Y≥50
All of the above are valid linear programming constraints.
An objective function, expressed in terms of linear equations
Constraint equations, expressed as linear equations
An objective function, to be maximized or minimized
Alternative courses of action
For each decision variable, there must be one constraint or resource limit
Constraint
Slack variable
Objective function
Violation of linearity
Decision variable
Can be used to help solve a profit maximizing linear programming problem
Is parallel to all other iso-profit lines in the same problem
Is a line with the same profit at all points
None of the above
All of the above
X+Y>15andX–Y
X+Y>5andX>10
X>10andY>20
X+Y>100andX+Y
All of the above have a feasible region.
Finding the value of the objective function at the origin
Moving the iso-profit line to the highest level that still touches some part of the feasible regio
Moving the iso-profit line to the lowest level that still touches some part of the feasible region
Finding the coordinates at each corner of the feasible solution space
None of the above
X+Y>100andX+Y
X+Y>15andX–Y
X+Y5
X
All of the above have a bounded maximum.
Area of optimal solutions
Area of feasible solutions
Profit maximization space
Region of optimality
Region of non-negativity
X = 2, y = 1
X = 1, y = 5
X = -1, y = 1
X = 4, y = 4
X = 2, y = 8
X = -1, y = 1
X = 0, y = 4
X = 2, y = 1
X = 5, y = 1
X = 2, y = 0
X = 2, y = 0
X = 0, y = 3
X = 0, y = 0
X = 1, y = 5
None of the above