Figure 1
From: Optimization of biotechnological systems through geometric programming
Feasible area of the first example. The lines show the nullclines of each of the two equations of the system. They intersect at two (unconnected) points, which constitute the only feasible solutions. The feasible area of the relaxed problem in the penalty treatment is marked in grey.
