cee 201 exam 2

What is the primary purpose of using the Grand Objective Approach (GOA) in multi-objective

optimization?

• A. To convert a single-objective optimization problem into a multi-objective optimization

problem.

• B. To reduce the dimensionality of a multi-objective optimization problem.

• C. To combine multiple objectives into a single composite objective function for easier

optimization.

• D. To solve multiple objective functions independently.

Correct Answer: C

In the Grand Objective Approach, the composite objective function F(x) is typically formulated as:

• A. The sum of the objectives without any weights.

• B. The product of all the objectives.

• C. A weighted sum of the multiple objectives.

• D. The difference between the highest and lowest objective values.

C. A weighted sum of the multiple objectives.

Which of the following is an advantage of using the Grand Objective Approach in multi-objective

optimization?

• A. It provides a single, easy-to-interpret solution.

• B. It eliminates the need for decision-makers to provide preferences or weights.

• C. It guarantees finding the global optimum for all objectives.

• D. It requires no consideration of trade-offs between conflicting objectives.

A. It provides a single, easy-to-interpret solution.

When constructing a Grand Objective function, how are the weights typically chosen?

• A. They are selected randomly to ensure diversity in solutions.

• B. They are chosen to reflect the relative importance of each objective.

• C. They are fixed at equal values for all objectives.

• D. They are automatically generated by the optimization algorithm.

Correct Answer: B

In a multi-objective optimization problem involving minimizing both cost and environmental impact,

how would the Grand Objective function typically be formulated?

• A. By taking the square root of the sum of the cost and environmental impact.

• B. By adding the cost and environmental impact without any further modification.

• C. By multiplying the cost by the environmental impact.

• D. By creating a weighted sum of cost and environmental impact.

D. By creating a weighted sum of cost and environmental impact.

Which of the following statements is true about the solutions obtained using the Grand Objective

Approach?

• A. They always lie on the Pareto front.

• B. They represent a compromise solution that reflects the assigned weights.

• C. They eliminate the need for Pareto dominance analysis.

• D. They are always superior to those obtained through other multi-objective optimization

methods.

B. They represent a compromise solution that reflects the assigned weights

In a two-objective optimization problem, the Grand Objective function is formulated as

F(x)=0.4Z1(x)+0.6Z2(x). Which of the following is true about this formulation?

• A. Objective Z1(x) is considered more important than Z2(x).

• B. Both objectives are equally important.

• C. Objective Z2(x) is considered more important than Z1(x).

• D. This formulation implies that Z1(x) and Z2(x) are unrelated.

C. Objective Z2(x) is considered more important than Z1(x).

Which of the following is a potential drawback of using the Grand Objective Approach in multi-

objective optimization?

• A. It simplifies the problem to a single-objective optimization problem.

• B. It may require subjective assignment of weights to different objectives.

• C. It eliminates the need for complex optimization algorithms.

• D. It always guarantees finding all Pareto-optimal solutions.

B. It may require subjective assignment of weights to different objectives.

What is typically required before formulating a Grand Objective function in a multi-objective

optimization problem?

• A. A precise measurement of each objective's global optimum.

• B. The normalization of the objectives to ensure comparability.

• C. The elimination of constraints from the problem.

• D. The maximization of each objective function individually.

B. The normalization of the objectives to ensure comparability.

In the Grand Objective Approach, if all objectives are conflicting, what is the primary challenge that

must be addressed?

• A. Ensuring that all objectives are minimized simultaneously.

• B. Balancing the trade-offs between objectives by selecting appropriate weights.

• C. Maximizing all objectives simultaneously.

• D. Converting the problem back to a single-objective optimization problem without

considering trade-offs.

B. Balancing the trade-offs between objectives by selecting appropriate weights.

What is a Pareto-optimal solution in the context of multi-objective optimization?

• A. A solution where all objectives are simultaneously optimized to their maximum values.

• B. A solution that cannot be improved in one objective without degrading another.

• C. A solution that minimizes the weighted sum of all objectives.

• D. A solution that dominates all other possible solutions.

B. A solution that cannot be improved in one objective without degrading another.

In multi-objective optimization, what does the term "dominated solution" refer to?

• A. A solution that is superior in all objectives compared to another solution.

• B. A solution that is worse in all objectives compared to another solution.

• C. A solution that lies on the Pareto front.

• D. A solution that minimizes the sum of all objective functions.

B. A solution that is worse in all objectives compared to another solution

Which of the following best describes the Pareto front in multi-objective optimization?

• A. The set of all feasible solutions in the problem space.

• B. The set of solutions that minimize a single objective function.

