scholarly journals Didáctica de la programación lineal con el método gráfico

2007 ◽  
pp. 17
Author(s):  
Fernando León Parada
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Model ◽  
Geometric Analysis ◽  
Linear Programming Model ◽  
Feasible Region ◽  
Optimal Point ◽  
Decision Variables ◽  
Programación Lineal

Every Linear Programming model has a Objective Function determined by the coefficients of the decision variables. The Objective Function can be represented as a line evaluated on an optimal point which slope depends from the variation of the coefficients. The segments adjacent to the optimal point in the Feasible Region can also determine the variation of this slope. Finally a geometric analysis allows to establishing the constraining of the boundary for the Feasible Region keeping as a domain for the Objective Function.

Low Glycemic Index Diets for Subjects With Diabetes by Minimizing Glycemic Load of Individual Foods

2019 ◽  
Vol 7 (1) ◽  
pp. 1-17
Author(s):  
Maximino Navarro Mentado ◽  
Esther Segura Pérez
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Glycemic Index ◽  
Programming Model ◽  
Glycemic Load ◽  
Linear Programming Model ◽  
Macronutrient Content ◽  
Low Glycemic Index

In this article, the authors develop and analyze a linear programming model to obtain an ideal diet for individuals with diabetes by setting the glycemic load as the objective function. Additionally, a standardized system is used in order to facilitate the substitutability of foods present in a diet since those are classified according to their macronutrient content (proteins, lipids, and carbohydrates) and these values are, on average, very similar. Finally, the diet glycemic index is calculated with the model's outcome to corroborate that it is indeed a diet with low glycemic index and that, at the same time, it complies with the nutrient restrictions, which proves that the model can be a useful tool both to generate low glycemic index diets and to restrict certain nutrients from the diet.

scholarly journals Cross-docks scheduling with multiple doors using fuzzy approach

2020 ◽  
Vol 79 (ET.2020) ◽  
pp. 1-18
Author(s):  
Mitra Movassaghi
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Model ◽  
Linear Programming Model ◽  
Mixed Integer ◽  
Non Linear Programming ◽  
Cross Docking ◽  
Proposed Model ◽  
Delivery Routes ◽  
Programming Techniques

One of the most important practices in logistics is Cross-Docking which sets its goals as inventory reduction and customer satisfaction increase. Customers receive goods through docks. Docks are responsible to provide a place for goods before being delivered to the customers. Then, these materials are directly loaded into outbound trucks with little or no storage in between to send to customers in the shortest possible time. This paper is mainly aimed at introducing a mixed integer, non-linear programming model to solve scheduling several cross-docking problems. The proposed model is highly facilitated to allocate the most optimal destinations to storage doors and truck scheduling in docks while selecting the collection and delivery routes. Using optimization approaches at uncertainty conditions is also of great importance. Mathematical programming techniques vividly fail to solve transportation problems that include fuzzy objective function coefficients. A fuzzy multi-objective linear programming model is proposed to solve the transportation decision-making with fuzzy objective function coefficients.

scholarly journals A Mathematical Model for Fuzzyp-Median Problem with Fuzzy Weights and Variables

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Fatemeh Taleshian ◽  
Jafar Fathali
Keyword(s):  
Mathematical Model ◽  
Linear Programming ◽  
Objective Function ◽  
Programming Model ◽  
Fuzzy Linear Programming ◽  
Linear Programming Model ◽  
Median Problem ◽  
Fuzzy Variables ◽  
Fuzzy Weights

We investigate thep-median problem with fuzzy variables and weights of vertices. The fuzzy equalities and inequalities transform to crisp cases by using some technique used in fuzzy linear programming. We show that the fuzzy objective function also can be replaced by crisp functions. Therefore an auxiliary linear programming model is obtained for the fuzzyp-median problem. The results are compared with two previously proposed methods.

scholarly journals Application of Change of Basis in the Simplex Method

2017 ◽  
Vol 11 (1) ◽  
pp. 41
Author(s):  
Mehmet Hakan Özdemir
Keyword(s):  
Linear Programming ◽  
Iterative Method ◽  
Objective Function ◽  
Simplex Method ◽  
Programming Model ◽  
Feasible Region ◽  
Optimal Value ◽  
Linear Programming Problems ◽  
Repeated Use ◽  
Simplex Tableau

The simplex method is a very useful method to solve linear programming problems. It gives us a systematic way of examining the vertices of the feasible region to determine the optimal value of the objective function. It is executed by performing elementary row operations on a matrix that we call the simplex tableau. It is an iterative method that by repeated use gives us the solution to any n variable linear programming model. In this paper, we apply the change of basis to construct following simplex tableaus without applying elementary row operations on the initial simplex tableau.

A Linear Programming Model for Product Mix Profit Maximization in A Small Medium Enterprise Company

2020 ◽  
Vol 6 (1) ◽  
Author(s):  
S Mohd Baki ◽  
Jack Kie Cheng
Keyword(s):  
Linear Programming ◽  
Production Planning ◽  
Business Performance ◽  
Programming Model ◽  
Profit Maximization ◽  
Optimal Level ◽  
Linear Programming Model ◽  
Product Mix ◽  
Small Medium Enterprises ◽  
Medium Enterprises

Production planning is often challenging for small medium enterprises (SMEs) company. Most of the SMEs are having difficulty in determining the optimal level of the production output which can affect their business performance. Product mix optimization is one of the main key for production planning. Many company have used linear programming model in determining the optimal combination of various products that need to be produced in order to maximize profit. Thus, this study aims for profit maximization of a SME company in Malaysia by using linear programming model. The purposes of this study are to identify the current process in the production line and to formulate a linear programming model that would suggest a viable product mix to ensure optimum profitability for the company. ABC Sdn Bhd is selected as a case study company for product mix profit maximization study. Some conclusive observations have been drawn and recommendations have been suggested. This study will provide the company and other companies, particularly in Malaysia, an exposure of linear programming method in making decisions to determine the maximum profit for different product mix.

A Linear Programming Model to Evaluate Gas Availability for Vital Industries in Saudi Arabia

1992 ◽  
Vol 43 (11) ◽  
pp. 1035-1045
Author(s):  
S O Duffuaa ◽  
J A Al-Zayer ◽  
M A Al-Marhoun ◽  
M A Al-Saleh
Keyword(s):  
Saudi Arabia ◽  
Linear Programming ◽  
Programming Model ◽  
Linear Programming Model
Sign in / Sign up

Export Citation Format

Share Document