Given the following schedules , plot the demand curve and supply curve in a separate graph.

1.

Demand and Supply Schedules ( 2 graphs )

2.

Price Quantity Demanded Price Quantity Supplied

P2 150 P2 100
4 100 4 120
6 75 6 160
8 60 8 180
10 50 10 210
12 30 12 220

2.Given the following equations, derive demand schedule and supply schedule.

Given :

2.1 Demand Function = Qd = 120,000-20,000 P

If Prices are 1.2.3.4.5 What are the Quantity demanded . Please complete the table below.

PRICE (P) QUANTITY DEMANDED (Qd)

P1 ?
2 ?
3 ?
4 ?
5 ?

2.2 Supply Function using the same prices of P1.2.3.4.and5. please complete the table below.

PRICE ( P) QUANTITY SUPPLIED

P1 ?
2 ?
3 ?
4 ?
5 ?

The JVR Company found that a particular brand of cellphone has the following demand curve;

Qd = 110,000-200P+.03Pop +.6 I +.2 Ad

Where Qd= quantity demanded per month

P = is the price
 Pop = Population

I = Disposable Income

Ad = advertising expenditure

1. Determine the demand curve for the company in a market in which P-300, Pop =800,000,I –
30,000 and A= 15,000

2. Calculate the Qd at prices of P250, 200, 175 and 150

3. Plot the schedule and estimate at what price will demand reach 40,000.

4. Using prices in number 2 , solve for price elasticity of demand using P 200 and P 175 as
P1and P2 respectively.
I constructed a project network, doing forward and backward passes, determining the
project completion time, calculation slack values, and stating the critical path.
我构建了一个项目网络，进行正向和反向传递，确定项目完成时间，计算松弛
值，并说明关键路径。

1-4. I used the node convention here as you will find in Quantitative Methods for
Business by Anderson, Sweeny and Williams. Where A indicates the activity being
described, and t represents the expected activity duration/time. ES is the earliest time the
activity can start; EF is the earliest finish time; LS is the latest start time; and LF is the
latest finish time without extending the minimum completion time of the project.

我在这里使用了节点约定，您可以在 Anderson、Sweeny 和 Williams 的《商业定量

方法》中找到。其中 A 表示正在描述的活动，t 表示预期的活动持续时间/时间。
ES 是活动可以开始的最早时间； EF 为最早完成时间； LS 为最晚开始时间； LF
为不延长项目最短完成时间的最晚完成时间。

I started this with a sketch to make it easier when drawing the full network.
我从草图开始，以便在绘制完整网络时更容易。
Activities A and B have no predecessors so they can begin at start. Activity C needs A to
be completed before it can start. Activity D and Activity E need B to be completed. F and
I needs A. J needs H, G, E. Lastly, K depends on F, J and I. Since K has no successors, it
goes to finish.
活动 A 和 B 没有前导，因此它们可以从头开始。活动 C 需要 A 完成才能开始。活
动 D 和活动 E 需要 B 才能完成。 F 和 I 需要 A。J 需要 H、G、E。最后，K 依赖
于 F、J 和 I。由于 K 没有后继者，因此它会结束。

Here is the network with the activity nodes, displaying letters and times.
这是带有活动节点的网络，显示字母和时间。

5. Slack = LS – ES or LF – EF

Slack = 46 Slack = 0

Slack = 46

Slack = 3 Slack = 3 Slack = 3

Slack = 0

Slack = 0 Slack = 0 Slack = 0

Slack = 29

6. The activities with 0 slacks are called critical activities. And they form the critical path
which is the longest path in the network. So, the critical path here is
B-D-H-J-K.

松弛度为 0 的活动称为关键活动。它们形成了关键路径，这是网络中最长的路径。
以，这里的关键路径是 B-D-H-J-K。