• C. The set of non-dominated solutions representing trade-offs between objectives.

• D. The set of solutions that maximize all objectives simultaneously.

The set of non-dominated solutions representing trade-offs between objectives.

What is meant by the term "conflicting objectives" in a multi-objective optimization problem?

• A. Objectives that cannot be optimized simultaneously because improvement in one leads to

deterioration in another.

• B. Objectives that are equally weighted in the optimization process.

• C. Objectives that have the same optimal solution.

• D. Objectives that can be optimized independently without any trade-offs.

A. Objectives that cannot be optimized simultaneously because improvement in one leads to

deterioration in another.

What does the term "Pareto dominance" mean in multi-objective optimization?

• A. A solution dominates another if it is better in at least one objective and no worse in others.

• B. A solution dominates another if it minimizes the sum of all objectives.

• C. A solution dominates another if it has the highest value in every objective.

• D. A solution dominates another if it is the global optimum for at least one objective.

A. A solution dominates another if it is better in at least one objective and no worse in others.

n a multiple-objective optimization problem, what does an "inferior solution" refer to?

• A. A solution that is Pareto-optimal.

• B. A solution that is dominated by at least one other solution.

• C. A solution that lies on the Pareto front.

• D. A solution that optimizes all objectives simultaneously

B. A solution that is dominated by at least one other solution.

Which of the following statements best describes a "non-inferior" or Pareto-optimal solution in a

multi-objective optimization problem?

• A. A solution that improves all objectives compared to all other solutions.

• B. A solution that cannot be improved in one objective without worsening another objective.

• C. A solution that lies outside the feasible region.

• D. A solution that minimizes the sum of all objective functions.

B. A solution that cannot be improved in one objective without worsening another objective.

In the context of multi-objective optimization, a solution is considered inferior if:

• A. It improves one objective at the expense of another.

• B. It can be improved in at least one objective without worsening any other objective.

• C. It lies on the Pareto front.

• D. It achieves the global optimum for all objectives.

B. It can be improved in at least one objective without worsening any other objective.

Which of the following is a key characteristic of an inferior solution in multi-objective optimization?

• A. It dominates at least one other solution.

• B. It is outperformed by at least one other solution in all objectives.

• C. It achieves a balanced trade-off between all objectives.

• D. It always lies on the Pareto front.

B. It is outperformed by at least one other solution in all objectives.

In a multi-objective optimization problem, which of the following methods can help identify inferior

solutions?

• A. Comparing solutions based on the weighted sum of all objectives.

• B. Checking if a solution is dominated by any other feasible solution.

• C. Normalizing all objectives to the same scale.

• D. Selecting the solution that minimizes a single objective.

B. Checking if a solution is dominated by any other feasible solution.

Which of the following is NOT true about inferior solutions in multi-objective optimization?

• A. They are always non-optimal compared to Pareto-optimal solutions.

• B. They can be eliminated through Pareto dominance analysis.

• C. They represent the best compromise between conflicting objectives.

• D. They do not belong to the Pareto front.

C. They represent the best compromise between conflicting objectives.

Which method is most commonly used to avoid inferior solutions in multi-objective optimization

problems?

• A. Applying a gradient descent algorithm.

• B. Conducting Pareto dominance analysis to eliminate inferior solutions.

• C. Randomly generating multiple solutions and selecting the best one.

• D. Aggregating all objectives into a single objective function.

B. Conducting Pareto dominance analysis to eliminate inferior solutions

When using the weighted sum method to solve a multi-objective optimization problem, inferior

solutions can occur if:

• A. The weights do not properly reflect the decision-maker's preferences.

• B. All objectives are equally weighted.

• C. The solution lies on the Pareto front.

• D. The solution is optimal for one objective but suboptimal for the others.

A. The weights do not properly reflect the decision-maker's preferences

In the maximum flow problem, what is the primary objective?

A) Maximize the number of nodes in the network

B) Minimize the cost of flow through the network

C) Maximize the flow from the source node to the sink node

D) Maximize the number of paths from source to sink

C) Maximize the flow from the source node to the sink node

Which of the following is a necessary condition for a flow to be considered valid in the

maximum flow problem?

A) Flow conservation must hold at every node except the source and the sink

B) Flow on each edge must be greater than the capacity of that edge

C) The flow from source to sink must be zero

D) Flow conservation must hold only at the sink

A) Flow conservation must hold at every node except the source and the sink

In the minimum cut problem, the objective is to:

A) Minimize the total flow from source to sink

B) Minimize the capacity of the edges that need to be removed to disconnect the source from

the sink

