assignment problem mcq with answers

Machine Learning Decision Tree – Solved Problem (ID3 algorithm)
Poisson Distribution | Probability and Stochastic Process
Conditional Probability | Joint Probability
Solved assignment problems in communicaion |online Request
while Loop in C++

EngineersTutor

Solved assignment problems – algorithms and flowcharts.

An algorithm is defined as sequence of steps to solve a problem (task) . The steps must be finite, well defined and unambiguous. Writing algorithm requires some thinking. Algorithm can also be defined as a plan to solve a problem and represents its logic. Note that an algorithm is of no use if it does not help us arrive at the desired solution

Algorithm characteristics

It should have finite number of steps . No one can be expected to execute infinite number of steps.
The steps must be in order and simple
Each step should be defined clearly i.e. without un-ambiguity (without doubtfulness)
Must include all required information
Should exhibit at least one output

A flowchart is a pictorial (graphical) representation of an algorithm . A flowchart is drawn using different kinds of symbols. A symbol is used for a specific purpose. Each symbol has name.


An algorithm is defined as .	.	Set of instructions. Instruction is a command to the computer to do some task.
Algorithm can also be defined as a plan to solve a problem and represents its logic.	A picture is worth of 1000 words. We can understand more from picture than words.	Implementation of Algorithm or flowchart

Different algorithms have different performance characteristics to solve the same problem. Some algorithms are fast. Some are slow. Some occupy more memory space. Some occupy less memory space. Some are complex and some algorithms are simple.

Logically algorithm, flowchart and program are the same.

Q1 . Create a program to compute the volume of a sphere. Use the formula: V = (4/3) *pi*r 3 where pi is equal to 3.1416 approximately. The r is the radius of sphere. Display the result.

Q2 . Write a program the converts the input Celsius degree into its equivalent Fahrenheit degree. Use the formula: F = (9/5) *C+32.

Q3 . Write a program that converts the input dollar to its peso exchange rate equivalent. Assume that the present exchange rate is 51.50 pesos against the dollar. Then display the peso equivalent exchange rate.

Q4 . Write a program that converts an input inch(es) into its equivalent centimeters. Take note that one inch is equivalent to 2.54cms.

Q5 . Write a program that exchanges the value of two variables: x and y. The output must be: the value of variable y will become the value of variable x, and vice versa.

Q6 . Design a program to find the circumference of a circle. Use the formula: C=2πr, where π is approximately equivalent 3.1416.

Q7 . Write a program that takes as input the purchase price of an item (P), its expected number of years of service (Y) and its expected salvage value (S). Then outputs the yearly depreciation for the item (D). Use the formula: D = (P – S) Y.

Q8 . Swapping of 2 variables without using temporary (or 3 rd variable).

Q9 . Determine the most economical quantity to be stocked for each product that a manufacturing company has in its inventory: This quantity, called economic order quantity (EOQ) is calculated as follows: EOQ=2rs/1 where: R= total yearly production requirement S=set up cost per order I=inventory carrying cost per unit.

Q10 . Write a program to compute the radius of a circle. Derive your formula from the given equation: A=πr², then display the output.

← Solved Assignment Problems in Java (with Algorithm and Flowchart)
Simple if statement in C →

Gopal Krishna

Hey Engineers, welcome to the award-winning blog,Engineers Tutor. I'm Gopal Krishna. a professional engineer & blogger from Andhra Pradesh, India. Notes and Video Materials for Engineering in Electronics, Communications and Computer Science subjects are added. "A blog to support Electronics, Electrical communication and computer students".

1
		True
		False


2
		True
		False


3
		True
		False


4
		True
		False


5
		True
		False


6
		True
		False


7
		12.
		7.
		13.
		8.


8
		the objective function only.
		the constraints only.
		both objective function and constraints.
		neither objective function nor constraints.


9	denoting the amount shipped from supply point i (1 or 2) to demand point j (1, 2 or 3) the correct constraint to make sure that supply available in supply point #2 will be fully used is:
		7 + 2 + 5 = 300
		+ + = 300
		7 + 2 + 5 ≥ 300
		+ + ≥ 300


