A Keyboard that originally costs $475 is marked down 15% for a sale what is the New reduced price of the keyboard?
2 answers:
You might be interested in
Answer:
Maximum = 540 at (6,14)
Minimum = 300 at (0,10) or (12,2).
Step-by-step explanation:
The given linear programming problem is
Minimize and maximize: P = 20x + 30y
Subject to constraint,
.... (1)
.... (2)
.... (3)
The related equation of given inequalities are
Table of values are:
For inequality (1).
x y
0 10
15 0
For inequality (2).
x y
0 26
13 0
For inequality (3).
x y
0 10
15 0
Pot these ordered pairs on a coordinate plane and connect them draw the corresponding related line.
Check each inequality by (0,0).
False
True
True
It means (0,0) is included in the shaded region of inequality (2) and (3), and (0,0) is not included in the shaded region of inequality (1).
From the below graph it is clear that the vertices of feasible region are (0,10), (6,14) and (12,2).
Calculate the values of objective function on vertices of feasible region.
Point P = 20x + 30y
(0,10) P = 20(0) + 30(10) = 300
(6,14) P = 20(6) + 30(14) = 540
(12,2) P = 20(12) + 30(2) = 300
It means objective function is maximum at (6,14) and minimum at (0,10) or (12,2).
Answer: Horizontal
Step-by-step explanation: The equation <em>y = -2</em> can be thought of as y = 0x - 2. So our line has a slope of 0 and a y-intercept of -2.
To graph it, we start with the y-intercept, down 2 units on the y-axis. Now, if the slope of a line is 0, then the line must be flat or horizontal.
So we just draw a horizontal line through the y-intercept of -2.
In fact, when the equation of any line reads y = a number, it's graph will always be a horizontal line. For example, y = 3, y = -10, y = -8 and so on.
Image provided below.
