Purchase Solution

Integer Programming: Cutting Stock Problem

Not what you're looking for?

Ask Custom Question

Home Depot sells wood sticks. Each super wood sticks is 10 feet long. Home Depot cuts the wood according to the customer's requirements. A customer requires 10 sticks of length 3 feet (Type 1), 15 sticks of length 2.8 feet (type 2) and 9 sticks of length 4.5 (type 3)

Formulate an integer programing model that helps Home Depot employees cut the sticks to meet customer requirement. The objective is to minimize waste and minimize total number of super sticks used.

Purchase this Solution
Solution Summary

PDF of a basic approach in formulating a model for this stock cutting problem.

Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Linear Programming - Cyclic Algorithm (The Cutting Plane)

    584172 Linear Programming - Cyclic Algorithm (The Cutting Plane) Please see the attachment for full details of the question. (a) Use the Cyclic (i.e. the cutting plane) algorithm to solve the attached integer linear programming problem.

  • ILP and LPP Problems

    Solve this problem by using the computer (note: if using QM for Windows, be sure to use the Integer and Mixed Integer Programming Module). 5. A transportation problem involves the following costs, supply and demand.

  • Quantitative Methods

    Solve this problem by using the computer (note: if using QM for Windows, be sure to use the Integer and Mixed Integer Programming Module). 5. A transportation problem involves the following costs, supply and demand.

  • Multiple choice questions on integer programming

    If the optimal solution to the linear programming relaxation problem is integer, it is ____________ to the integer linear programming problem.

  • Quantitative Methods: INTEGER PROGRAMMING

    Rounding non-integer solution values up to the nearest integer value will still result in a feasible solution to an integer programming problem. 7.

  • Use LP relaxation to solve Mix Integer programming problem

    An LP relaxation problem is formulated for the Mix Integer programming problem. The LP relaxation problem is solved using graphical method and an upper bound is find for the original Mix Integer programming problem.

  • Integer Linear Programming and Optimal Solution

    142295 Integer Linear Programming and Optimal Solution 1. Consider the following integer linear programming problem.

  • Integer programming problems: Optimal solution

    Integer Programming Problem Consider the following integer linear programming problem Max Z=3x1+2x2 Subject to: 3x1+5x2<=30 5X1+2x2<=28 x1<=8 x1,x2>=0 and integer The solution to the Linear programming relaxation is: x1 = 5.714

  • Quantitative methods: Linear programming

    121737 Quantitative methods interest in linear programming practice problems Consider the following integer linear programming problem.

View More Related Solutions