10
		Dummy supply 300.
		Dummy supply 2100.
		Dummy demand 300.
		Dummy demand 2100.


11
		origins.
		intermediate points.
		either origins or intermediated points.
		origins or external sources.


12
		24.
		9.
		48.
		14.


Date:
My name:
Section ID:

	E-mail address:	Format:
Me:		'); } else { document.write(' '); } } else { document.write(' '); } -->
My Instructor:		'); } else { document.write(' '); } } else { document.write(' '); } -->
My TA:		'); } else { document.write(' '); } } else { document.write(' '); } -->
Other:		'); } else { document.write(' '); } } else { document.write(' '); } -->

To learn more about the book this website supports, please visit its .

and .
is one of the many fine businesses of .

You must be a registered user to view the in this website. If you already have a username and password, enter it below. If your textbook came with a card and this is your first visit to this site, you can to register.
Username:
Password:

'); document.write(''); } // -->

( )
.'); } else{ document.write('This form changes settings for this website only.'); } //-->
		Send mail as:
		'); } else { document.write(' '); } } else { document.write(' '); } // -->
	'); } else { document.write(' '); } } else { document.write(' '); } document.write('
TA email:		'); } else { document.write(' '); } } else { document.write(' '); } // -->
Other email:		'); } else { document.write(' '); } } else { document.write(' '); } // -->

"Floating" navigation?	'); } else if (floatNav == 2) { document.write(' '); } else { document.write(' '); } // -->
Drawer speed:	'; theseOptions += (glideSpeed == 1) ? ' ' : ' ' ; theseOptions += (glideSpeed == 2) ? ' ' : ' ' ; theseOptions += (glideSpeed == 3) ? ' ' : ' ' ; theseOptions += (glideSpeed == 4) ? ' ' : ' ' ; theseOptions += (glideSpeed == 5) ? ' ' : ' ' ; theseOptions += (glideSpeed == 6) ? ' ' : ' ' ; document.write(theseOptions); // -->




1.	(optional) Enter a note here:
2.	(optional) Select some text on the page (or do this before you open the "Notes" drawer).
3.	Highlighter Color:
4.

Search for:
Search in:


Course-wide Content

	Quizzes

	More Resources


Instructor Resources


	Course-wide Content

	Instructor Resources

Quiz 6: Transportation, Transshipment, and Assignment Problems

Access For Free

In a transportation problem, items are allocated from sources to destinations at a minimum cost.

An assignment problem is a special form of transportation problem.

For most real-world applications, an unbalanced transportation model is a more likely occurrence than a balanced transportation model.

In a transportation problem, items are allocated from sources to destinations at a maximum value.

In a transshipment problem, items may be transported directly from sources to destinations.

In an unbalanced transportation problem, if demand exceeds supply, the optimal solution will be infeasible.

In a balanced transportation model where supply equals demand, all constraints are equalities.

In a transshipment problem, items may be transported from one transshipment point to another.

The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.

A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient.

A prohibited route in a transportation model should be assigned a value of zero.

In order to model a "prohibited route" in a transportation or transshipment problem, the route should be omitted from the linear program.

In a transshipment problem, items may be transported from one source to another.

An assignment problem is a special form of transportation problem where all supply and demand values equal 1.

In a transshipment problem, items may be transported from destination to destination and from source to source.

In a transshipment problem, items may be transported from sources through transshipment points on to destinations.

The transshipment model includes intermediate points between the sources and destinations.

In an unbalanced transportation model, all constraints are equalities.

In a transshipment problem, items may be transported from one destination to another.

Assignment linear programs always result in integer solutions.

showing 1 - 20 of 98

Related Quizzes

Management Science

121 Questions

Linear Programming: Model Formulation and Graphical Solution

122 Questions

Linear Programming: Computer Solution and Sensitivity Analysis

95 Questions

Linear Programming: Modeling Examples

90 Questions

Integer Programming

107 Questions

Network Flow Models

