```markdown
### Image Description

#### Title
- **Linear program (LP)**

#### Mathematical Formulation
- **Objective:** Minimize \( c^T x + d \)
- **Constraints:** 
  - \( Gx \succeq h \)
  - \( Ax = b \)

#### Key Points
- **Convex problem** with affine objective and constraint functions.
- **Feasible set** is a polyhedron.

#### Diagram
- A shaded polygon labeled \( P \) representing the feasible set.
- A vector \( -c \) pointing towards the optimal point \( x^* \).
- Dashed lines indicating level sets or constraints.

#### Source
- A. d’Aspremont. Convex Optimization M2. Slide 49 of 67.
```
