FFSQP is a Fortran implementation of the FSQP optimization algorithm 
developed by E.R. Panier, A.L. Tits, J.L. Zhou, and C.T. Lawrence.
Information on FFSQP can be found in the FSQP home page at
     http://www.aemdesign.com

The FFSQP distribution consists of the following files:
  COPYRITE
  README (this file)
  Version*
  ffsqp.f
  qld.f
  sampl1.f
  sampl2.f
  sampl3.f
  manual.ps
which, except for ffsqp.f, are available from the FSQP home page.
The source file ffsqp.f is available by e-mail.

We suggest that you keep all these files in a dedicated subdirectory.
File manual.ps is a postscript file, and should be printed for details
on the algorithm and use of FFSQP.

All the FFSQP routines are in ffsqp.f.  FFSQP requires a quadratic 
program solver.  As distributed,  it calls QLD (written by 
Klaus Schittkowski, provided in file qld.f for the user's convenience).  
Three sample test problems are given in sampl1.f, sampl2.f and sampl3.f. 
Thus, for example, to run sample1.f one should use the following 
compiling sequence on a UNIX-based system

        f77  sampl1.f ffsqp.f qld.f

The results obtained should be compared with those given in the 
User's Guide.

File manual.ps is a postscript file containing the User's Guide.

Finally, the file Versionx.x lists the enhancements in the
successive versions of FFSQP.

Please send us your comments.  Any feedback is highly appreciated.
And, when you have a chance, visit our home page.
You may want to check out information on ADIFFSQP, our interface
between FFSQP and automatic differentiation preprocessor ADIFOR.