Open AccessJournal Article
The Evaluation of Parameter M in the Big M Method of Linear Programming
Reads0
Chats0
TLDR
This paper determines a constant M0 and proves that the big M method is convergent to an optimal solution of the primal problem when MM0.Abstract:
In the simplex method of linear programming,there is a big M method(the penalty factor method) for finding an initial feasible basis.The current textbooks of operations research only explain that the big M method is efficient when M is large enough,and never give precise evaluation to the parameter M.This paper determines a constant M0 and proves that the big M method is convergent to an optimal solution of the primal problem when MM0.read more
Citations
More filters
Journal ArticleDOI
A multi-objective optimization model to plan city-scale water systems with economic and environmental objectives: a case study in Santiago, Chile
Daniela Gormaz-Cuevas,Javiera Riffo-Rivas,Ludovic Montastruc,Mariana Brüning-González,Felipe A. Díaz-Alvarado +4 more
TL;DR: In this paper, a multi-objective mixed-integer programming (MOP) problem is formulated to minimize the environmental and economic impact of the network, minimizing water extracted from natural sources and total cost.
References
More filters
Journal ArticleDOI
A multi-objective optimization model to plan city-scale water systems with economic and environmental objectives: a case study in Santiago, Chile
Daniela Gormaz-Cuevas,Javiera Riffo-Rivas,Ludovic Montastruc,Mariana Brüning-González,Felipe A. Díaz-Alvarado +4 more
TL;DR: In this paper, a multi-objective mixed-integer programming (MOP) problem is formulated to minimize the environmental and economic impact of the network, minimizing water extracted from natural sources and total cost.
Related Papers (5)
Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems
An extension of Karmarkar`s algorithm for solving a system of linear homogeneousequations on the simplex
G. de Ghellinck,J.-Ph. Vial +1 more