liveBook · Manning

Prompt engineering

As explained in Optimization Algorithms: AI techniques for design, planning, and control problems

An optimization approach that describes an optimization task in natural language and prompts a large language model to generate improved solutions or instructions.

Prompt engineering frames an optimization task in natural language so a large language model can generate improved solutions or instructions. Optimization by prompting (OPRO) applies this idea by using LLMs as optimizers. section 11.5

Representative optimization problems include:

  • Maximum coverage, MaxCut, and minimum vertex cover. section 11.5
  • Boolean satisfiability, traveling salesperson, and vehicle routing. section 11.5
Figure 11.14 Machine learning (ML) for combinatorial optimization (CO) problems

Visualizes machine learning approaches to combinatorial optimization problems. section 11.5

How Optimization Algorithms: AI techniques for design, planning, and control problems covers it

How deep it goes
Defines OPRO as simple and effective but does not provide implementation steps, parameters, or algorithmic internals.
Examples
Names maximum coverage, MaxCut, minimum vertex cover, SAT, TSP, and vehicle routing as application problems.
What you can do after
Evaluate natural-language optimization as an emerging machine-learning approach across benchmark optimization problems.
How it connects
Connects prompt engineering with large language models, machine learning, and combinatorial optimization.

Also explained in

Compare how 38 books explain prompt engineering →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.