Tópicos Sugeridos dentro de su búsqueda.
Tópicos Sugeridos dentro de su búsqueda.
1
artículo
Publicado 2012
Enlace
Enlace
In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior. When the coefficients are constant the Simplex Method solves these problems without much difficulty, but when the coefficients are no longer constant and the Simplex does not work. We propose a technique that exploits the convex behavior of these coefficients and uses the theory of approximation by piecewise linear functions.
2
artículo
Publicado 2019
Enlace
Enlace
A network is an acyclic directed graph in which there are sources that have some messages and want to transmit to receivers through the combination of messages in intermediate nodes. The goal is to find a collection of functions that allow to combine messages in order to satisfy the demand of the receivers. In this paper, we study the fractional solvability problem of a network using an extension of the solvability problem in closure operators given by Gadouleau in 2013. We define linear programming problems via the desired extension in order to study capacities; using some information inequalities and characteristic-dependent linear rank inequalities, we obtain upper bounds on linear capacity of some networks and closure operators over some fields.
3
artículo
Publicado 2019
Enlace
Enlace
A network is an acyclic directed graph in which there are sources that have some messages and want to transmit to receivers through the combination of messages in intermediate nodes. The goal is to find a collection of functions that allow to combine messages in order to satisfy the demand of the receivers. In this paper, we study the fractional solvability problem of a network using an extension of the solvability problem in closure operators given by Gadouleau in 2013. We define linear programming problems via the desired extension in order to study capacities; using some information inequalities and characteristic-dependent linear rank inequalities, we obtain upper bounds on linear capacity of some networks and closure operators over some fields.
4
artículo
Publicado 2018
Enlace
Enlace
This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.
5
artículo
Publicado 2018
Enlace
Enlace
This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.
6
artículo
Publicado 2015
Enlace
Enlace
This research work solves the problem of least squares that requires inner elipsoid algorithm to determine the descent direction; giving solution to linear programming problems by means of this methodof interior points. We solve the least squares problem using auxiliary function with logarithmic barrier and an approximation of the original matrix factorization by a matrix of rank one update to nally use the Sherman-Morrison-Woodburry formula and determining the inverse of the current matrix thus solving the least squares problem and obtaining a approximation to the descent direction.
7
artículo
Publicado 2015
Enlace
Enlace
This research work solves the problem of least squares that requires inner elipsoid algorithm to determine the descent direction; giving solution to linear programming problems by means of this methodof interior points. We solve the least squares problem using auxiliary function with logarithmic barrier and an approximation of the original matrix factorization by a matrix of rank one update to nally use the Sherman-Morrison-Woodburry formula and determining the inverse of the current matrix thus solving the least squares problem and obtaining a approximation to the descent direction.
8
artículo
Publicado 2013
Enlace
Enlace
The aim of this study was to develop a high acceptability mixed nectar and low cost. To obtain the nectar mixed considered different amounts of passion fruit, sweet pepino, sucrose, and completing 100% with water, following a two-stage design: screening (using a design of type 23 + 4 center points) and optimization (using a design of type 22 + 2*2 + 4 center points); stages that allow explore a high acceptability formulation. Then we used the technique of Linear Programming to minimize the cost of high acceptability nectar. Result of this process was obtained a mixed nectar optimal acceptability (score of 7), when the formulation is between 9 and 14% of passion fruit, 4 and 5% of sucrose, 73.5% of sweet pepino juice and filling with water to the 100%. Linear Programming possible reduced the cost of nectar mixed with optimal acceptability at S/.174 for a production of 1000 L/day.
9
artículo
Publicado 2013
Enlace
Enlace
The aim of this study was to develop a high acceptability mixed nectar and low cost. To obtain the nectar mixed considered different amounts of passion fruit, sweet pepino, sucrose, and completing 100% with water, following a two-stage design: screening (using a design of type 23 + 4 center points) and optimization (using a design of type 22 + 2*2 + 4 center points); stages that allow explore a high acceptability formulation. Then we used the technique of Linear Programming to minimize the cost of high acceptability nectar. Result of this process was obtained a mixed nectar optimal acceptability (score of 7), when the formulation is between 9 and 14% of passion fruit, 4 and 5% of sucrose, 73.5% of sweet pepino juice and filling with water to the 100%. Linear Programming possible reduced the cost of nectar mixed with optimal acceptability at S/.174 for a production of 1000 L/day.
10
artículo
Publicado 2005
Enlace
Enlace
The article deals in the application of the Mixed Integer Linear Programming (MILP) as a tool for the import planning in the context of a company dealing in the manufacturing and sale of steel components. A mathematical model is built to be adapted for the characteristics of the company import processes and whose objective is to decide which import plan having definitive customs regimen has the minimum total costs. The mathematical pattern is formulated in this first part.
11
artículo
Publicado 2005
Enlace
Enlace
The article deals in the application of the Mixed Integer Linear Programming (MILP) as a tool for the import planning in the context of a company dealing in the manufacturing and sale of steel components. A mathematical model is built to be adapted for the characteristics of the company import processes and whose objective is to decide which import plan having definitive customs regimen has the minimum total costs. The mathematical pattern is formulated in this first part.
12
artículo
Publicado 2020
Enlace
Enlace
In this work the fuzzy formulation of the diet problem in the planning of the nutrition of the farms of laying hens is done, and then it is solved applying the methods proposed by Lai and Hwang and by Zimmermann.Finally, we solve a nutritional planning problem with twelve products of which 4 are diffuse and with 10 nutritional substances.
13
artículo
Publicado 2020
Enlace
Enlace
In this work the fuzzy formulation of the diet problem in the planning of the nutrition of the farms of laying hens is done, and then it is solved applying the methods proposed by Lai and Hwang and by Zimmermann.Finally, we solve a nutritional planning problem with twelve products of which 4 are diffuse and with 10 nutritional substances.
14
artículo
Publicado 2016
Enlace
Enlace
This study develops a planning approach to enable interprovincial land-transport companies to maintain an efficient travel schedule, considering the availability of their medium and long-term resources and the application of revenue management to obtain higher incomes through the use of information technologies. The development of a decision-support system in this sector will allow travel schedule focuses for optimizing the total marginal contribution in the long term, i.e. the difference between incomes and variable costs, as well as an appropriate allocation of resources to the trips, and that the fares established are adequate for the company to reach its goals.
15
artículo
Publicado 2016
Enlace
Enlace
This study develops a planning approach to enable interprovincial land-transport companies to maintain an efficient travel schedule, considering the availability of their medium and long-term resources and the application of revenue management to obtain higher incomes through the use of information technologies. The development of a decision-support system in this sector will allow travel schedule focuses for optimizing the total marginal contribution in the long term, i.e. the difference between incomes and variable costs, as well as an appropriate allocation of resources to the trips, and that the fares established are adequate for the company to reach its goals.
16
artículo
Publicado 2006
Enlace
Enlace
The article deals with the application of the mixed whole linear programming(MWLP) as a tool for the planning of import within the contex of a company devoted to the manufacturing and selling of steel components. A mathematical model is buil that adapts to the characteristics of the import processes of the company, and whose objetive will be to decide which imports plan with a definite regime and with the minimum of total costs will be chosen. In this second part, the results of the mathematical pattem are presented.
17
artículo
Publicado 2006
Enlace
Enlace
The article deals with the application of the mixed whole linear programming(MWLP) as a tool for the planning of import within the contex of a company devoted to the manufacturing and selling of steel components. A mathematical model is buil that adapts to the characteristics of the import processes of the company, and whose objetive will be to decide which imports plan with a definite regime and with the minimum of total costs will be chosen. In this second part, the results of the mathematical pattem are presented.
18
19
artículo
Publicado 2019
Enlace
Enlace
Decision making in mining is a complicated process. Decisions regarding the sizing and allocation of the fleet of trucks to different mines, considering the compliance with production and the total objective cost, are of paramount importance to mining companies as this directly affects their profits. This document presents a model of goal programming (based on linear programming) to optimize mining operations in underground mining taking into account three goals: (a) To minimize deviations from the target production of different minerals, (b) to minimize the surplus of the total designated operating cost and (c) to maximize the use of concentrator plants’ maximum capacity. The model determines the number of trucks needed and provides the optimal allocation to each mine while addressing the goals and limitations of the mining operation. The proposed model was validated using real data f...
20
artículo
Publicado 2019
Enlace
Enlace
Decision making in mining is a complicated process. Decisions regarding the sizing and allocation of the fleet of trucks to different mines, considering the compliance with production and the total objective cost, are of paramount importance to mining companies as this directly affects their profits. This document presents a model of goal programming (based on linear programming) to optimize mining operations in underground mining taking into account three goals: (a) To minimize deviations from the target production of different minerals, (b) to minimize the surplus of the total designated operating cost and (c) to maximize the use of concentrator plants’ maximum capacity. The model determines the number of trucks needed and provides the optimal allocation to each mine while addressing the goals and limitations of the mining operation. The proposed model was validated using real data f...
