lineal programation models

lineal programation models

1. technique used in the management of operations. It aims to optimize resources in business activities.

   • Some requirements are:
     • Maximize or minimize some amount. In an organization profits are maximized and costs are decreased.
     • Has restrictions that limit the production and sale of goods.
     • There are different alternatives for choosing the production of goods.
     • The objective function and restrictions must be expressed in linear equations.

2. Elements of the models:

   • Decision variables (Xj) define the levels of manufacture and sale.
   • Objective function: Seeks the maximization of income or the minimization of the cost of production.
   • Limited resources: It is the availability of materials or resources that are available for the manufacture of products or services.

3. Some restrictions can be:

   • Demand restrictions: It is the quantity of products or services that the company must offer, to cover the demand.
   • Supply restrictions: Refers to the minimum quantity of goods that must be sold to cover fixed expenses.
   • Restriction of non-negativity: The quantity of goods manufactured and sold must be greater than or equal to zero.

4. Graphic solution of the models: Illustration that represents the suitable areas for production.

   • Constraints: These are usually lines with a cutoff point at X and Y that delimit the feasible area.
   • Feasible area: Area delimited by the restrictions, it can vary depending on whether you want to maximize or minimize.
   • Optimal point: It is a point within the feasible area that indicates the most convenient point for production.

Images and files in the map