Operations Research Algorithms In Linear Programming
50 Questions
| Total Attempts: 243
.png "Operations Research Algorithms In Linear Programming")
In an attempt to get solutions or make tough decisions, linear programming in mathematics helps us identify the best outcome of a situation. Find out how good you are with the operations research algorithms in linear programming?
Questions and Answers
- 1.A problem of maximizing or minimizing a linear function (objective function) in presence of linear inequality and/or equality constraints.
- A.
Linear programming
- B.
LP
- C.
Linear optimization
- D.
All of the above
- 2.Variables "X, Y, Z, . , . , are called as?
- A.
Objective variable
- B.
Subjective variable
- C.
Decision variable
- D.
None of the above
- 3.The largest or smallest value of the objective function is called?
- A.
Optimal value
- B.
Solution
- C.
Constraints
- 4.What can be used to help resolve distribution and location decisions?
- A.
Transportation modelling
- B.
Assignment modelling
- C.
Network optimization
- D.
All of the above
- 5.Which one is incorrect?
- A.
Transportation model is a procedure that finds the least costly means of moving products from a source to a destinations
- B.
Northeast-Corner Rule is a method of transportation modelling
- C.
Optimal value can be the smallest or largest value of the objective function
- D.
Optimal solution is the collection of values of the x, y, z, . , . , that gives the optimal value
- 6.Hungarian Mathematicain who founded the Hungarian Method
- 7.What type of problem is the Assignment Model?
- 8.Meaning of "VAM" in VAM method of transportation modelling.
- 9.Hungarian Method involves what is called as Matrix ____________
- 10.A job has four men (A-D) available for work on four separate jobs. Only one man can work on any one job. The cost of assigning of each man to each job is given in the following table. What is the total minimum cost of assigning the four men in each job? 1234A20252228B15182317C19172124D25232424
- A.
$58
- B.
$68
- C.
$78
- D.
$88
- 11.In a typical assignment problem, three different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed to each job. The associated costs are as follows.JobsMachines123A608050B503060C709040 What job should be assigned to Machine A and B ?
- A.
Machine A-Job 2 ,Machine B -Job 1
- B.
Machine B-Job 2 ,Machine C -Job 1
- C.
Machine A-Job 1 ,Machine B -Job 2
- D.
Machine A-Job 3 ,Machine B -Job 2
- 12.In assignment model, there is a one-to-one- correspondence. true or false?
- A.
True
- B.
False
- 13.A company has two plants producing a certain product that is to be shipped to three distribution centers. The unit production costs are the same at the two plants, and the shipping cost per unit is shown below. DISTRIBUTION CENTERPLANT123A$4$6$4B$6$5$2 Shipments are made once per week. During each week, each plant produces at most 60 units and each distribution center needs at least 40 units.By using the NORTHWEST-CORNER RULE, what is the total cost?
- A.
$420
- B.
$460
- C.
$510
- D.
$560
- 14.A toy company has four factories supplying three warehouses.Factories A, B, C, and D can produce 15, 6, 14, and 11 toy cars. Warehouses 1, 2, and 3 has a demand of 19, 12, and 15 toy cars, respectively. The management wants to determine how many units of toy cars should be supplied from factory A to warehouse 1. Use the LEAST-COST METHOD. WarehousesFactories123A$10$30$25B$20$15$20C$10$30$20D$30$40$35
- A.
10
- B.
6
- C.
15
- D.
4
- 15.Is the objective function a linear function. true or false?
- A.
True
- B.
False
- 16.In assignment model, you determine the highest number on both the column and row and subtract it to the numbers they are aligned in.true or false?
- A.
True
- B.
False
- 17.Is assignment model a special case of transportation model. true or false?
- A.
True
- B.
False
- 18.When solving a transportation problem using the NORTHWEST-CORNER RULE, you start on the northeast cell of the matrix. true or false?
- A.
True
- B.
False
- 19.Maximum Spanning Tree is one of the algorithms of linear programming. true or false?
- A.
True
- B.
False
- 20.The letter "T" on the diagram for the algorithms of linear programming stands for "TOTAL". true or false?
- A.
True
- B.
False
- 21.You work as a sales manager for a toy manufacturer, and you currently have three salespeople on the road meeting buyers. Your salespeople are in Austin, TX; Boston, MA; and Chicago, IL. You want them to fly to three other cities: Denver, CO; Edmonton, Alberta; and Fargo, ND. The table below shows the cost of airplane tickets in dollars between these cities. From/ToDenverEdmontonFargoAustin$250$400$350Boston$200$600$350Chicago$400$400$250Where should you send each of your salespeople in order to minimize airfare?
- A.
Austin (Edmonton), Boston (Denver), Chicago (Fargo)
- B.
Austin (Fargo), Boston (Edmonton), Chicago (Denver)
- C.
Austin (Denver), Boston (Fargo), Chicago (Edmonton)
- D.
Austin (Edmonton), Boston (Fargo), Chicago (Fargo)
- 22.A building firm possesses four cranes, each of which has a distance(km) from four different construction sites as shown in the table:Crane #Construction site #12341907575802358555653125959010544511095115In which construction site will you place crane #2? State only the number representing the construction site.
- 23.A construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below. Bulldozer/ SiteABCD1907575802358555653125959010544511095115In which site should you moved bulldozer 3? State only the letter representing the garage.
- 24.In a typical assignment problem, four different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed to each job. The associated costs are as follows. JobsMachines123A608050B503060C709040In what job would you assign machine 3? state only the number representing the job.
- 25.A company wants to transfer units from an origin to a destination. The supply that the origin can produce are 150, 120 and 130 while the demand required for the destinations are 100, 70, 140, and 90. Find the total cost using the Least-Cost Method. Origin/Destination Northwood Eastwood Westwood Southwood Nashville50483651Eavesville45384135Noville48375246
- A.
14,980
- B.
14,960
- C.
14,940
.
Questions: 41 | Attempts: 1533 | Last updated: Sep 7, 2020
-
Sample QuestionMark the wrong statement:
In an attempt to get solutions or make tough decisions, linear programming in mathematics helps us identify the best outcome of a situation. Find out how good you are with the operations research algorithms in linear programming?
Questions: 50 | Attempts: 241 | Last updated: Jan 31, 2018
-
Sample QuestionA problem of maximizing or minimizing a linear function (objective function) in presence of linear inequality and/or equality constraints.
Are you applying for a job, and they have required you to take the basic computer skills test when you show up for the interview? The quiz below covers the basics of what you are most likely to be asked. Give it a try, and all...
Questions: 10 | Attempts: 158962 | Last updated: Oct 25, 2021
-
Sample QuestionWhen you see no icons on the desktop, how can you open programs such as Microsoft Word?
Back to top