104 Questions

Project Management

116 Questions

Multicriteria Decision Making

103 Questions

Nonlinear Programming

72 Questions

Probability and Statistics

152 Questions

Decision Analysis

Queuing Analysis

123 Questions

100 Questions

Forecasting

133 Questions

Inventory Management

157 Questions

the Simplex Solution Method

Transportation and Assignment Solution Methods

86 Questions

Integer Programming: the Branch and Bound Method

63 Questions

Nonlinear Programming: Solution Techniques

55 Questions

Game Theory

64 Questions

Markov Analysis

Problem Questions with Answer, Solution | Operations Research - Exercise 10.1: Transportation Problem | 12th Business Maths and Statistics : Chapter 10 : Operations Research

Chapter: 12th business maths and statistics : chapter 10 : operations research, exercise 10.1: transportation problem.

Exercise 10.1

1. What is transportation problem?

2. Write mathematical form of transportation problem.

3. what is feasible solution and non degenerate solution in transportation problem?

4. What do you mean by balanced transportation problem?

5. Find an initial basic feasible solution of the following problem using north west corner rule.

6. Determine an initial basic feasible solution of the following transportation problem by north west corner method

7. Obtain an initial basic feasible solution to the following transportation problem by using least- cost method.

8. Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem

9. Consider the following transportation problem

Determine initial basic feasible solution by VAM

10. Determine basic feasible solution to the following transportation problem using North west Corner rule.

11. Find the initial basic feasible solution of the following transportation problem:

Using (i) North West Corner rule

(ii) Least Cost method

(iii) Vogel’s approximation method

12. Obtain an initial basic feasible solution to the following transportation problem by north west corner method.

Test: Transportation & Assignment Model - Mechanical Engineering MCQ

10 questions mcq test - test: transportation & assignment model, which of the following is needed to use the transportation model.

Capacity of the sources

Demand of the destinations

Unit shipping cost

All of these

Which method usually gives a very good solution to the assignment problem?

Northwest corner rule

Vogel's approximation method

MODI method

Stepping-stone method

1 Crore+ students have signed up on EduRev. Have you?

In applying Vogel’s approximation method to a profit maximation problem, row and column penalties are determined by

finding the largest unit cost in each row or column.

finding the sum of the unit costs in each row or column.

finding the difference between the two highest unit costs in each row and column.

finding the difference between the two lowest unit costs in each row and column.

The concept of Vogel’s Approximation Method can be well understood through an illustration given below :

The difference between two least cost cells are calculated for each row and column, which can be seen in the iteration given for each row and column.

Which one of the following is riot the solution method of transportation method?

Hungarian method

North west corner method

Least cost method

Vogel’s approximate method

The matrix in assignment model is

square maxtrix

rectangular matrix

diagonal matrix

unit matrix

Assignment model can be solved by conventional linear programming approach or transportation model approach, it is square matrix, having equal number of rows and columns. The objective is to assign one item from row to one item from column so that total cost of assignement is minimum.

In order for a transportation matrix which has six rows and four columns not to degenerate, what is the number of occupied cells, in the matrix?

Number of cells for non-degenerate solution = 6 + 4 - 1 = 9

Consider the following statements: 1. For the application of optimally test in case of transportation model, the number of allocations should be equal to (m + n) where m is the number of rows and n is the number of columns. 2. Transportation problem is a special case of a linear programming problem. 3. In case of assignment problem, the first step is to dummy row or a matrix by adding a dummy row or a dummy column.

Which of these statements is/are correct?

1 and 2 only

2 and 3 only

Consider the following statements on transportation problem: 1. In Vogel’s approximation method, priority allotment is made in the cell with the lowest cost. 2. The North-west corner method ensures faster optimal solution. 3. If the total demand is higher than the supply, transportation problem cannot be solved. 4. A feasible solution may not be an optimal solution.

Which of these statements are correct?

Penalty cost method is

North West corner method

Vogel’s approximation method

None of the above

One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that

it is complicated to use

it does not ’take into account cost of transportation

