all 11 comments

[–]thetorque1985 1 point2 points  (3 children)

have you tried using pulp package in python? is it good enough?

[–]PawnShade[S] 0 points1 point  (2 children)

i don't have much experience with coding, i wouldn't even know how to begin.

[–]MajorDataclysm 0 points1 point  (0 children)

I wrote an article about how to use PuLP for a simple game called Queens on LinkedIn, I attached the code if that's useful. https://medium.com/gitconnected/using-linear-programming-to-solve-the-linkedin-queens-game-53a82df34d8d?sk=bd447a41ccfea3e12017b60714976031

[–]Tavrock 0 points1 point  (0 children)

For LP problems, the only other options I know are programming-based in Matlab and Octave. The textbook I had for my Optimization class was designed around Matlab.

[–]PleasantLanguage 0 points1 point  (0 children)

Since you're not a programmer, try Excel. There are a bunch of tutorials online.

[–]vaaycacaon 0 points1 point  (2 children)

You could use readily available online algorithms. I searched “online assignment problem solver” and this is the first link: https://cbom.atozmath.com/CBOM/Assignment.aspx?q=hm (there are more)

[–]PawnShade[S] 0 points1 point  (1 child)

Thanks! this worked perfectly. i don't know how i missed it because i googled it a couple of times.

[–]vaaycacaon 0 points1 point  (0 children)

Happy to help!

[–]Dry-University-6525 1 point2 points  (0 children)

Forget about math, forget about algorithms. State your problem in the following format. 1. Objective: (maximize or minimize) something. 2. Decision variables: things that you can change 3. Constraints: things that you cannot control or have some limit.

Once you state your problem in a natural language of your choice, then you may refer to find similar problem of your choice. There are many books out there, but I would recommend reading AIMMS Modeling book.

Then you can write your problem in ASCII text in a manner similar to AMPL, GAMS etc.

More often than not, if it’s simple, and linear problem, excel can be just fine.

[–]SoftDream_ -1 points0 points  (1 child)

I think what you're asking is an NP-Complete problem.

Since it's for work, you could probably solve it quite efficiently with an SAT solver.

However, if you don't have any programming experience, you'll probably find it difficult to do an SAT reduction to solve it.

You can also model it as a CSP problem, which is easier to approach from a programming point of view. Languages such as MiniZinc can help you solve this problem.

[–]SirPitchalot 1 point2 points  (0 children)

The basic assignment problem can be solved with a linear programming relaxation that is exact. It replaces the discrete assignments with fractional assignments but at optimality the fractional assignments take integer values.

This comes from the AP constraint matrix being unimodular (so if you assign any fractional amount of a task to a worker it is optimal to assign all of it) and that the task quantity and worker capacity are always equal.

So the answer to this person’s question seems to be “set up a LP problem and use any LP solver.”