#### Filter Results:

#### Publication Year

1997

2010

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The paper describes a software package called LaGO for solving nonconvex mixed integer nonlinear programs (MINLPs). The main component of LaGO is a convex relaxation which is used for generating solution candidates and computing lower bounds of the optimal value. The relaxation is generated by reformulating the given MINLP as a block-separable problem, and… (More)

The purpose of this paper is threefold. First we propose splitting schemes for re-formulating non-separable problems as block-separable problems. Second we show that the Lagrangian dual of a block-separable mixed-integer all-quadratic program (MIQQP) can be formulated as an eigenvalue optimization problem keeping the block-separable structure. Finally we… (More)

We present a Branch and Cut algorithm of the software package LaGO to solve nonconvex mixed-integer nonlinear programs (MINLPs). A linear outer approximation is constructed from a convex relaxation of the problem. Since we do not require an algebraic representation of the problem, reformulation techniques for the construction of the convex relaxation cannot… (More)

This paper presents a smoothing heuristic for an NP-hard combinatorial problem. Starting with a convex Lagrangian relaxation, a pathfollowing method is applied to obtain good solutions while gradually transforming the relaxed problem into the original problem formulated with an exact penalty function. Starting points are drawn using different sampling… (More)

The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based cogeneration plant. The optimization problem is formulated as a non-convex mixed-integer nonlinear problem (MINLP) and solved by the MINLP solver LaGO. The algorithm generates a… (More)

scenario probabilities N(I) nodes of scenario tree defined by scenarios in I t(n) timestage of node n T number of timestages Task: For scenarios I with tree N(I), find scenarios J ⊂ I and probabilities p J j , j ∈ J, such that |val(MSP[J]) − val(MSP[I])| and |J| are small. 1.: val(MSP[J]) ≫ val(MSP[J ′ ]) (∆ 1 ≫ 0) min x ∑ j∈J ∑ j ′ ∈J ′ : j(j ′)= j p J ′ j… (More)

- ‹
- 1
- ›