Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

In this chapter, we will learn about a method that is mathematically equivalent to the Simplex Method but which can exploit… Expand

2013

2013

This study proposes a novel technique for solving Linear Programming Problems in a fully fuzzy environment. A modified version of… Expand

2013

2013

The determination of the factors influencing the effectiveness of algorithm visualization poses an interesting research question… Expand

2011

2011

The Simplex algorithm is a well known method to solve linear programming (LP) problems. In this paper, we propose a parallel… Expand

2010

2010

Recently, fuzzy simplex algorithms have been proposed for two kinds of fuzzy linear programming problems such as: 1) linear… Expand

2005

2005

The revised simplex method is often the method of choice when solving large scale sparse linear programming problems… Expand

2005

2005

We revise the dual projective pivot algorithm using sparse rectangular LU factors. In each iteration, the proposed algorithm… Expand

1998

1998

This paper deals with the incremental detection of implicit equalities using the revised simplex method. This algorithm is more… Expand

1977

1977

Subroutine ARSME solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily… Expand

Highly Cited

1973

Highly Cited

1973

For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the… Expand