Mathematical model of linear programming

The mathematical model of linear programming is given by a linear function of several variables, in which you want to determine non-negative values ​​for said variables that maximize or minimize the value of the linear function, subject to a number of limitations.

Formulation of the mathematical model

Find the values ​​of xj that make the value of the linear function maximum or minimum (Objective function). And that satisfy the constraint system Where for each constraint one of the signs xj is used – Decision variables cj – Economic coefficients aij – Technological coefficients bj – Independent term

  • Decision variables: Unknowns of the model, what is sought with its solution. Activities or products that compete for material, technical resources, available time, etc.
  • Economic coefficients: Coefficients of the objective function for each activity or product. Contribution of each decision variable to the objective function, such as profit or cost per unit of product.
  • Technological coefficients: Coefficients on the left side of the constraints: Represent, for example, units of a resource necessary to produce a unit of a product, hours of die-cutting time by type of materials to die-cut, hours in the oven per unit of cast part , etc.
  • Independent terms: Terms on the right side of the restrictions: They represent the availability or demand of resources, such as man-hours, machine-hours, space, money, raw material, quality requirements, production capacity, maximum quantity or minimum, etc.

Steps for Formulation of the mathematical model

  1. Determine the decision variables and express them algebraically.
  2. Determine the constraints and express them as equations or inequalities depending on the decision variables
  3. Express all the conditions implicitly established by the nature of the variables: that they cannot be negative, that they are integers, that they can only take certain values, …
  4. Determine the objective function.

 

Leave a Comment

Scroll to Top