Below is the computer solution to a linear programming problem linear programming

	X1	X2		RHS	Shadow Price
Maximize	40	30
Constraint 1	0.4	0.5	<=	20	33.3333
Constraint 2	0.0	0.2	<=	5	0
Constraint 3	0.6	0.3	<=	21	44.4444
Solution	25	20

Sensitivity Analysis

Variable	Value	Reduced cost	Original value	Lower bound	Upper bound
X1	25	0	40	24	60
X2	20	0	30	20	60
Constraint	Shadow Price	Slack/surplus	Original value	Lower bound	Upper bound
Constraint 1	33.3333	0	20	14.00	21.50
Constraint 2	0	1	5	4.00	Infinity
Constraint 3	44.4444	0	21	18.75	30.00

Note: The Reduced Cost is often referred to as the Coefficient Sensitivity.

For the above information, answer the following questions. Provide your answers based on the above information and explain your answers in terms of this information.

a) Write the objective function in equation form and write the constraints as equalities or inequalities.