I need to measure minutes to and from work versus the time of day I leave. The objective is to find the time of the day that takes the least amount of time to get to work from the data given.

I would like the results to include a bell curve if possible. What would be the best form of measure: linear regression or null hypothesis. Discuss confidence intervals usefulness based on the number of data points.

Your goal is to find the time of the day that takes the least amount of time to get to work from the data given. In other words, you want find the average length of a one-way commute for each of your departure times (4 am, 9 am, 11 pm, etc.) and figure out which departure time gives you the shortest commute.

----------------------------

First, let's see if times vary by day:

[see Excel workbook]

It seems as if Sunday has the shortest commutes. You leave on Sundays at 9 am (one week at 8 am) and return at 8 pm (one week at 7 pm). So, if it turns out that the shortest commute is either at 9 am or 8 pm, you might want to consider if the quick commute is a result of the time or the day of the week.

----------------------------

Now, onto the real question. Let's look at the data sorted by time:

Time Average Average (no bad ...

Solution Summary

The solution presents an analysis of the data to answer the question "What departure time has the shortest average commute time?"

Interpret the following SPSS computer output for the chi-square test. Variable COMMUTE is "How did you get to work last week?" Variable GENDER is "Are you male or female?"
GENDER

Consider the following shortest-route problem involving seven cities. The distances between the cities are given below. Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7
Path Distance
1 to 2 6
1 to 3 10
1 to 4 7
2 to 3

A production line consists of two main workstations: an assembly workstation and a packaging workstation. The processing times for 11 jobs (in minutes) that must be processed on these two workstations are given below. There is plenty of space in between the workstations such that blocking does not occur. Find the optimal job seq

I have the answer but I am wanting to understand the answer. Please see the attached file.
Chapter 17 Page 684 Number 3.
Seven Jobs must be processed in two operations: A and B. All Seven jobs must go through A and B in that sequence - A first, then B. Determine the optimal order in which the jobs should be sequenced th

Please see the attached file for the fully formatted problems.
1. Shortest Path and Maximal Flow Problem (30%): You are given the following directed network.
[NETWORK]
a. (Shortest Path Problem 15%) Let the numbers on the arcs represent distances and find the shortest path from node 1 to node 9.
b. (Maximal Flow

Consider the following greedy strategy for finding a shortest path from vertex start to vertex goal in a connected graph.
1: Initialize path to start.
2: Initialize VisitedVertices to {start}.
3: If start=goal, return path and exit. Otherwise, continue.
4: Find the edge (start,v) of the minimum weight such that v is adjace