it leads to a degenerate initial solution

all of the above

--> and get INR 200 additional OFF

Top Courses for Mechanical Engineering

Important Questions for Transportation & Assignment Model

Transportation & assignment model mcqs with answers, online tests for transportation & assignment model.

cation olution

Join the 10M+ students on EduRev

Welcome Back

Create your account for free.

Forgot Password

Operations Research

131. If the primal has an unbound objective function value then the dual has ______________.

basic solution
basic feasible solution
no feasible solution

132. If there is no non-negative replacement ratio in a solution which is sought to be improved, then the solution is ______________.

no solution
alternative solution

133. An activity is represented by a/an ______________.

straight line

134. A project consists of a number of tasks which are called ______________.

135. The similarity between assignment problem and transportation problem is ______________.

both are rectangular matrices
both are square matrices
both can be solved y graphical method
both have objective function and non-negativity constraints

136. The penalty for not taking correct decision is known as ______________.

opportunity cost

137. In a given system of m simultaneous linear equations in n unknowns (m<n) there will be ______________.

n basic variables
m basic variables
(n-m) basic variables
(n+m) basic variables

138. If all aij values in the entering variable column of the simplex table are negative, then ______________.

solution is unbounded
solution is degenerate
there exist no solution
there are multiple solutions

139. An unoccupied cell in the transportation method is analogous to a______________.

Zj-Cj value in the simplex table.
variable in the B-column in the simplex table.
variable not in the B-column in the simplex table.
value in the XB column in the simplex table.

140. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to______________.

Search MBA MCQ.com

TRANSPORTATION PROBLEM Solved MCQs

RATIO, PROPORATION AND PERCENTAGE
PROFIT AND LOSS
LINEAR PROGRAMMING PROBLEM
MATICES AND DETERMINANTS
TRANSPORTATION PROBLEM

1.
A.	economical
B.	scientific
C.	a and b both
D.	artistic
Answer» B. scientific

2.
A.	battle field
B.	fighting
C.	the opponent
D.	both a and b
Answer» D. both a and b

3.
A.	morse and kimball (1946)
B.	p.m.s. blackett (1948)
C.	e.l. arnoff and m.j. netzorg
D.	none of the above
Answer» A. morse and kimball (1946)

4.
A.	programme evaluation
B.	review technique (pert)
C.	both a and b
D.	deployment of resources
Answer» C. both a and b

5.
A.	increases infinitely
B.	basic variables are nonzero
C.	decreases infinitely
D.	one or more basic variables are zero
Answer» D. one or more basic variables are zero

6.
A.	scientists
B.	mathematicians
C.	academics
D.	all of the above
Answer» D. all of the above

7.
A.	only constraints
B.	only non-negative restriction
C.	[a] and [b] both
D.	[a],[b] and optimum solution
Answer» C. [a] and [b] both

8.
A.	balanced
B.	unbalanced
C.	degenerate
D.	none of the above
Answer» A. balanced

9.
A.	least cost method
B.	vogel’s approximation method
C.	modified distribution method
D.	all of the above
Answer» C. modified distribution method
Explanation: The Modified Distribution Method (MODI), also known as the UV method, is used to check the optimality of the current solution in a transportation problem. The least cost method and Vogel’s approximation method are used to find an initial feasible solution but do not verify optimality.

10.
A.	dummy allocation(s) needs to be added
B.	the problem has no feasible solution
C.	the multiple optimal solution exist
D.	a & b but not c
Answer» C. the multiple optimal solution exist

11.
A.	satisfy rim conditions
B.	prevent solution from becoming degenerate
C.	ensure that total cost does not exceed a limit
D.	none of the above
Answer» A. satisfy rim conditions

12.
A.	total supply equals total demand
B.	the solution so obtained is not feasible
C.	the few allocations become negative
D.	none of the above
Answer» B. the solution so obtained is not feasible

13.
A.	positive & greater than zero
B.	positive with at least one equal to zero
C.	negative with at least one equal to zero
D.	none of the above
Answer» B. positive with at least one equal to zero

