Question

Jake’s is a burger restaurant that sells two main types of burgers. The company earns $6 on type 1 burger it sells and $10 on each type 2 burger. The burger paddies that Jake’s uses are actually preprepared by another company. The supplier has a special order to fill for another customer and cannot ship more than 80 type 1 and 75 type 2 burger paddies to Jake’s per day. The employees at Jake’s must spend about 2 minutes preparing each type 1 burger they sell. They spend roughly 3 minutes to complete this process for type 2 burger. They expect to have about 301 minutes available for this purpose during each day. The store’s management is fairly certain that they can sell all the burgers for which they order paddies but are unsure how many type 1 and type 2 paddies they should order to maximize profits.

a) (2 Points) Formulate an LP model for this problem.

Answer 1

Objective function refers to the function that is either maximized or minimized. The constraints may be equalities or inequalities. So, in linear programming problems, linear objective functions are minimized or maximized which is subject to linear constraints. Thus, in a linear programming problem the objective function and the constraints must be linear functions of the decision variables.