Question: Explicitly state the following:

1. Decision Variables: Express the decision variable in mathematical notation, and state what each decision variable stands for in words.
2. Constraints: Write each constraint in mathematical notation, and state what it stands for in words.
3. Objective function: Write the objective in mathematical notation, and state what it stands for in words.
4. Following steps (1) – (3), write the entire model as a linear programming (LP) formulation.
5. Solve the LP using GAMS, and determine the optimal values of: decision variables, objective function, and constraints.

The Lehigh Railroad Company will have four locomotives at IE junction, one locomotive at Centerville junction, and two locomotives at Wayover junction. Student trains, each requiring one locomotive, are at A-station, Fine Place, Goodville, and Somewhere Street. The local map gives the following distances.

FP G

Formulate this problem as a transportation problem , clearly identifying the supply and demand nodes, and determine the optimal allocation of locomotives to stations so that the total distance is minimized.

Price: $2.99

Solution: The downloadable solution consists of 4 pages
Deliverable: Word Document