Question: AMPL -Linear programming help I finished the first phase of my project figuring out the constraints and decisions variables. I need help with the second
AMPL -Linear programming help
I finished the first phase of my project figuring out the constraints and decisions variables. I need help with the second phase.
The second phase of this project will focus on AMPL implementation of your model. Given the model developed in Phase I, you will code a .mod and a .dat file that successfully solves the problem. The model and data files should include comments to explain each file, as well as comments explaining the implementation of your model in AMPL. This phase will be graded based on the implementation of your model in AMPL format. It should compile, solve, and produce a result. The credit earned in this phase is centered around whether your model from Phase I can be implemented into AMPL, and whether or not it solves.
Decision Variable:
E is for all English speaking operators that arrive at i shift 1..7.
S is for all Spanish speaking operators that arrive at i shift 1..5.
Objective function for operators:
Minimize z = z = 80(E1+E2+S1+S2) + 84(E3+S3) + 88(E4+S4) + 44E5 + 48E6
Constraints:
E1>=5, (time 7am 9am)
E2>=12, (time 9am 11am)
E1+E3>=9, (time 11am 1pm)
E2+E4>=14, (time 1pm 3pm)
E3+E5+E6>=12, (time 3pm 5pm)
E4+E6+E7>=4, (time 5pm 7pm)
E5+E7>=2, (time 7pm 9pm)
S1>=2, (time 7am 9am)
S2>=3, (time 9am 11am)
S1+S3>=3, (time 11am 1pm)
S2+S4>=4, (time 1pm 3pm)
S3+S5>=3, (time 3pm 5pm)
s4>=1, (time 5pm 7pm)
S5>=1, (time 7pm 9pm)
and
E1..E7 >= 0, S1..S5 >= 0 (non-negativity)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
