Sciweavers

36 search results - page 2 / 8
» A Shadow Simplex Method for Infinite Linear Programs
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 6 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 5 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
MP
2011
13 years 8 days ago
A first-order interior-point method for linearly constrained smooth optimization
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
JCP
2008
178views more  JCP 2008»
13 years 5 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik
CCE
2005
13 years 5 months ago
Phenotype phase plane analysis using interior point methods
Phenotype phase plane analysis is a linear optimization procedure which can be used to study the value of the objective function (a desired phenotype) as two variables (external s...
Steven L. Bell, Bernhard O. Palsson