0% found this document useful (0 votes)
86 views

Final Test Math

The document appears to be a final exam for a math course covering topics in linear programming and network models. It consists of multiple choice and short answer questions testing understanding of concepts like feasible solutions, objective functions, slack variables, transportation problems, and minimal spanning trees and maximal flow network problems. The exam is timed for 60 minutes and includes questions about definitions, properties, and solving specific problems related to these mathematical optimization models.

Uploaded by

abrar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
86 views

Final Test Math

The document appears to be a final exam for a math course covering topics in linear programming and network models. It consists of multiple choice and short answer questions testing understanding of concepts like feasible solutions, objective functions, slack variables, transportation problems, and minimal spanning trees and maximal flow network problems. The exam is timed for 60 minutes and includes questions about definitions, properties, and solving specific problems related to these mathematical optimization models.

Uploaded by

abrar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

6/29/2020 Final test

Final test
Math-603, M.Sc CS Section A, time 60 minutes, date: 29-6-2020

* Required

Email address *

[email protected]

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

A common LP problem involving a decision as to which products a firm should


produce given that it faces limited resources. *

Restricted problem

Product mix problem

unbalance problem

A mathematical statement of the goal of an organization, stated as an intent to


maximize or to minimize some important quantity such as profits or costs is an
objective function. *

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. *

Non negativity Constraints

objective function

optimality

https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 3/12
6/29/2020 Final test

A variable whose value may be chosen by the decision maker is called *

Decision variable

Slack variable

surplus variable

infeasible region can occurs if constraints conflict with one another. *

True

False

A network problem with the objective of finding the shortest distance from one
location to another is called *

Minimal spanning tree problem

maximal flow problem

shortest route technique

A demand location in a transportation problem is called *

destination

source

capacity

https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 4/12
6/29/2020 Final test

A matrix reduction approach to solving the assignment problem is called *

Hungarian Method

Opportunity Costs

Flood’s Technique

Hungarian Method and 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

The lines connecting all the points are called

Nodes

Arcs

destinations

Clear selection

There are ---- steps for the minimal spanning tree and maximal flow problems *

Three

Six

Four

Five

Is it necessary to connect all nodes in minimal spanning tree? *

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

In SSM method every loop has 4 corners. *

True

False

https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 7/12
6/29/2020 Final test

Whist method is fast to obtain optimal answer in transportation problems *

MODI

SSM

VAM

LCM

NWCR

https://docs.google.com/forms/d/e/1FAIpQLSdVCwxfA5Jmi1-roek3ybnG1dB9vjo5tjJBmzWf2wa-XkxlcQ/viewform 8/12
6/29/2020 Final test

Find the shortest distance from 1 to 6 *

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

The final node or destination in a network model is called sink. *

True

False

For maximal flow technique we can move backward in the overall diagram. *

True

False

If surplus variable exists in the optimal solution then solution is called *

Feasible

infeasible

Unbounded

Multiple

When ratio test is negative or infinite then problem is called infeasible. *

True

False

Submit

Never submit passwords through Google Forms.

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

You might also like