Abstract
The relations between optimal solutions for different types of min-sum balaneed JIT optimisation problems are examined. It is shown that the so-called min-sum-absolute and min-sum-squared problems, subject to the so-ealled oneness condition, have the same set of optimal solutions and that this property cannot be extended to other types of min-sum problems. It is also shown that any optima] solution for the min-sum-absolute problem with oneness property if any exists is optimal for the min-sum-squared.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
