Now showing items 21-30 of 8748
A Strategy to Solve the Multistage Transmission Expansion Planning Problem
(Institute of Electrical and Electronics Engineers (IEEE), 2011-11-01)
In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear ...
Analog nonderivative optimizers
Analog networks for solving convex nonlinear unconstrained programming problems without using gradient information of the objective function are proposed. The one-dimensional net can be used as a building block in ...
An inexact-restoration method for nonlinear bilevel programming problems
(SpringerNew YorkEUA, 2009)
A Lagrangian bound for many-to-many assignment problems
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem ...