Sciweavers

1723 search results - page 72 / 345
» Cycling in linear programming problems
Sort
View
OL
2007
133views more  OL 2007»
15 years 2 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
AUTOMATICA
2011
14 years 10 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
15 years 9 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 8 months ago
A new approach to virtual design for spatial configuration problems
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
Carlos Calderon, Marc Cavazza, Daniel Diaz
NETWORKS
2006
15 years 3 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith