1. Consider the following Linear Programming problem: Max Z = 5x1 + x2
S. a: X1 + 2x2 > 1
4.x1 + x2 < 0
X1, X2 > 0
(a)
(b) Find the optimal solution of this problem using the Simplex Algorithm.
(c) Is the optimal solution found on the previous question unique? Why?

The graph below shows the price of different numbers of mats at a store: a graph is shown. the values on the x axis are 0, 2, 4, 6, 8, 10. the values on the y axis are 0, 21, 42, 63, 84, and 105. points are shown on ordered pairs 0, 0 and 2, 21 and 4, 42 and 6, 63 and 8, 84. these points are connected by a line. the label on the x axis is number of mats. the title on the y axis is price in dollars. which equation can be used to determine p, the cost of b mats?

Which expression converts 45 degree to radians

Look at the figure below: triangle abc is a right triangle with angle abc equal to 90 degrees. the length of ac is 5 units and the length of ab is 4 units. d is a point above c. triangle adc is a right triangle with angle dac equal to 90 degrees and dc parallel to ab. what is the length, in units, of segment cd?