Available options are:
A. direct channel.
B. indirect channel.
C. facilitated channel.
D. customer-service channel.
E. truck jobber channel.
Answer:
A. Direct channel.
Explanation:
The use of direct channel is prominent in the ice-cream industry which sales its products by using a music which triggers the sense that the ice-cream is just at my next step and the products at offers are from low cost to high cost to make maximum sales. The type of channel in which the salesmen sell their product by moving door to door is often refferred to as Direct channel.
Answer:
A group bonus system
Explanation:
In relationship-oriented cultures, group bonuses are very common, and they are not like the regular yearly bonuses given out at Christmas, specially in Japan. In Japan, there are two bonuses per year, one paid during mid-year and the other one at the end of the year. These bonuses can amount to 3-6 months worth of salary, but they are also paid to the whole group of workers. That means that either everyone in the team gets a bonus or no one does.
Relationship-oriented cultures are based upon the well being, motivation and satisfaction of the whole team.
<span> making on time payments on a debt
</span><span> purchasing a large kitchen appliance with cash
</span><span> saving 25% of every paycheck</span>
Answer:
They should operate Mine 1 for 1 hour and Mine 2 for 3 hours to meet the contractual obligations and minimize cost.
Explanation:
The formulation of the linear programming is:
Objective function:
![C=200M_1+160M_2](https://tex.z-dn.net/?f=C%3D200M_1%2B160M_2)
Restrictions:
- High-grade ore: ![6M_1+2M_2\geq12](https://tex.z-dn.net/?f=6M_1%2B2M_2%5Cgeq12)
- Medium-grade ore: ![2M_1+2M_2\geq8](https://tex.z-dn.net/?f=2M_1%2B2M_2%5Cgeq8)
- Low-grade ore: ![4M_1+12M_2\geq24](https://tex.z-dn.net/?f=4M_1%2B12M_2%5Cgeq24)
- No negative hours: ![M_1,M_2\geq0](https://tex.z-dn.net/?f=M_1%2CM_2%5Cgeq0)
We start graphing the restrictions in a M1-M2 plane.
In the figure attached, we have the feasible region, where all the restrictions are validated, and the four points of intersection of 2 restrictions.
In one of this four points lies the minimum cost.
Graphically, we can graph the cost function over this feasible region, with different cost levels. When the line cost intersects one of the four points with the lowest level of cost, this is the optimum combination.
(NOTE: it is best to start with a low guessing of the cost and going up until it reaches one point in the feasible region).
The solution is for the point (M1=1, M2=3), with a cost of C=$680.
The cost function graph is attached.