Need Help With Programming

Linear Programming NEED HELP!!!?

There's no reason why you need to call them "x" and "y", of course, but in this case, what you're trying to find is the number of each kind of pill. So we can define:

x = number of red pills
y = number of blue pills

The objective function is what you want to maximise or minimise. In this case, it's the total cost:

f(x,y) = 0.1 x + 0.2 y

Now, the constraints. First off, there are the common-sense constraints. It's impossible to take a negative number of pills. Hence:

x ≥ 0
y ≥ 0

Then, there are the amounts of each vitamin to consider.

Taking vitamin A to start with, you need at least 38 units. Taking x red pills and y blue pills gives you 6x + 4y units of vitamin A. Therefore:

6x + 4y ≥ 38

And similarly:

x + y ≥ 9
2x + 5y ≥ 27

That's the problem in a nutshell.

It looks like you're solving this graphically (rather than, say, using the simplex method), so the next step is to plot the lines:

x = 0
y = 0
6x + 4y = 38
x + y = 9
2x + 5y = 27

If you graph all of these lines and show the feasable region, you'll find that the points of intersection along the edge are:

Point 1 is the solution of:

x = 0
6x + 4y = 38

i.e. x=0, y=19/3

Point 2 is the solution of:

6x + 4y = 38
x + y = 9

i.e. x=1, y=8

Point 3 is the solution of:

x + y = 9
2x + 5y = 27

i.e. x=6, y=3

Point 4 is the solution of:

2x + 5y = 27
y = 0

i.e. x=27/2, y=0

Evaluate the objective function at these four points, and see what you get.

If I'm understanding the question correctly, there is no "maximum" in this problem: You could buy a million of each kind of pill each day and satisfy the constraints. It just wouldn't minimise costs to do so.

Need help with experienced c++ programming.?

okay this is what i have

#include
#include
#include
#include
using namespace std;

const int reg=10;
const int can=20;
void candTotal(int totals[], int candidates, int regions,int in[can][reg])
{
for (int i = 0;i {
cout << i;

int total = 0;
for (int j=0; j {
total = total + in[i][j];
}
totals[i] = total;
}
}

int main()
{
ifstream infile; // input file stream
string fname; // file name
int x, y; // to read input data item
int cnt; // counts no. of input data items

int candidates;
int regions;
int in[can][reg];

//open input file for reading
cout << "Enter input file name: ";
cin >> fname;
infile.open(fname.c_str());
if(!infile)
{
cerr << "Error: Can't open input file." << endl;
return 1;
}

// read data items from input file and store them in array
cout << setw(40) <<"Votes" << endl;
int Region;
infile >> Region;

for(int i = 0; i < Region; ++i)
{
cout << "Region " << setw(2) << i + 1<< "\t";
}

cout << endl;

for(int i = 0; i < Region; ++i)
{
cout << "----------";
cout << "\t";
}
cout << endl;

infile >> regions;
infile >> candidates;
int info[candidates][regions];
int c, r, v;
while(infile)

{
infile >> c >> r >> v;
in[c-1][r-1] = v;
}
int totals[candidates];
candTotal(totals,regions, candidates, in);

infile.close();

return 0;
}


okay, now this compiles but i need it to look like this.

http://boole.cs.atu.edu/~nezu/2203/p01.pdf

im sure that its not very far away from complete but just cant find the right way to get it done. Please Help fast if possible give me a call 479 970 2509

Need HELP with LINEAR PROGRAMMING problem?

Set two variables, one for the gallons of the garlic dressing (G), and one of the gallons of the tofu dressing (T). Now set up one inequality for the total amount of oil used, and one for the total amount of vinegar used.

For example, every quart of garlic dressing needs 2 quarts of oil, and every gallon of the tofu dressing requires 3 quarts of oil. So the total amount of oil used is 2G + 3T. This must be less than or equal to 18, the total quarts of oil Jim has to work with. You can set up a similar inequality for the vinegar.

Also, set up an expression for the profit, which is the expression to maximize. And of course, G > 0 and T > 0, so there are two more inequalities.