Good Morning! Would you please help me code this problem in AMPL? Thank you :)

Please code this problem in AMPL and solve for an optimal solution. You may \hard code" all parameters for this problem as opposed to using a data file.

This is a symbolic linear programming model. Its components are fundamental to all models:

sets, like the products

parameters, like the production and profit rates

variables, whose values the solver is to determine

an objective, to be maximized or minimized

constraints that the solution must satisfy.

Given: P, a set of products

aj = tons per hour of product j, for each j P

b = hours available at the mill

cj = profit per ton of product j, for each j P

uj = maximum tons of product j, for each j P

Define variables: Xj = tons of product j to be made, for each j P

Maximize: cj Xj

jP

Subject to: ( 1/ a j ) Xj b

jP

0 Xj uj, for each Jp

Thank you!!