Skip to search formSkip to main contentSkip to account menu

Bilinear program

In mathematics, a bilinear program is a nonlinear optimization problem whose objective or constraint functions are bilinear. An example is the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
List of numerical analysis topics

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs
We consider the vertex separator problem on a graph: find a set of vertices of minimum cost whose removal disconnects the graph… 
2013
2013
A CONTINUOUS QUADRATIC PROGRAMMING FORMULATION OF THE VERTEX SEPARATOR PROBLEM ∗
The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph into… 
2013
2013
Pooling problems : relaxations and discretizations
The classical minimum cost network flow problem seeks to find the optimal way of sending raw materials from a set of suppliers to… 
2012
2012
An Implementation of Integer Programming Techniques in Clustering Algorithm
This paper mainly deals with the analysis of IPP in clustering. Clustering is exemplified by the unsupervised learning of… 
2010
2010
Bilinear Programming and Protein Structure Alignment
Proteins are a primary functional component of organic life, and understanding their function is integral to many areas of… 
2008
2008
Modeling Piecewise Under-and Overestimators for Bilinear Process Network Synthesis via Mixed-integer Linear Programming
Piecewise underand overestimators that rely on mixed-integer linear programming (MILP) have been recently proposed for the global… 
Review
2001
Review
2001
Concavity Cuts for Disjoint Bilinear Programming Concavity Cuts for Disjoint Bilinear Programming
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent… 
1997
1997
Chain Queries Expressible by Linear Datalog Programs
We study the linearisability of chain queries and identify a new class of linearisable chain queries, referred to as pseudo… 
1980
1980
Rectilinear Distance Location-Allocation Problem: A Simplex Based Algorithm
Professor Charnes was the first to recognize the potentialities of adjacent extreme point methods to solve nonlinear problems… 
1976
1976
On A characterization of optimality in convex programming
Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)