14.
A.	it is complicated to use
B.	it does not take into account cost of transportation
C.	it leads to a degenerate initial solution
D.	all of the above
Answer» B. it does not take into account cost of transportation

15.
A.	m+n
B.	m*n
C.	m+n-1
D.	m+n+1
Answer» C. m+n-1

16.
A.	equal to zero
B.	most negative number
C.	most positive number
D.	any value
Answer» B. most negative number

17.
A.	it represents per unit cost reduction
B.	it represents per unit cost improvement
C.	it ensure no rim requirement violation
D.	none of the above
Answer» A. it represents per unit cost reduction

18.
A.	it improve the total cost
B.	it does not disturb rim conditions
C.	it ensure feasible solution
D.	all of the above
Answer» C. it ensure feasible solution

19.
A.	logical approach
B.	rational approach
C.	scientific approach
D.	all of the above
Answer» C. scientific approach

20.
A.	experience
B.	judgement
C.	intuition
D.	all of the above
Answer» D. all of the above

Done Studing? Take A Test.

Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.

COMMENTS

Assignment MCQ [Free PDF]
Get Assignment Multiple Choice Questions (MCQ Quiz) with answers and detailed solutions. Download these Free Assignment MCQ Quiz Pdf and prepare for your upcoming exams Like Banking, SSC, Railway, UPSC, State PSC. ... An assignment problem is solved to minimize the total processing time of four jobs (1, 2, 3 and 4) on four different machines ...
MCQ Assignment
Chapter 1: Assignment Problem. Multiple Choice Questions (MCQ) The application of assignment problems is to obtain _____. a. only minimum cost. b. only maximum profit. c. minimum cost or maximum profit. d. assign the jobs. The assignment problem is said to be unbalanced if _____. a. number of rows is greater than number of columns. b.
270+ Operations Research solved MCQs with PDF download
When a maximization assignment problem is converted in minimization problem, the resulting matrix is called matrix. A. cost: B. regret: C. profit: D. dummy: Answer» B. regret ... Operations Research MCQs with answers PDF download * Related Topics. Principles of Accounting Data Communication and Computer Network ...
PDF ASSIGNMENT PROBLEM
introduction to assignment problem matrix form of assignenmt problem mathematical formulation of an assignment problem difference between transportation problem and assigment problem assigment algorithm (or) hungarian method example of assigment problems question to answer mcq questions with answer k.bharathi,scsvmv. assignment problem 2 / 55
Problem Solving MCQ Quiz
Problem Solving Question 1: Arrange the stages of the problem-solving process in the correct order: A. Identifying the problem. B. Generating potential solutions. C. Implementing the chosen solution. D. Evaluating the outcomes. E. Analyzing the available information.
Solved Assignment Problems
Program. An algorithm is defined as sequence of steps to solve a problem (task). A flowchart is pictorial (graphical) representation of an algorithm. Set of instructions. Instruction is a command to the computer to do some task. Algorithm can also be defined as a plan to solve a problem and represents its logic. A picture is worth of 1000 words.
Multiple Choice Quiz
Multiple Choice Quiz. Transportation and assignment problems can be solved by simplex method though special purpose algorithms offer an easier solution procedure. The total supply must equal total demand in a transportation problem in order to solve it by the transportation algorithm. XYZ Inc. manufactures desks and chairs in all its four ...
Transportation Model MCQ Quiz
Get Transportation Model Multiple Choice Questions (MCQ Quiz) with answers and detailed solutions. Download these Free Transportation Model MCQ Quiz Pdf and prepare for your upcoming exams Like Banking, SSC, Railway, UPSC, State PSC. ... stocked for sale or the are in process of manufacturing or in the form of material yet to be utilized is ...
Quiz 6: Transportation, Transshipment, and Assignment Problems
Quiz 6: Transportation, Transshipment, and Assignment Problems. Access For Free. Practice Exam. Question 1. True/False. In a transportation problem, items are allocated from sources to destinations at a minimum cost. Question 2. True/False. An assignment problem is a special form of transportation problem.
Transportation and assignment MCQs
Transportation problem is basically a ( a) Maximisation model ( b) Minimisation model ( c) Trans-shipment problem ( d) Iconic model. The column, which is introduced in the matrix to balance the rim requirements, is known as: ( a) Key column ( b) Idle column ( c) Slack column ( d) Dummy Column. The row, which is introduced in the matrix to balance the rim requirement, is known as: ( a) Key row ...
MCQ
b. two separate transportation problems would be solved. c. costs of zero would be used for each of the new facilities. d. the problem would be a transshipment problem. 9. The Hungarian method is a. a way to develop an initial solution to a transportation problem. b. used to solve assignment problems. c. also called Vogel's approximation ...
Exercise 10.1: Transportation Problem
5. Find an initial basic feasible solution of the following problem using north west corner rule. 6. Determine an initial basic feasible solution of the following transportation problem by north west corner method . 7. Obtain an initial basic feasible solution to the following transportation problem by using least- cost method. 8.
PDF OPERATIONS RESEARCH Multiple Choice Questions
a, b, and c are independent. a, b, and d are independent. d c. are independentb and d are i. dependent38. Consider the linear equation 2 x1 + 3 x2 - 4 x3 + 5 x4 = 10 How many basic and non. One variable is basic, three variables are non-basic. Two variables are basic, two variables are non-basic. e i.
Transportation and Assignment Model Free MCQ Practice Test with
2 only. Test: Transportation & Assignment Model - Question 8. Save. Consider the following statements on transportation problem: 1. In Vogel's approximation method, priority allotment is made in the cell with the lowest cost. 2. The North-west corner method ensures faster optimal solution. 3.
Operations Research Multiple choice Questions and Answers. Page 4
Multiple choice Questions on Operations Research. Practice for BBA or MBA exams using these MCQ. Page 4. ... The assignment problem is always a _____matrix. circle; square; rectangle; triangle; View answer. Correct answer: (B) ... View answer. Correct answer: (D) alternate optimum solution.
Assignment Problems
In this video, we will solve the Assignment problem MCQs.Test of Optimality Part-1 video link :https://youtu.be/VAWrSOyRHJkTest of Optimality Part-2 video li...
Linear Programming MCQ [Free PDF]
Get Linear Programming Multiple Choice Questions (MCQ Quiz) with answers and detailed solutions. Download these Free Linear Programming MCQ Quiz Pdf and prepare for your upcoming exams Like Banking, SSC, Railway, UPSC, State PSC. ... stocked for sale or the are in process of manufacturing or in the form of material yet to be utilized is known ...
280+ Decision Science solved MCQs with PDF download
The difference between the transportation and assignment problems is that. A. total supply must equal total demand in the transportation problem. B. the number of origins must equal the number of destinations in the transportation problem. C. each supply and demand value is 1 in the assignment problem. D.
MCQ Assignment
a. an assignment problem may require the introduction of both dummy row and dummy column. b. an assignment problem with m rows and n columns will involves a total of m x n possible assignments. c. an unbalanced assignment is one where the number of rows is more than, or less than,thenumber of columns. d.
Operations Research Multiple choice Questions and Answers. Page 14
Multiple choice Questions on Operations Research. Practice for BBA or MBA exams using these MCQ. Page 14. ... View answer. Correct answer: (D) no feasible solution. ... The similarity between assignment problem and transportation problem is _____. both are rectangular matrices;
TRANSPORTATION PROBLEM Solved MCQs with PDF Download
An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is: A. positive & greater than zero. B. positive with at least one equal to zero. C. negative with at least one equal to zero. D.
Transportation and Assignment Problem
Transportation and Assignment Problem quiz for University students. Find other quizzes for Mathematics and more on Quizizz for free! ... Show Answers. See Preview. 1. Multiple Choice. Edit. 30 seconds. 1 pt. The north- west corner rule is used to find . Initial feasible solution . An optimum solution . Non- optimum solution . None of these. 2 ...


	Multiple Choice Quiz