Final Test Math
Final Test Math
Final test
Math-603, M.Sc CS Section A, time 60 minutes, date: 29-6-2020
* Required
Email address *
Password *
603
Name *
ZAFAR IQBAL
Registration No *
2018-ag-1625
A constraint with zero slack or surplus for the optimal solution is called binding
constraint. *
True
False
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 1/12
6/29/2020 Final test
A point lying in the feasible region.Basically, it is any point that satisfies all of the
problem’s constraints is called feasible solution. *
True
False
Restricted problem
unbalance problem
True
False
A condition that exists when a solution variable and the profit can be made
infinitely large without violating any of the problem’s constraints in a
maximization process is called *
boundedness
unboundedness
multiple solutions
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 2/12
6/29/2020 Final test
The difference between the left-hand side and the right-hand side of a greater-
than-or-equal-to constraint.Often this represents the amount by which a
minimum quantity is exceeded is called *
slack
surplus
artificial
The difference between the left-hand side and the right-hand side of a less-
than-or-equal-to constraint. Often this is the amount of a resource that is not
being used is called *
slack
surplus
artificial
A set of constraints that requires each decision variable to be non negative; that
is,each xi must be greater than or equal to 0. *
objective function
optimality
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 3/12
6/29/2020 Final test
Decision variable
Slack variable
surplus variable
True
False
A network problem with the objective of finding the shortest distance from one
location to another is called *
destination
source
capacity
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 4/12
6/29/2020 Final test
Hungarian Method
Opportunity Costs
Flood’s Technique
The condition under which total demand at all destinations is equal to total
supply at all sources is called balanced transportation problem. *
True
False
The approach of the assignment method that reduces the original assignment
costs to a table of opportunity costs is called Matrix Reduction *
True
False
A condition that occurs when the number of occupied squares in any solution is
less than the number of rows plus the number of columns minus 1 in a
transportation table *
infeasibility
unbalanced
unboundedness
none
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 5/12
6/29/2020 Final test
In transportation table the shipping cost per item is not given normally. *
true
false
Nodes
Arcs
destinations
Clear selection
There are ---- steps for the minimal spanning tree and maximal flow problems *
Three
Six
Four
Five
Yes
No
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 6/12
6/29/2020 Final test
The maximal-flow technique finds the maximunm that can flow through a
network. *
true
False
Find the dimensions of a rectangular field having perimeter 120 m if its area is to
be maximum? *
(20, 20)
(20, 40)
(40,40)
(30,30)
A person wants to form a topless rectangular box with a square base having
capacity of 3000 feet cube. The material for the base costs Rs. 150 per feet
square and the material for the sides costs 90 per feet square. Find the cost if
x=1 and y=2 ? *
850
870
1000
True
False
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 7/12
6/29/2020 Final test
MODI
SSM
VAM
LCM
NWCR
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 8/12
6/29/2020 Final test
10
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 9/12
6/29/2020 Final test
10
12
11
Find the maximal flow from the given diagram where starting point is 1 and
ending point is 5. *
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 10/12
6/29/2020 Final test
True
False
For maximal flow technique we can move backward in the overall diagram. *
True
False
Feasible
infeasible
Unbounded
Multiple
True
False
Submit
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy
Forms
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 11/12
6/29/2020 Final test
https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 12/12