Are you sure you don't mean SUBscript?
Did you set up a tableau?
Can you find the intersections of the constraints?
You may wish to hunt around x1 = 0 and x2 = 12, I suppose.
Someone please help me with this.
Hard Math Question?
Minimize Z=9x1 + 4x2 + 12x3
The 1,2, and 3 are superscript.
Subject to the constraints:
3x1+x2+4x3 larger or equal to 24
3x1 + x2 + 2x3 larger or equal to 18
x1 >= 0, x2 >=0, x3 larger or equal to 0
What is Z, x1, x2, and x3?
All numbers after letter are superscript. Thanks!
Subtract both inequalities to get:
Since we're looking for the minimum values that'll satisfy both inequalities, we'll set and find that:
We want to somehow use this inequality in your equation for z to simplify your equation. You can do that by modifying the equation a bit (we also substitute as that'll minimize the value of z):
And since , you could probably figure out what value of to choose and solve for
Hello, Greenbaumenom!
This is a Linear Programming problem.
. . Are you familiar with the techniques?
I'll solve it by "graphing".
Minimize: .
Subject to the constraints:.
Find
[1], [2], [3] places us in the first octant.
[4] is a plane with intercepts: .
Graph the plane and shade the space above the plane.
[5] is a plane with intercepts: .
Graph the plane and shade the space above the plane.
The solution set is a polyhderon with vertices at:
. .
Test these vertices in the -function to find the minimum