simplex method, how to easiest understand its concept ?
102346
Below is a link to a simplified tutorial.
861163
First you graph the feasible region.  Let x be the number of burritos sold, y the number of nachos.  10<= x <= 40.  This gives you a vertical band, shading between a vertical line crossing the x-axis at 10 and one crossing the x-axis at 40.  Likewise 30<= y <= 70 gives you a shaded band between horizontal lines that cross the y-axis at 30 and 70.  Where they overlap you have a rectangle.  The final constraint is x+y <= 90, which slices off the top right corner of the rectangle.\n\nNow you need to know the coordinates of the corners.  Bottom left is (10,30), top left is (10,70), bottom right is (40,30), upper top right is (20,70) and lower top right is (40,50).\n\nFinally, your profit function is P = 0.95x + 0.45y.  It's slope is a little steeper than -2, and will reach a maximum at a corner of the feasible region far from (0,0).  \n\nTry it at the upper top right: .95(20)+.45(70) = 50.50\nTry it at the lower top right: .95(40)+.45(50) = 60.50.  So max profit with 40 burritos and 50 nachos.
958876
A simple algorithm is to first take all n(n-1)/2 pairs of points. Each pair defines a line, count how many of the remaining points lie on the line. This will be a cubic algorithm in n, the number of points.\n\nA clever algorithm using sorting takes time O( n^2 log n). See the Sources.
356197
OK, here is what is going on and then the answer:\n\nFirst, assuming that we have the array a (which we assume we do according the problem), then this algorithm is going to look at each item in an array and will assign B a value. The value B holds will be true only if B was true to start and the current item in the array is less than the next.\n\nTherefore if the array A was defined as follows:\n\na[0] = 1\na[1] = 2\na[2] = 3\na[3] = 5\na[4] = 6\na[5] = 8\n\nThe algorithm checks if a[0] <= a[1], and since it is and B is true as well, then B is set to true;\nthen we check a[1] <= a[2], and this is true. Since B is true and this is true, B is set to true. \nthen we check a[2] <= a[3], and this is true. Since B is true and this is true, B is set to true.\nthen we check a[3] <= a[4], and this is true. Since B is true and this is true, B is set to true.\nthen we check a[4] <= a[5], and this is true. Since B is true and this is true, B is set to true.\n\nTherefore it can be determined that as long as the items in the array keep increasing or staying the same (or non-decreasing) then the algorithm will end with B true. So, Answer D is the correct answer.\n\n\nGood luck!
49666
If you are saying simplify then:\nx = The square root of [5x] +2.5\nx = The square root of [5x] +2.5\nx = The square root of [12.5] +2.5\nx = The square root of [12.5] +2.5
945623
Here is a few loop methods you can use...\nBe sure you have a text box named TextBox1\n\neach will be devided with.\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nDim X As Integer=0\nDim U As Integer=TextBox1.Text\n\nDo Untill X = U\nMsgBox X\nX=(X+1)\nLoop\n\n~~~~~~~~~~~OR~~~~~~~~~~~~~~\nDim X As Integer\nFor X = 0 To TextBox1.Text\nMsgBox X\nNext
639859
its simple..see\n\n2x + 3y = 1 -------- 1st expression\n5x + 3y = 16 ------- 2nd expression\n\nnow..first take 1st expression\n\nStep 1: 2x + 3y = 1\n        2x = 1 - 3y\n        x = (1 - 3y) / 2  -------- this is value of x\n\nnow..take 2nd expression\n\nStep 2: 5x + 3y = 16\n        5(1 - 3y) / 2 + 3y = 16  ---here put the value of x\n        2.5(1 - 3y) + 3y = 16\n        2.5 - 7.5y + 3y = 16\n        2.5 - 16 = 7.5y - 3y\n        -13.5 = 4.5y\n        y = -13.5 / 4.5\n        y = -3 ------ this is value of y\n\nNow again put the value of y in the 1st expression\n\nStep 3: 2x + 3y = 1\n        2x + 3(-3) = 1\n        2x - 9 = 1\n        2x = 1 + 9\n         2x = 10\n         x = 10 / 2\n         x = 5\n\nSo, final value of x = 5 and value of y = -3 \n\nHope ya understand ;-)
741552
You have got it right.\nthe answer is\n\nf(x) = 3x
578465
The easiest way to do this is to count back from the end of the array.\n\nFor instance, if an array has three values, \n$item[0], $item[1] and $item[2] then you can access the last with:\n$item[-1]... an easy way to reach it!
816805
i doubt u got it right. this is how u do it:\n\nfirst u group them \n\n(x³-3x²)+(4x-12)\n\nthen simplify each binomial\n\nx²(x-3)+4(x-3)\n\nthen since (x-3) are the same on both of them u group them together\n\n(x²+4)(x-3)\n\nand there u have it
643577
very simple\ni dont calculate\ni guess
274876
by inspection I can understand another point will be...\n\n(0, 5) because if you add 1 to X you must add 2 to Y
1066492
x = -4\n10points thank u!
961595
umm..are you missing an equals sign somewhere or am i really dumb? how do you figure out what x is unless you have both sides of the equation?
473974
Try this: http://en.wikipedia.org/wiki/Newton's_method
865560
A. Just multiply CF and then subract the resulting matrix from C. Is there something specific about the required operations you don't understand?
211814
2x^2 +3x-6 well that is as simple as it can get unless you have a number for the variable x