Can Linear Programming Solve Problems with Division Constraints?

1 reply · 2K views · last reply
Cheema154
Messages
1
Reaction score
0
Member warned about posting homework in non-homework section, with no effort shown
Hello,

Below is a description written in Latex.

Typeset text stating that F, defined as the sum from i = 1 to d-1 of w[i] times x[i] divided by w[d], is to be minimized, with w[i] non-negative and bounded between min[i] and max[i].


I am not sure how to solve this problem. I am new to linear programming and, in fact, I do not know if it can be solved by linear constraints.

Please guide. Thanks
 
Last edited:
Since you call w "weights", do they sum to 1? Except for the division by w[d], this is a standard linear programming problem and the Simplex method should work. With that division, it is not immediately clear to me if it is a linear problem.