Linear programming: simplex question (might belong in precal)

Click For Summary
SUMMARY

The discussion centers on solving a linear programming problem using the simplex method to maximize profits for the Cut-Right Company, which sells three types of kitchen knife sets. The profit function is defined as a = 30*x1 + 40*x2 + 60*x3, where x1, x2, and x3 represent the number of Basic, Regular, and Deluxe sets produced, respectively. The constraints involve the availability of utility knives, chef’s knives, and slicers, leading to the equations 2*x1 + 2*x2 + 3*x3 ≤ 800, x1 + x2 + x3 ≤ 400, and x2 + x3 ≤ 200. The correct solution requires producing 200 Deluxe sets and 100 Basic sets, highlighting the importance of updating the cost coefficients during the simplex calculations.

PREREQUISITES
  • Understanding of linear programming concepts
  • Familiarity with the simplex algorithm
  • Knowledge of slack variables in optimization problems
  • Ability to perform row operations in matrix form
NEXT STEPS
  • Review the simplex method for linear programming problems
  • Learn about slack variables and their role in optimization
  • Practice row operations in matrix algebra for linear programming
  • Explore sensitivity analysis in linear programming
USEFUL FOR

Students studying linear programming, operations researchers, and anyone involved in optimization problems in manufacturing or resource allocation.

saching
Messages
6
Reaction score
0

Homework Statement



Original question: The Cut-Right Company sells sets of kitchen knives. The Basic Set consists of 2 utility knives and 1 chef’s knife. The Regular Set consists of 2 utility knives, 1 chef’s knife, and 1 slicer. The Deluxe Set consists of 3 utility knives, 1 chef’s knife, and 1 slicer. Their profit is $30 on a Basic Set, $40 on a Regular Set, and $60 on a Deluxe Set. The factory has on hand 800 utility knives, 400 chef’s knives, and 200 slicers. Assuming that all sets will be sold, how may of each type should be produced in order to maximize profit? What is the maximum profit?

Homework Equations



s1, s2, s3 are slack variables
x1, x2, x3 are all non-negative

x1 = # of basic sets produced
x2 = # of regular sets produced
x3 = # of deluxe sets produced

2*x1 + 2*x2 + 3*x3 + s1 = 800
x1 + x2 + x3 + s2 = 400
x2 + x3 + s3 = 200

a is the profit function given by:
a = 30*x1 + 40*x2 + 60*x3

The Attempt at a Solution



pivot.jpg


I circled the pivot element in row3,col3. It's a "1".

I know I chose the pivot correctly(chose the most negative number in the bottom row, then found the column entry that is least when divided into the right-most column). Then I perform row operations to get all the rest of the numbers in the pivot column to be 0. Then I perform a row operation to turn the entry in the last row of the pivot column to 0. This makes the entire last row positive so the simplex algorithm is supposedly done--but it's not. The correct answer requires 200 deluxe sets and 100 basic sets be produced.

I notice that I still have slack variables as basic variables. My guess is that I either performed the row operations incorrectly or there is some other step that I am overlooking. Ideas?
 
Physics news on Phys.org
Hi,

Hopefully, I am not late to help.

After performing the row (pivot) operations, remember to update the "a", your cost coefficient of the entering variable x3 into the 3rd row, i.e. now "a" for the 3rd row is updated from 0 to 60!
I think this is what causes the error in your Simplex calculations.
Redo your workings again, and I am sure you can get the correct optimal solution!

If you still can't find it, you can pm me here.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
7K
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
Replies
5
Views
6K