Parametric Linear Programming

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

This Demonstration illustrates the problem of parametric linear programming for the case of two variables. So a linear cost function is optimized on a convex domain determined by linear inequalities. The parameter enters the cost function. Vary to see that the vertex or the edge where the optimum is realized changes.

Contributed by: Bunduchi Ecaterina and Mandric Igor (March 2011)
(Moldova State University)
Open content licensed under CC BY-NC-SA



The problem is to optimize (either maximize or minimize) on a convex domain that is the convex hull of the points , , , , , .

The solution (the set of points for which is optimized) is either a vertex or an edge; it depends on the parameter and is colored red. We show the domain, the gradient of the cost function, and display the optimal value of the cost function.


[1] M. Sagaidac and V. Ungureanu, Operations Research, Chi┼činău: CEP USM, 2004 (in Romanian).

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.