Simplex method, no feasible solution?

  • Thread starter Thread starter csc2iffy
  • Start date Start date
  • Tags Tags
    Method
csc2iffy
Messages
74
Reaction score
0
Maximize Z = 4x + 5y + 3z
subject to
x + y + 2z ≥ 20
15x + 6y + 5z ≤ 50
x + 3y + 5z ≤ 30
and x ≥ 0, y ≥ 0, z ≥ 0

Work through the simplex method step by step to demonstrate that this problem does not possesses any feasible solutions
 
Physics news on Phys.org
... Is there a question somewhere?
 
csc2iffy said:
Maximize Z = 4x + 5y + 3z
subject to
x + y + 2z ≥ 20
15x + 6y + 5z ≤ 50
x + 3y + 5z ≤ 30
and x ≥ 0, y ≥ 0, z ≥ 0

Work through the simplex method step by step to demonstrate that this problem does not possesses any feasible solutions

The question ai asking YOU to work through the method; that is the only way you will learn. Forum helpers have all passed their exams and don't need to prepare for their finals; you do.

RGV
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top