Solve Quadratic Programming Problems - Get Help Here!

angel
Messages
18
Reaction score
0
hi,

Just wondering if anyone knows how to do Quadratic Programming, I'm attempting some questions but I am confused.
So anyone know how to do it?
 
Mathematics news on Phys.org
explain this quadratic programming...
 
an example is provided below which will help u understand it:

a shop produces two types of sweet machines A and B. it costs the shop £40 to make each machine A and £70 to make each machine of B.

from research it is suggested that that if the selling price of A and B are set as F and P then they will sell X of A and Y of B and the relationships are given by:
F=£220-3x and P=£250-2Y

Now how would u formulate this problem, the answer u should get is:

-3x^2-2y^2+180X+180Y
 
What you want to do (assuming reasonable human behavior) is maximize the profit, Pr.
If x of A are produced, and y of B, then the profit is the total selling price, TSP, minus the total cost price, TCP.

Pr = TSP - TCP = TSP(A) - TCP(A) + TSP(B) - TCP(B)
= xF - 40x + yP - 70y, where F and P are as described.

Substituting for F, P, you get

Pr = x(220 - 3x) - 40x +y(250 - 2y) -70y
= 220x - 3x^2 -40x + 250y -2y^2 -70y
= 180x - 3x^2 +180y - 2y^2

That's how you formulate the profit function, which you now want to maximize. The formulation is done the same way as for a LP problem. The difference appears in the function you are optimizing, which is now a quadratic in the variables.
 
thanks a lot for that.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top