Question

Consider Paul Jordan's following linear programming formulation:

Minimize	$ 4$4Upper X 1X1plus+	$ 2$2Upper X 2X2
11Upper X 1X1plus+		33Upper X 2X2	greater than or equals≥	7575	(Upper C 1C1 )
88Upper X 1X1plus+		22Upper X 2X2	greater than or equals≥	160160	(Upper C 2C2 )
33Upper X 1X1plus+		22Upper X 2X2	greater than or equals≥	120120	(Upper C 3C3 )
		11Upper X 2X2	less than or equals≤	7070	(Upper C 4C4 )
Upper X 1X1 ,		Upper X 2X2greater than or equals≥0

a) On the graph on right, constraints

Upper C 1C1 ,

Upper C 2C2 ,

Upper C 3C3 ,

and

Upper C 4C4have

been plotted.

Using the point drawing

tool ,

plot all the corner points for the feasible area.

The optimum solution is:

Upper X 1X1

=

nothing

(round your response to two decimal places).

Upper X 2X2

=

nothing

(round your response to two decimal places).

b) Optimal solution value 'Z' =

nothing

(round your response to two decimal places).

Answer 1

Looks like there is a lot of duplicate values and the “Upper” is everywhere for some reason. Ignoring that, the equation seems to be

Minimize 4x1 + 2x2

S.T.

1x1 + 3x2 >= 75

8x1 + 2x2 >= 160

3x1 + 2x2 >= 120

1x2 <= 70

x1, x2 >= 0

The solution

x1 = 8

x2 = 48

Z = 128