Big M method

In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm. The Big M method extends the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2016
012319932016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The branch flow based optimal power flow (OPF) problem in radially operated distribution networks can be exactly relaxed to a… (More)
Is this relevant?
2016
2016
In this paper, we address the problem of downlink resource allocation and admission control for an Orthogonal Frequency Division… (More)
  • figure 1
  • table I
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2015
2015
This paper presents Big-M method and Dual Simplex method for optimum time coordination of over current relays in a distribution… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2014
2014
The fuzzy primal simplex method [15] and the fuzzy dual simplex method [17] have been proposed to solve a kind of fuzzy linear… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
  • table 3
Is this relevant?
2014
2014
Train dispatching is critical for the punctuality and reliability of rail operations, especially for a complex rail network. This… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 4
Is this relevant?
2010
2010
The time of operation of overcurrent relays (OCRs) can be reduced, and at the same time coordination can be maintained, by… (More)
  • table I
  • figure 1
  • table IV
  • table II
  • table V
Is this relevant?
2010
2010
We present a Lambertian photometric stereo algorithm robust to specularities and shadows and it is based on a maximum feasible… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2008
2008
This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it… (More)
Is this relevant?
2002
2002
This paper describes a linear programming (LP) formulation applicable to the timing analysis of large scale SOC synchronous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
  • Masakazu MURAMATSUy, Takashi TSUCHIYAz
  • 1993
In this paper, we propose an infeasible-interior-point algorithm for linear programming based on the a ne scaling algorithm by… (More)
Is this relevant?