Skip to Content
Quantitative Analysis for Management, 13/e
book

Quantitative Analysis for Management, 13/e

by Barry Render, Ralph M. Stair, Michael E. Hanna, Trevor S. Hale
January 2017
Beginner to intermediate
280 pages
217h 11m
English
Pearson
Content preview from Quantitative Analysis for Management, 13/e

M2.4 Knapsack Problem

The knapsack problem involves the maximization or the minimization of a value, such as ­profits or costs. As in a linear programming problem, there are restrictions in a knapsack problem. Imagine a knapsack or pouch that can hold only a certain weight or volume. We can place different types of items in the knapsack. Our objective is to place items in the knapsack to maximize total value without breaking the knapsack because of too much weight or a similar restriction.

Types of Knapsack Problems

Many kinds of problems can be classified as knapsack problems. Choosing items to place in the cargo compartment of an airplane and how to best cut sheet metal are examples. The restriction can be volume, weight, or both. Some scheduling ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Quantitative Finance

Quantitative Finance

Maria C. Mariani, Ionut Florescu

Publisher Resources

ISBN: 9780134543161