Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

6) (6 points) A Salt Lake City based company (called Intractable Logistics) employs 6 (six) sales persons referred to as S1, S2,.,Se. The company has

image text in transcribed

6) (6 points) A Salt Lake City based company (called "Intractable Logistics") employs 6 (six) sales persons referred to as S1, S2,.,Se. The company has business interests in London (L.), Paris (P), New York (N), Tokyo (T), Moab (M) and Zurich (Z); and it wants these cities to be visited by its sales persons. Unfortunately Sales person Si can only visit cities L, N, and M. S2 can only visit T and M. Sz can only visit P, N, and Z. S4 can only visit N, T, and Z. Ss can only visit L, T, and M. Se can only visit L, P, and Z. a) Assuming that the cost (salary or commission) of each sales person is the same, identify a minimum number of sales persons required to cover all the cities. b) Now assume that Si costs $15K, S, costs $30K, S3, S4, Sg cost $40K each, and Se costs $30K. Identify a set of sales persons to cover all cities such that the total cost is minimized. You have to formulate this problem as a Quine-McCluskey style table covering, and solve the problem algorithmically - i.e. by using essentials, row/column dominance, branching, etc. No points for just stating the answer 6) (6 points) A Salt Lake City based company (called "Intractable Logistics") employs 6 (six) sales persons referred to as S1, S2,.,Se. The company has business interests in London (L.), Paris (P), New York (N), Tokyo (T), Moab (M) and Zurich (Z); and it wants these cities to be visited by its sales persons. Unfortunately Sales person Si can only visit cities L, N, and M. S2 can only visit T and M. Sz can only visit P, N, and Z. S4 can only visit N, T, and Z. Ss can only visit L, T, and M. Se can only visit L, P, and Z. a) Assuming that the cost (salary or commission) of each sales person is the same, identify a minimum number of sales persons required to cover all the cities. b) Now assume that Si costs $15K, S, costs $30K, S3, S4, Sg cost $40K each, and Se costs $30K. Identify a set of sales persons to cover all cities such that the total cost is minimized. You have to formulate this problem as a Quine-McCluskey style table covering, and solve the problem algorithmically - i.e. by using essentials, row/column dominance, branching, etc. No points for just stating the

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

ACCA Approved Study Text P7 Advanced Audit And Assurance

Authors: BPP

1st Edition

1472744349, 978-1472744340

More Books

Students also viewed these Accounting questions

Question

6. Explain the power of labels.

Answered: 1 week ago

Question

10. Discuss the complexities of language policies.

Answered: 1 week ago