C) Maximize the number of edges in the network

D) Minimize the flow from source to any other node

B) Minimize the capacity of the edges that need to be removed to disconnect the source from

the sink

Which of the following best describes a "cut" in a flow network?

A) A subset of edges whose removal increases the flow

B) A subset of nodes that minimizes the flow

C) A partition of the nodes in the network that separates the source from the sink

D) A path that maximizes the flow from source to sink

C) A partition of the nodes in the network that separates the source from the sink

In the minimum cut problem, the capacity of a cut is:

A) The sum of the capacities of the edges leaving the cut

B) The total number of edges in the network

C) The product of the capacities of all the edges in the network

D) The flow along the longest path from source to sink

A) The sum of the capacities of the edges leaving the cut

In the context of network flow, what is the relationship between the maximum flow and the

minimum cut?

A) The maximum flow is always greater than the minimum cut

B) The minimum cut is always smaller than the maximum flow

C) The value of the maximum flow equals the value of the minimum cut

D) There is no relationship between maximum flow and minimum cut

C) The value of the maximum flow equals the value of the minimum cut

The Maximum Flow Minimum Cut Theorem states that:

A) The value of the maximum flow is greater than the capacity of the minimum cut

B) The value of the maximum flow equals the capacity of the minimum cut

C) The maximum flow occurs when all paths are saturated

D) The minimum cut is always a single edge

B) The value of the maximum flow equals the capacity of the minimum cut

What does the Maximum Flow Minimum Cut Theorem imply about the relationship between

flow and cuts in a network?

A) If the flow is increased, the cut decreases

B) The maximum possible flow is equal to the total capacity of the minimum cut

C) The flow decreases as the number of nodes increases

D) The flow decreases when more cuts are made

B) The maximum possible flow is equal to the total capacity of the minimum cut

Which of the following is a direct consequence of the Maximum Flow Minimum Cut

Theorem?

A) Any augmenting path leads to an optimal solution

B) The capacity of the minimum cut limits the amount of flow that can be pushed through the

network

C) There are always multiple minimum cuts in a network

D) The maximum flow must always be less than or equal to the minimum cut

B) The capacity of the minimum cut limits the amount of flow that can be pushed through the

network

Which of the following conditions must hold true for the Maximum Flow Minimum Cut

Theorem?

A) The network must have undirected edges

B) The network must have equal capacities on all edges

C) The flow in the network must be at its maximum

D) The network must not contain any cycles

C. The flow in the network must be at its maximum

What is Integer Programming (IP)?

A) A type of optimization where decision variables are restricted to continuous values

B) A type of optimization where decision variables are restricted to integer values

C) A type of algorithm that only works with rational numbers

D) A method for solving linear equations

B. A type of optimization where decision variables are restricted to integer values

Which of the following is a characteristic of an Integer Programming problem?

A) All variables must be continuous

B) All variables must take fractional values

C) Some or all variables must take integer values

D) The objective function must be non-linear

C) Some or all variables must take integer values

Which of the following is an example of a decision variable in Integer Programming?

A) The number of products to manufacture (must be a whole number)

B) The weight of an object (can take any real value)

C) The temperature in a process (continuous value)

D) The length of a cable in kilometers (fractional value)

A) The number of products to manufacture (must be a whole number)

14. In a binary integer programming problem, the decision variables:

A) Can take any non-negative integer value

B) Can take values between 0 and 1, inclusive

C) Are restricted to only the values 0 or 1

D) Can take any positive or negative real value

C) Are restricted to only the values 0 or 1

Which of the following is a valid application of Integer Programming?

A) Determining the optimal mix of products to produce when production levels must be whole

numbers

B) Finding the shortest path in a network where distances are real values

C) Maximizing the flow through a pipeline

D) Calculating the average temperature over a given period

A) Determining the optimal mix of products to produce when production levels must be

whole numbers

Which of the following would be considered an Integer Programming problem?

A) Maximizing the profit from selling a continuous quantity of goods

B) Finding the optimal number of machines to allocate to different tasks in a factory

C) Determining the amount of fuel needed for a continuous process

D) Minimizing the distance in a routing problem where distances are real values

B) Finding the optimal number of machines to allocate to different tasks in a factory

Which of the following types of problems can be formulated as an Integer Programming

problem?

A) Resource allocation where only whole units of resources can be assigned

B) Finding the shortest path between two points in a graph

C) Solving a system of differential equations

D) Optimizing a continuous function with no constraints

A) Resource allocation where only whole units of resources can be assigned

What happens if an Integer Programming problem is solved without the integer constraints?

