matching type complete answers please asap

Prompts Submitted Answers Program Evaluation and Review Technique the duration of each project is not known with certainty and can be used to estimate the probability that the project will be completed by the given deadline Critical Path Method the duration of each activity is known with certainty and can be used to determine the length of time required to complete a project. deviations amounts by which the goals are underachieved or overachieved sequence of critical activities that forms a continuous path between the start of a project and its completion critical path activity effort that requires resources and takes a certain amount of time for completion event a specific accomplishment at a recognizable point in time; a milestone, checkpoint. a Constraints and objectives are expressed at distinct priorities Choose a match system constraints identical to LP constraints. They represent absolute restrictions and do not allow any deviations. These must be satisfied before any of the goal constraints can be considered Choose a match v Constraints that allow deviations from the constraints targets Reflect the flow from one point in the network to another Choose a match Represent junction points in the network Choose a match Algorithm that solve the minimal spanning tree problem Choose a match An algorithm used to solve postman/patrolman problem Choose a match items can flow in either direction Choose a match Is a type of mathematical programming that focuses on multiple conflicting goals Choose a match A closed path where the start and end node of the path are the same. Choose a match > Choose a match activity that if even slightly delayed, will hold up the scheduled completion date of the entire project. Choose a match An arrangement of paths connected at various points, through which one or more items move from one point to another Choose a match Finding the distribution of flows through a network that permits the greatest amount to flow from the source to sink. Choose a match trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices) sets a specific target that we do not want to miss on either side Choose a match Choose a match sets un upper limit that we dot want to fall under but exceeding the limit is fine A solution where all goals are achieved without sacrificing higher priority Choose a match Choose a match all goals are roughly comparable (equal weights) importance III Kruskal's Algorithm PI O critical activities TE event Q 40 Points shortest route problem M Pr activity Submitted Answers Program Evaluation and Review Technique t Chinese postman algorithm non preemptive goal programming Critical Path Method system constraints Dijkstra's algorithm deviations Euler tour critical path minimal spanning tree activity undesirable deviations event preemptive goal programming deviations Choose a match critical activities remaining critical path Submit directed e PIGoal Programming TE circuit Q Q 40 Points nodes M. Pr maximum flow problem Submitted Answers Program Evaluation and Review Technique t most satisfactory solution Patrolman problem Critical Path Method Hamiltonian tour soft constraints deviations early finish critical path Critical Path Method activity lower one sided goat links event network Choose a match Program Evaluation and Review Technique transshipment problem remaining Submit two-sided goal