Question: You have a container with a given volume and weight capacity and you need to choose some items to fill it in. Solve the problem

You have a container with a given volume and weight capacity and you need to choose some items to fill it in.

Solve the problem to maximize the total value of the items you choose, subject to the container's capacity.

Keep in mind that you only have one unit per item.

Create a mathematical formulation.

The container capacity is volume: 1350 cub ft

weight: 65200 pounds

Sample Items

item 1: Volume 15.1, Weight 1338.5

item 2: Volume 25.1, Weight 1418.5

item 3: Volume 13.1, Weight 1323.5

item 4: Volume 11.1, Weight 1348.5

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Q:

Review the Annual Report of either Apple Inc or Samsung Inc (NOT BOTH) to gain a general understanding of the types of financial information contained in the report and explain why the information...

Q:

Question 2) (25 points) Consider a box with a limited weight of 50 and a limited volume of 8 . We want to select a subset of the following items and put them into the box to maximize the total value....

Q:

The "Knapsack" Problem A hiker has a number of items that he would like to pack into his knapsack for his next trip. He cannot take all of these items because their total size is greater than the...

Q:

Question 3 ( 2 0 marks ) There are n items and a "knapsack". Each item i has weight w i > 0 and has value v i 0 . Knapsack has capacity of W ? . The goal is to fill knapsack so as to maximize total...

Q:

Problem 2 . You are given n items, each with a weight w i and a value v i . Your goal is to fill a knapsack of capacity W to maximize the total value. Unlike the discrete ( 0 1 ) knapsack problem, in...

Q:

Problem statement A person has planned for a hiking trip. He decided to pack things for his trip. He had only a backpack bag with a maximum capacity of 20 kg. There are different item types that are...

Q:

In the lecture, you have seen the Knapsack problem: Given n items with non - zero integer weights wi in Z + and values vi 0 , you want to choose a subset that maximizes the total value while the...

Q:

Q . 2 / Explain how the Subset Sum Problem ( SSP ) can be reduced to the Knapsack Problem ( KP ) . Clearly describe the transformation of elements between the two problems and explain how solving one...

Q:

Problem statement A person has planned for a hiking trip. He decided to pack things for his trip. He had only a backpack bag with a maximum capacity of 20kg. There are different item types that are...

Q:

Problem: MULTIPLE KNAPSACK: Given n objects, each with a value vi and a weight wi, and k knapsacks, each with capacity C, assign objects to the knapsacks so that the total weight of the objects in...

Q:

Formulate a linear programming problem ( DONT SOLVE ) to maximize total contribution margins given the production, resource, and demand constraints. Hint: Compute unit contribution margin for each of...

Q:

A grade beam AB supports three concentrated loads and rests on soil and the top of a large rock. The soil exerts an upward distributed load, and the rock exerts a concentrated load ad RR as shown....

Q:

Tech Tool: Spreadsheet Software Software Video: Spreadsheet ERM Kolbe & Co. has asked for your assistance in training its project development team in the PIECES framework. To prepare for the training...

Q:

Designs use of options combination strategies, such as spreads and straddles, to address a hedging exposure they develop.

Q:

atch the compensation objectives with their meanings. Efficiency Efficiency drop zone empty. Fairness Fairness drop zone empty. Compliance Compliance drop zone empty. Improving performance and...