scholarly journals SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS

2017 ◽  
Vol 60 (4) ◽  
pp. 419-428
Author(s):  
Shinji Mizuno ◽  
Noriyoshi Sukegawa ◽  
Antoine Deza
Keyword(s):  
Simplex Methods

scholarly journals Linear programming measures for solving the problem of a linear division of convex multiplayers.

2018 ◽  
Vol 10 (2) ◽  
Author(s):  
Sarmad H. Ali ◽  
Osamah A. Ali ◽  
Samir C. Ajmi
Keyword(s):  
Machine Learning ◽  
Linear Programming ◽  
Optimal Solution ◽  
Optimal Method ◽  
Linear Separation ◽  
Different Types ◽  
Simplex Methods

In this research, we are trying to solve Simplex methods which are used for successively improving solution and finding the optimal solution, by using different types of methods Linear, the concept of linear separation is widely used in the study of machine learning, through this study we will find the optimal method to solve by comparing the time consumed by both Quadric and Fisher methods.

Parameter optimization in modelling unsteady compound channel flows

1992 ◽  
Vol 19 (3) ◽  
pp. 441-446 ◽  
Author(s):  
Habib Abida ◽  
Ronald D. Townsend
Keyword(s):  
Parameter Optimization ◽  
Optimization Methods ◽  
Flood Plain ◽  
Flood Routing ◽  
Compound Channel ◽  
Flood Events ◽  
Channel Section ◽  
Simplex Methods ◽  
Boundary Roughness ◽  
Good Agreement

Optimization methods are used to estimate data for routing floods through open compound channels (main channels with flood plain zones). These data include the irregular channel section geometry and the varying boundary roughness. Differences between simulated and observed stages and discharges are minimized using three optimization algorithms: Powell's method, Rosenbrock's algorithm, and the Nelder and Meade simplex method. Powells' method performed poorly; however, both the Rosenbrock and simplex methods yielded good results. The estimated data using the Rosenbrock and simplex methods were used to route different flood events observed in a laboratory channel. Simulated peak stages and discharges were in good agreement with those estimated using actual routing data. Key words: compound channel, flood routing, lateral momentum transfer, optimization, unsteady flow.

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

1995 ◽  
Vol 7 (4) ◽  
pp. 402-416 ◽  
Author(s):  
Jonathan Eckstein ◽  
İ. İlkay Boduroğlu ◽  
Lazaros C. Polymenakos ◽  
Donald Goldfarb
Keyword(s):  
Data Parallel ◽  
Parallel Implementations ◽  
Connection Machine ◽  
Simplex Methods

scholarly journals On the relationship between regression analysis and mathematical programming

2004 ◽  
Vol 8 (2) ◽  
pp. 131-140 ◽  
Author(s):  
Dong Qian Wang ◽  
Stefanka Chukova ◽  
C. D. Lai
Keyword(s):  
Regression Analysis ◽  
Mathematical Programming ◽  
Quadratic Programming ◽  
Operations Research ◽  
Optimization Problems ◽  
The Other ◽  
Linear Quadratic ◽  
Quadratic Programming Problems ◽  
Simplex Methods ◽  
The Relationship

The interaction between linear, quadratic programming and regression analysis are explored by both statistical and operations research methods. Estimation and optimization problems are formulated in two different ways: on one hand linear and quadratic programming problems are formulated and solved by statistical methods, and on the other hand the solution of the linear regression model with constraints makes use of the simplex methods of linear or quadratic programming. Examples are given to illustrate the ideas.

Strongly polynomial dual simplex methods for the maximum flow problem

1998 ◽  
Vol 80 (1) ◽  
pp. 17-33 ◽  
Author(s):  
Ronald D. Armstrong ◽  
Wei Chen ◽  
Donald Goldfarb ◽  
Zhiying Jin
Keyword(s):  
Flow Problem ◽  
Maximum Flow ◽  
Maximum Flow Problem ◽  
Dual Simplex ◽  
Simplex Methods ◽  
Strongly Polynomial

Design and optimization of modified simplex methods

1985 ◽  
Vol 167 ◽  
pp. 1-10 ◽  
Author(s):  
A. Gustavsson ◽  
J-E. Sundkvist
Keyword(s):  
Design And Optimization ◽  
Simplex Methods
Sign in / Sign up

Export Citation Format

Share Document