After the discovery of NP-complete, it became apparent that

some problems are just as hard but are not not decision problems

such as

• “Does a tour of given maximum length exists?” (in NP and NP-complete)
• “What is the shortest tour?” (not in NP, but just as hard or harder)

which gave birth to NP-hard.