Site map 

 Contact Graeme 

 Skip Navigation LinksMath Help > Extrema and Linear Programming > Linear Programming > Linear Programming

  . . . . . . google for "linear programming word problem"

Example 1

I've done part (a) and got here:

Minimise P=x1 + x2 + x3

subject to
5x1 + 7x2 + 2x3> 1
3x1 + 8x2 + 4x3> 1
6x1 + 4x2 + 9x3> 1

the dual of which is

Maximise P=y1 + y2 + y3

subject to
5y1 + 3y2 + 6y3< 1
7y1 + 8y2 + 4y3< 1
2y1 + 4y2 + 9y3< 1

But then I have problems constructing an initial simplex tableau and performing iterations.
Could someone help me please.

Answer: . . . . . . identify objective function, constraints, dual, initial simplex tableau, and iterations here.

Internet references 

Math Archives: Linear and Nonlinear programming, a list of topics; many of these pages have links to yet more pages. 

Linear Programming FAQ, from the Optimization Technology Center of Northwestern University and Argonne National Laboratory

Related pages in this website


The webmaster and author of this Math Help site is Graeme McRae.