Integration of a primal simplex network algorithm with a large-scale mathematical programming system

1985 ◽  
Vol 11 (1) ◽  
pp. 1-11 ◽  
Author(s):  
J. A. Tomlin ◽  
J. S. Welch
Keyword(s):  
Mathematical Programming ◽  
Large Scale ◽  
Programming System ◽  
Network Algorithm

scholarly journals A Matheuristic Approach Combining Local Search and Mathematical Programming

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Carolina Lagos ◽  
Guillermo Guerrero ◽  
Enrique Cabrera ◽  
Stefanie Niklander ◽  
Franklin Johnson ◽  
...  
Keyword(s):  
Mathematical Programming ◽  
Local Search ◽  
Large Scale ◽  
Search Algorithm ◽  
Facility Location Problem ◽  
Specific Information ◽  
Local Search Algorithm ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location ◽  
Installation Cost

A novel matheuristic approach is presented and tested on a well-known optimisation problem, namely, capacitated facility location problem (CFLP). The algorithm combines local search and mathematical programming. While the local search algorithm is used to select a subset of promising facilities, mathematical programming strategies are used to solve the subproblem to optimality. Proposed local search is influenced by instance-specific information such as installation cost and the distance between customers and facilities. The algorithm is tested on large instances of the CFLP, where neither local search nor mathematical programming is able to find good quality solutions within acceptable computational times. Our approach is shown to be a very competitive alternative to solve large-scale instances for the CFLP.

Parameter estimation in kinetic models for large scale biotechnological systems with advanced mathematical programming techniques

2014 ◽  
Vol 83 ◽  
pp. 104-115 ◽  
Author(s):  
Jimena Di Maggio ◽  
Cecilia Paulo ◽  
Vanina Estrada ◽  
Nora Perotti ◽  
Juan C. Diaz Ricci ◽  
...  
Keyword(s):  
Parameter Estimation ◽  
Mathematical Programming ◽  
Kinetic Models ◽  
Large Scale ◽  
Programming Techniques

Latest Advances on Benders Decomposition

2018 ◽  
pp. 5411-5421 ◽  
Author(s):  
Antonios Fragkogios ◽  
Georgios K. D. Saharidis
Keyword(s):  
Mathematical Programming ◽  
Operations Research ◽  
Decomposition Method ◽  
Large Scale ◽  
Benders Decomposition ◽  
Information Science ◽  
Solution Process ◽  
Cpu Time ◽  
Mathematical Problems ◽  
Modern Economic

Operations Research and Mathematical Programming together with Information Science and Technology are tools used to solve various problems in the modern economic environment. This chapter addresses the Benders Decomposition method, which is used for the solution of problems of Operations Research. This method, applied to certain large-scale mathematical problems, can make their solution feasible (if they cannot be solved with another procedure) or can accelerate the solution process in terms of CPU time. The authors provide a thorough presentation of how the decomposition of a problem is made and the Benders algorithm is applied for its solution. Main purpose of this chapter is to analyze the recent studies that address the method's weaknesses and accelerate its application for the faster solution of mathematical problems. A large number of papers is presented and the contribution of each one of them to the improvement of the method is described.

Sign in / Sign up

Export Citation Format

Share Document