Skip to content

Giapetto Production Model

Definition

The Giapetto production model chooses wooden soldier production xsx_s and train production xtx_t to maximize profit. With the data in the course, the LP is

max⁡z=3xs+2xtsubject to2xs+xt≤100,xs+xt≤80,xs≤40,xs,xt≥0.\begin{aligned} \max\quad &z=3x_s+2x_t\\ \text{subject to}\quad &2x_s+x_t\le100,\\ &x_s+x_t\le80,\\ &x_s\le40,\\ &x_s,x_t\ge0. \end{aligned}

Interpretation

The Giapetto model is a complete small production-planning LP: two products compete for two shared workshop resources, and one of them also faces a sales limit.

The feasible region for soldiers and trains bounded by finishing, carpentry and demand constraints, with the optimal corner (20, 60), profit 180, marked.

The three constraint lines cut the first quadrant down to a pentagon of possible plans. The orange profit line 3xs+2xt=1803x_s+2x_t=180 touches the region only at the corner (20,60)(20,60), where the finishing and carpentry lines cross; every line with a larger profit misses the region, so (20,60)(20,60) is the best plan.

Each number has a practical reading. The objective coefficients 33 and 22 are the profits per soldier and per train. In 2xs+xt≤1002x_s+x_t\le100 the coefficients are finishing hours per toy and 100100 is the number of finishing hours available; xs+xt≤80x_s+x_t\le80 does the same for carpentry, with one hour per toy. The limit xs≤40x_s\le40 restricts soldiers only. This is linear program formulation at work: data become model parameters, and the choices become decision variables.

The optimum is not obvious from the profits alone. Soldiers earn more per unit, yet the best plan makes three times as many trains as soldiers. Making as many soldiers as allowed, xs=40x_s=40, uses 8080 finishing hours, so at most 2020 trains remain possible and the profit is 160<180160<180. Per finishing hour a soldier earns 1.51.5 and a train 22, so the limited finishing time favours trains.


Key Results

  • The profit contribution is 3 per soldier and 2 per train.
  • Finishing and carpentry constrain the two products jointly.
  • The soldier demand limit constrains only xsx_s.

Examples

At the illustrated plan (xs,xt)=(20,60)(x_s,x_t)=(20,60), the finishing and carpentry restrictions bind, while the soldier-demand restriction has slack because 20<4020<40.

  • Producing 20 soldiers and 60 trains uses 100 finishing hours and 80 carpentry hours.
  • Producing 40 soldiers and 40 trains violates the finishing limit because it needs 120 hours.

Prerequisites

Sources

Aliases: Giapetto problem, Giapetto's Woodcarving Keywords: Giapetto's wood carving

Last updated: 20 October 2026 03:02