Composite Concave
Linear Programming

Virtual Tutorials

Welcome to our virtual tutorials!

You'll need Netscape 3 or later to use the interactive codes in these tutorials. Netscape 2 will definitely not work properly.

We plan to develop in these pages a number (5-6) of tutorials on CCLP and its applications. Feel free to send your students here. You are also welcome to use the material in your classes, but please let us know about it.

If you cannot wait till the material is ready, we suggest that you consult our library where you can find a list of published material on C-programming and CCLP. This material will give you a pretty good idea about how to incorporate CCLP material in courses on linear and nonlinear programming.

If you want us to send you announcements concerning the tutorials, add your e-mail address to our ,mailing list.

The first tutorial gives a short overview of linear programming problems and the beloved Simplex Method. This in preparation for the second tutorial which will be dedicated to parametric linear programming.

If you are using a Netscape browser with Netscape on board you may wish to play with the following codes before you rush to your first tutorial.

Text Book Example

max Z = ctx
s.t.        
Ax <= b
  x >= 0

Manual 1 3 5 7 9  11 13
2 4 6 8 10 12 14

The second tutorial will be on parametric analysis. We shall focus on parametric analysis involving the objective function, more specifically, we shall consider a parametric objective function of the form (c + td)x, where t is a scalar, treated as a parameter. The objective is to optimize the objective function for each t in some given interval T=[t1,t2].

Text Book Example<

max Z = tx1 + x2
s.t.        
Ax <= b
  x >= 0

0 <= t <= oo

Manual 1 2 3 4 5 6 7 8

If you are not familar at all with this topic, have a look at Hillier and Lieberman, 1990, Section 9.3, pp. 307-309].