Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1996

[Date Index] [Thread Index] [Author Index]

Search the Archive

How to Solve a Quadratic Programming problem?

  • To: mathgroup at
  • Subject: [mg4198] How to Solve a Quadratic Programming problem?
  • From: daniele rizzi <drizzi at>
  • Date: Thu, 13 Jun 1996 23:10:18 -0400
  • Sender: owner-wri-mathgroup at

Hello all,

I'd like to solve a QP problem, in the following form:

min translate(x)*H*x

subject to  translate(E)*x = E_f
            \sum_{i=1}^n x_i = 1
            0 <= x_i <= 1  \forall i \in (1, n)
where : x is a n-term solution vector;
        E is a n-term constrain vector;
        E_f is a parameter of the problem;
        H is a n x n-term Symmetric Positive (semi)Definite Matrix.

Mathematica is quite good at solving linear constrained (LP) problems
 (via Simplex-based routines) and general unconstrained instances, 
but what about quadratic objective function? Is there some "ready-made"
routine or have I to write down my own code to tackle with that?

Thanks for you support.

daniele rizzi
(drizzi at


  • Prev by Date: Re: Notebook printing on unix?
  • Next by Date: Re: Kei Ker from Bessel functions
  • Previous by thread: Fractal Dimension
  • Next by thread: Re: How to Solve a Quadratic Programming problem?