A) It becomes a Non-Linear Programming problem

B) It becomes an over-constrained system

C) It turns into a Linear Programming problem

D) The solution becomes infeasible

C) It turns into a Linear Programming problem

What is the primary purpose of the Branch and Bound method in Integer Programming?

A) To solve linear programming problems

B) To solve problems where all variables are continuous

C) To systematically explore the solution space and find the optimal integer solution

D) To approximate solutions without guaranteeing optimality

C) To systematically explore the solution space and find the optimal integer solution

In the Branch and Bound method, "branching" refers to

A) Dividing the problem into smaller subproblems by restricting variables

B) Identifying the upper bound of a solution

C) Selecting the optimal integer solution directly

D) Eliminating feasible solutions from the solution space

A) Dividing the problem into smaller subproblems by restricting variables

Which of the following best describes "bounding" in the context of the Branch and Bound

method?

A) The process of solving the LP relaxation of the Integer Programming problem

B) The process of finding feasible integer solutions

C) Setting limits on the objective function to eliminate unpromising subproblems

D) Calculating the exact solution for each subproblem

C) Setting limits on the objective function to eliminate unpromising subproblems

The first step in solving an Integer Programming problem using the Branch and Bound method

is:

A) Branching into multiple subproblems

B) Solving the Linear Programming relaxation of the original problem

C) Estimating the lower bound of the problem

D) Pruning all infeasible branches

B) Solving the Linear Programming relaxation of the original problem

When is a node "pruned" in the Branch and Bound method?

A) When a subproblem is solved optimally

B) When a subproblem has an integer solution

C) When a subproblem cannot produce a better solution than the current best known solution

D) When a subproblem takes too long to solve

C) When a subproblem cannot produce a better solution than the current best known solution

What happens if the solution to the Linear Programming relaxation is integer during the

Branch and Bound process?

A) The current solution is immediately discarded

B) The solution is stored as a candidate optimal solution

C) The problem is split into subproblems

D) The branch is further explored

B) The solution is stored as a candidate optimal solution

In the Branch and Bound algorithm, how are subproblems created?

A) By adding non-linear constraints

B) By rounding fractional decision variables in the LP relaxation to their nearest integer values

C) By splitting the problem based on fractional values of decision variables and creating two

or more subproblems

D) By reducing the number of constraints

C) By splitting the problem based on fractional values of decision variables and creating two

or more subproblems

Which of the following is a typical outcome of applying the Branch and Bound method to an

Integer Programming problem?

A) An approximate solution that may or may not be optimal

B) A globally optimal integer solution

C) A local optimum that depends on the starting point

D) An infeasible solution

B) A globally optimal integer solution

Which of the following is an advantage of the Branch and Bound method?

A) It always finds the global optimum

B) It can be used for both linear and non-linear problems

C) It provides approximate solutions in polynomial time

D) It works efficiently on problems with many continuous variables

A) It always finds the global optimum

1. What is total float in project scheduling?

A. The amount of time a task can be delayed without delaying the project.

B. The amount of time a task can be delayed without delaying the subsequent tasks.

C. The difference between the earliest start date and the latest start date of a task.

D. The amount of time a task can be accelerated to finish earlier than scheduled.

A. The amount of time a task can be delayed without delaying the project.

What is free float in project scheduling?

A. The amount of time a task can be delayed without affecting the project’s finish date.

B. The amount of time a task can be delayed without affecting the start of any subsequent

tasks.

C. The amount of time a task can be accelerated to finish earlier than its original schedule.

D. The time reserved for unforeseen delays or risks in the project schedule.

B. The amount of time a task can be delayed without affecting the start of any subsequent

tasks.

What is interfering float?

A. The float time that is shared between two tasks.

B. The difference between the total float of a task and the free float of that task.

C. The amount of time that does not affect the overall project duration but impacts

subsequent tasks.

D. The float time that impacts the completion of critical path tasks.

C. The amount of time that does not affect the overall project duration but impacts

subsequent tasks.

4. How is interfering float typically calculated?

A. Interfering Float = Total Float - Free Float

B. Interfering Float = Free Float - Total Float

C. Interfering Float = Total Float + Free Float

D. Interfering Float = Earliest Finish Date - Latest Start Date

A. Interfering Float = Total Float - Free Float

What is project compression in the context of CPM?

A. Reducing the project scope to decrease the duration.

B. Increasing the number of resources to accelerate project completion.

C. Changing project schedules to overlap tasks and shorten the project duration.

D. Extending project deadlines to accommodate unforeseen delays.

C. Changing project schedules to overlap tasks and shorten the project duration