Wikimore

Summary

DescriptionOptimisation convexe 2D.svg	Français : Optimisation convexe dans un espace à deux dimensions (x₁, x₂) contraint dans un polygone convexe. Gauche : l'ensemble admissible E contient le minimum absolu. Droite : l'ensemble admissible E ne contient pas le minimum absolu. Haut : vue en perspective. Bas : vue plane, la valeur de y étant représentée par des courbes de niveau. English: Convex optimisation convexe in a two-dimensional space (x₁, x₂) constrained in a convex polygon. Left: the feasible set E contains the absolute minimum. Right: the feasible set E does not contain the absolute minimum. Top: perspective view. Bottom: plane view, they-value being represented by level lines.
Date	9 March 2017
Source	Own work
Author	Cdang

I, the copyright holder of this work, hereby publish it under the following license:

You are free:

Under the following conditions:

attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.