[Q4]: Choose the most suitable answer from the options given. ( 1- Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed a) Management processes b) Decision making c) Procedures d) Deployment of resources/ 2- Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints a) Quailing Theory b) Waiting Line c) Both A and B d) Linear Programming 3- The horizontal and vertical lines drawn to cover all zeros of the total opportunity matrix for an optimal assignment solution must be a) Equal to each other b) Equal to mxn (where m and n are numbers of rows and columns) c) Equal to m+n (where m and n are numbers of rows and columns) d) Equal to the number of rows or columns/ 4- A saddle point exists when a) maximin value = maximax value b) minimax value = minimum value c) minimax value = maximin value, d) none of these 5.If there are more than one optimum solution for the decision variable the solution is a) Infeasible b) Unbounded c) Alternative d) None of the above 6-solving a game with reduction by dominance may be stopped if a) we find that none of the rows is dominated by any of the others. b) we find that none of the column is dominated by any of the others. (c) we find that none of the row and column is dominated by any of the others. d) we are left with a (1x1) matrix. e) both c and d f) all of the above are true.
[Q4]: Choose the most suitable answer from the options given. ( 1- Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed a) Management processes b) Decision making c) Procedures d) Deployment of resources/ 2- Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints a) Quailing Theory b) Waiting Line c) Both A and B d) Linear Programming 3- The horizontal and vertical lines drawn to cover all zeros of the total opportunity matrix for an optimal assignment solution must be a) Equal to each other b) Equal to mxn (where m and n are numbers of rows and columns) c) Equal to m+n (where m and n are numbers of rows and columns) d) Equal to the number of rows or columns/ 4- A saddle point exists when a) maximin value = maximax value b) minimax value = minimum value c) minimax value = maximin value, d) none of these 5.If there are more than one optimum solution for the decision variable the solution is a) Infeasible b) Unbounded c) Alternative d) None of the above 6-solving a game with reduction by dominance may be stopped if a) we find that none of the rows is dominated by any of the others. b) we find that none of the column is dominated by any of the others. (c) we find that none of the row and column is dominated by any of the others. d) we are left with a (1x1) matrix. e) both c and d f) all of the above are true.
Elements Of Electromagnetics
7th Edition
ISBN:9780190698614
Author:Sadiku, Matthew N. O.
Publisher:Sadiku, Matthew N. O.
ChapterMA: Math Assessment
Section: Chapter Questions
Problem 1.1MA
Related questions
Question
Choose the correct true
![[Q4]: Choose the most suitable answer from the options given. (
1- Operations research is based upon collected information, knowledge and advanced
study of various factors impacting a particular operation. This leads to more
informed
a) Management processes
b) Decision making
c) Procedures
d) Deployment of resources/
2- Which technique is used in finding a solution for optimizing a given objective, such
as profit maximization or cost reduction under certain constraints
a) Quailing Theory
b) Waiting Line
c) Both A and B
d) Linear Programming
3- The horizontal and vertical lines drawn to cover all zeros of the total opportunity
matrix for an optimal assignment solution must be
a) Equal to each other
b) Equal to mxn (where m and n are numbers of rows and columns)
c) Equal to m+n (where m and n are numbers of rows and columns)
d) Equal to the number of rows or columns/
4- A saddle point exists when
a)
maximin value = maximax value
b)
minimax value = minimum value
c)
minimax value = maximin value,
d)
none of these
5.If there are more than one optimum solution for the decision variable the solution is
a) Infeasible
b) Unbounded
c) Alternative
d) None of the above
6-solving a game with reduction by dominance may be stopped if
a) we find that none of the rows is dominated by any of the others.
b) we find that none of the column is dominated by any of the others.
(c) we find that none of the row and column is dominated by any of the others.
d) we are left with a (1x1) matrix.
e) both c and d
f) all of the above are true.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F804f3825-0b58-4c1d-9af1-6be7261f317d%2Ff47d4ac5-79ee-4dd2-b031-55850c034b78%2Fmyqxwch_processed.jpeg&w=3840&q=75)
Transcribed Image Text:[Q4]: Choose the most suitable answer from the options given. (
1- Operations research is based upon collected information, knowledge and advanced
study of various factors impacting a particular operation. This leads to more
informed
a) Management processes
b) Decision making
c) Procedures
d) Deployment of resources/
2- Which technique is used in finding a solution for optimizing a given objective, such
as profit maximization or cost reduction under certain constraints
a) Quailing Theory
b) Waiting Line
c) Both A and B
d) Linear Programming
3- The horizontal and vertical lines drawn to cover all zeros of the total opportunity
matrix for an optimal assignment solution must be
a) Equal to each other
b) Equal to mxn (where m and n are numbers of rows and columns)
c) Equal to m+n (where m and n are numbers of rows and columns)
d) Equal to the number of rows or columns/
4- A saddle point exists when
a)
maximin value = maximax value
b)
minimax value = minimum value
c)
minimax value = maximin value,
d)
none of these
5.If there are more than one optimum solution for the decision variable the solution is
a) Infeasible
b) Unbounded
c) Alternative
d) None of the above
6-solving a game with reduction by dominance may be stopped if
a) we find that none of the rows is dominated by any of the others.
b) we find that none of the column is dominated by any of the others.
(c) we find that none of the row and column is dominated by any of the others.
d) we are left with a (1x1) matrix.
e) both c and d
f) all of the above are true.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Elements Of Electromagnetics
Mechanical Engineering
ISBN:
9780190698614
Author:
Sadiku, Matthew N. O.
Publisher:
Oxford University Press
Mechanics of Materials (10th Edition)
Mechanical Engineering
ISBN:
9780134319650
Author:
Russell C. Hibbeler
Publisher:
PEARSON
Thermodynamics: An Engineering Approach
Mechanical Engineering
ISBN:
9781259822674
Author:
Yunus A. Cengel Dr., Michael A. Boles
Publisher:
McGraw-Hill Education
Elements Of Electromagnetics
Mechanical Engineering
ISBN:
9780190698614
Author:
Sadiku, Matthew N. O.
Publisher:
Oxford University Press
Mechanics of Materials (10th Edition)
Mechanical Engineering
ISBN:
9780134319650
Author:
Russell C. Hibbeler
Publisher:
PEARSON
Thermodynamics: An Engineering Approach
Mechanical Engineering
ISBN:
9781259822674
Author:
Yunus A. Cengel Dr., Michael A. Boles
Publisher:
McGraw-Hill Education
Control Systems Engineering
Mechanical Engineering
ISBN:
9781118170519
Author:
Norman S. Nise
Publisher:
WILEY
Mechanics of Materials (MindTap Course List)
Mechanical Engineering
ISBN:
9781337093347
Author:
Barry J. Goodno, James M. Gere
Publisher:
Cengage Learning
Engineering Mechanics: Statics
Mechanical Engineering
ISBN:
9781118807330
Author:
James L. Meriam, L. G. Kraige, J. N. Bolton
Publisher:
WILEY