logo-site
Sci Math

Article Contents

1. Titles

2. Authors

3. DOI

4. Publisher

5. Publication year

6. Abstract

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

Authors: Lê Dũng Mưu, Thái Quỳnh Phong, Phạm Đình Tảo,

https://doi.org/10.1007/BF01300871

Publisher, magazine: ,

Publication year: 1995

  Lưu        Trích dẫn         Chia sẻ

Abstract

We develop convergent decomposition branch and bound algorithms for solving a class of bilinear programming problems. As an application of the proposed method, we apply it to quadratic programs with a few negative eigenvalues, and to a class of mixed integer programming problems.

Tags: bilinear programming, quadratic minimization, quadratic mixed integer, decomposition method, adaptive bisection

Trở lại

Các bài viết liên quan đến tác giả Lê Dũng Mưu

Coupling the Banach contraction mapping principle and the proximal point algorithm for solving monotone variational inequalities

Implementable quadratic regularization methods for solving pseudomonotone equilibrium prob\-lems.

Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem

On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs

Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem

Using the Banach contraction principle to implement the proximal point method for multivalued monotone variational inequalities

Lagrangian duality algorithms for finding a global optimal solution to mathematical programs with affine equilibrium constraints

A convex-concave programming method for optimizing over the efficient set

Simplicially-constrained DC optimization over efficient and weakly efficient sets

Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem