From 09ccfb0918cedd4e3ce3a10737752d36eebed7e0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <Andreas.Fabri@geometryfactory.com>
Date: Fri, 28 Apr 2006 14:08:17 +0000
Subject: [PATCH] removed QP solver

---
 Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex
index 88166195092..a645e40d07c 100644
--- a/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex
+++ b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex
@@ -19,7 +19,7 @@ This package provides algorithms for computing inscribed areas of (convex hulls
 
 \begin{ccPkgDescription}{Center Points \label{Pkg:CenterPoints}}
 \ccPkgSummary{
-This package provides algorithms for optimally covering a 2-dimensional point set with k=2,3,4 axis-aligned boxes.}
+This package provides algorithms for optimally covering a 2-dimensional point set with $k=2,3,4$ axis-aligned boxes.}
 
 %\ccPkgDependsOn{}
 \ccPkgIntroducedInCGAL{2.4}
@@ -45,9 +45,9 @@ This package provides an algorithm for computing the smallest sphere containing
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}
 
-\begin{ccPkgDescription}{Advanced Techniques \label{Pkg:OptAdvancedTechniques}}
+\begin{ccPkgDescription}{Matrix Search \label{Pkg:OptAdvancedTechniques}}
 \ccPkgSummary{
-This package provides abstract optimisation frameworks that can be used to model many concrete problems. One framework is monotone matrix search, the other one (to be documented in future releases) is convex quadratic programming (including linear programming). }
+This package provides an abstract optimisation frameworks that can be used to model many concrete problems.}
 
 %\ccPkgDependsOn{}
 \ccPkgIntroducedInCGAL{2.4}