Decision revision

Explain why the Simplex algorithm cannot be used to solve this linear programming problem?

Simplex can only be applied when the non-negativity constraints are <=

Explain the term Hamiltonian cycle

A closed loop in a graph that visits every single vertex exactly once and returns to the starting vertex

Explain the term Eulerian Graph

A connected graph where every vertex has an even degree, allowing a closed trail that traverses every edge exactly once and returns to the start

Explain the term Semi-Eulerian

A connected graph with exactly two vertices of odd degree, allowing a trail that traverses every edge exactly once but starts and finishes at different vertices

Explain the term Non-Eulerian

A graph that contains more than two vertices of odd degree, making it impossible to traverse every edge exactly once without repeating an edge.

Explain the term Minimum spanning tree

A connected subgraph that includes all the vertices of the original graph, contains no cycles, and has the minimum total edge weight.

How do find the lower bound for amount of workers needed in a critical path analysis?

(All paths added together) / (critical path length)

Explain the term Tree

A connected graph that contains no cycles.

Define Loop (Network)

An edge that starts and finishes at the exact same vertex.

Why has the bubble sort finished?

The algorithm terminates because a full pass has been completed with zero swaps recorded.

Why has the quick sort ended?

The algorithm terminates because every item has been chosen as a pivot or forms a sub-list of size 1

Explain the term spanning tree

A subgraph that includes all the vertices of the original graph and forms a tree

Explain why the solution given by the first iteration is not feasible. (big M-method)

Make sure to look at your values

“the solution after the first iteration is not feasible because a1= (some value) is an artificial variable that must be zero in feasible solution.”