b) An airline cargo company has l aeroplane which it flies from Bangladesh to Canada on a daily basis to transport some cargo. In advance of a flight, it receives bids for deliveries from customers. Customers state the weight of the cargo item they would like delivered, and the amount they are prepared to pay. The airline is constrained by the total amount of weight the plane is allowed to carry. The company must choose a subset of the packages to carry in order to make the maximum possible profit, given the weight limit that they must respect. In mathematical form the problem is: given a set of N items each with weight w, and value v, for i=l to N, choose a subset of items so that the total value carried is maximized, and the total weight carried is less than or equal to a given carrying capacity, C. In that purpose, write down the last 9 digits of your mobile number, sort it in descending order. Then pick the highest value as C (digit1), consider N=4 items with the next highest digits as follows: (w, v.) = (4, digit2), (1, digit3), (3, digit4), (2, digit5). Example: if the number is: 1684049627, then the descending order will be: 987664410. That means, the airline's weight constrained is C=9. The 4 customer's cargo items are: (4, 8), (1, 7), (3, 6), (2, 6).
b) An airline cargo company has l aeroplane which it flies from Bangladesh to Canada on a daily basis to transport some cargo. In advance of a flight, it receives bids for deliveries from customers. Customers state the weight of the cargo item they would like delivered, and the amount they are prepared to pay. The airline is constrained by the total amount of weight the plane is allowed to carry. The company must choose a subset of the packages to carry in order to make the maximum possible profit, given the weight limit that they must respect. In mathematical form the problem is: given a set of N items each with weight w, and value v, for i=l to N, choose a subset of items so that the total value carried is maximized, and the total weight carried is less than or equal to a given carrying capacity, C. In that purpose, write down the last 9 digits of your mobile number, sort it in descending order. Then pick the highest value as C (digit1), consider N=4 items with the next highest digits as follows: (w, v.) = (4, digit2), (1, digit3), (3, digit4), (2, digit5). Example: if the number is: 1684049627, then the descending order will be: 987664410. That means, the airline's weight constrained is C=9. The 4 customer's cargo items are: (4, 8), (1, 7), (3, 6), (2, 6).
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:b) An airline cargo company has 1 aeroplane which it flies from Bangladesh to Canada on a daily
basis to transport some cargo. In advance of a flight, it receives bids for deliveries from
customers. Customers state the weight of the cargo item they would like delivered, and the
amount they are prepared to pay. The airline is constrained by the total amount of weight the
plane is allowed to carry. The company must choose a subset of the packages to carry in order
to make the maximum possible profit, given the weight limit that they must respect.
In mathematical form the problem is: given a set of N items each with weight w, and value vi,
for i=l to N, choose a subset of items so that the total value carried is maximized, and the
total weight carried is less than or equal to a given carrying capacity, C. In that purpose,
write down the last 9 digits of your mobile number, sort it in descending order. Then pick the
highest value as C (digit1), consider N=4 items with the next highest digits as follows: (w V.) =
(4, digit2), (1, digit3), (3, digit4), (2, digit5).
Example: if the number is: 1684049627, then the descending order will be: 987664410. That
means, the airline's weight constrained is C=9.
The 4 customer's cargo items are: (4, 8), (1, 7), (3, 6), (2, 6).
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 with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY