Heuristics

Solution methods are usually specified/adapted for the problem (Aim is to generate a good solution that is feasible with a reasonable computation time) The quality of the solution is not guaranteed to be globally optimal, might generate local optimum. Often based on the problem and necessarily on the mathematical model Useful in difficult combinatorial optimization problems and in finding feasible solutions for pessimistic bounds (Bra vid problem där många faktorer spelar roll och för att hitta lower och upper bounds, pessimistisk i detta fall betyder att bounds troligtvis inte stämmer, alltså kanske inte går att uppnå så bra lösning)