The Experts below are selected from a list of 48 Experts worldwide ranked by ideXlab platform

Colin Drury - One of the best experts on this subject based on the ideXlab platform.

Keshava Prasad. Halemane - One of the best experts on this subject based on the ideXlab platform.

  • Symmetric primal dual simplex pivoting decision strategy (spdspds) for linear programming
    arXiv: Optimization and Control, 2014
    Co-Authors: Keshava Prasad. Halemane
    Abstract:

    The Symmetric Primal-Dual Simplex Pivoting Decision Strategy (spdspds) is a novel iterative algorithm to solve linear programming (LP) problems. Each iteration is based on a systematic selection and application of one among the newly identified set of four (or possibly six) distinct types of simplex pivots defined over a symmetric primal-dual pair of LP. The two (or possibly four) types of classical (standard) simplex pivots are the Primal Standard Pivot with positive (or zero) indicator, and the Dual Standard Pivot with negative (or zero) indicator. The two newly identified pivot types are: the Primal Tricky Pivot with positive indicator and the Dual Tricky Pivot with negative indicator. If more than one candidate pivot element/cell is of the same type, then a selection among them can be made based on a measure of goodness that is defined as the decrease in the infeasibility index of such cells. If further pivoting is not possible, then the Tableau is checked for the terminal type to facilitate the problem classification. An analysis of the evolution of the Tableau data entries pattern observed as the iterations proceed is also presented. A classification of the LP problem into one of the six types is identified based on the data entries pattern observed in the Final Tableau.

Angappa Gunasekaran - One of the best experts on this subject based on the ideXlab platform.

  • An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
    International Journal of Mathematics in Operational Research, 2013
    Co-Authors: Hossein Arsham, Angappa Gunasekaran
    Abstract:

    We have developed a full gradient method that consists of three phases. The initialisation phase provides the initial Tableau that may not have a full set of basis. The push phase uses a full gradient vector of the objective function to obtain a feasible vertex. This is then followed by a series of pivotal steps using the sub-gradient, which leads to an optimal solution (if exists) in the Final iteration phase. At each of these iterations, the sub-gradient provides the desired direction of motion within the feasible region. The algorithm hits and/or moves on the constraint hyper-planes and their intersections to reach an optimal vertex (if exists). The algorithm works in the original decision variables and slack/surplus space, therefore, there is no need to introduce any new extra variables such as artificial variables. The simplex solution algorithm can be considered as a sub-more efficient. Given a linear programme has a known unique non-degenerate primal/dual solution; we develop the largest sensitivity region for linear programming models-based only the optimal solution rather than the Final Tableau. It allows for simultaneous, dependent/independent changes on the cost coefficients and the right-hand side of constraint. Numerical illustrative examples are given.

Hossein Arsham - One of the best experts on this subject based on the ideXlab platform.

  • An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
    International Journal of Mathematics in Operational Research, 2013
    Co-Authors: Hossein Arsham, Angappa Gunasekaran
    Abstract:

    We have developed a full gradient method that consists of three phases. The initialisation phase provides the initial Tableau that may not have a full set of basis. The push phase uses a full gradient vector of the objective function to obtain a feasible vertex. This is then followed by a series of pivotal steps using the sub-gradient, which leads to an optimal solution (if exists) in the Final iteration phase. At each of these iterations, the sub-gradient provides the desired direction of motion within the feasible region. The algorithm hits and/or moves on the constraint hyper-planes and their intersections to reach an optimal vertex (if exists). The algorithm works in the original decision variables and slack/surplus space, therefore, there is no need to introduce any new extra variables such as artificial variables. The simplex solution algorithm can be considered as a sub-more efficient. Given a linear programme has a known unique non-degenerate primal/dual solution; we develop the largest sensitivity region for linear programming models-based only the optimal solution rather than the Final Tableau. It allows for simultaneous, dependent/independent changes on the cost coefficients and the right-hand side of constraint. Numerical illustrative examples are given.

Richard Smith - One of the best experts on this subject based on the ideXlab platform.

  • Film-Philosophy 18 (2014): Special Section on Stanley Cavell www.film-philosophy.com 70 Montage and Tableau in
    2016
    Co-Authors: Stella Dallas, Richard Smith
    Abstract:

    In 1979, Jeff Wall produced a photographic Tableau called Picture for Women. This work and others by Wall have been considered as part of a return to painting, or pictures. Wall himself refers to some of his works as cinematographs, and in a Prologue to a book on Stanley Kubrick’s photography (Wall 2005), Wall makes a somewhat prosaic argument that each frame of cinematographic film is a photograph, suggesting the importance of film history to his own pictures, but stressing also the notion that the photograph we have is a mere position, a snapshot that passes even before can locate it—in cinematic terms the still image we have here is perhaps not even visible. The central positioning of the camera suggests a synthesis of Dziga Vertov’s famous kino-eye image, and Charles Baudelaire’s notion of the painter of modern life, though it here appears as a parallel-mirroring, or perhaps (doubling) of the woman’s gaze, further suggesting contemporary concepts of the gaze, as if this picture were indeed a history picture, a picture of modern history of the photographic gaze. At about the same time that Wall produced and exhibited Picture for Women the ‘picture’, or Tableau, appeared as a decisive stylistic, formalistic issue in debates about maternal melodrama, or the woman’s picture. Linda Williams ’ essay ‘Something Else Besides a Mother ’ very clearly places the Final Tableau of King Vidor’s Stella Dallas (1937) at the centre of the discussion of melodrama. Her essay begins with a quote from Marilyn French’s novel The Women’s Room in which Val, a mother, recalls the Final scene of Stella Dallas