Back to results

Virginia Tech

A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management

Abstract

dc:description.abstract

This research is primarily concerned with the development of a new algorithm for the general Bilinear Programming Problem (BlP). BLP's are a class of nonlinear, non convex problems that belong to a higher class known as Biconvex Programming Problems (BCP). These problems find numerous applications in engineering, industrial, and management environments. The new algorithm develops a novel Reformulation-Linearization Technique (RlT) that uses an enumeration of variable factors to multiply constraints, and uses constraints to multiply constraints, to generate new nonlinear constraints which are subsequently linearized by defining new variables. The motivation is to transform the nonconvex bilinear problem into a lower bounding linear program that closely approximates the (partial) convex hull of feasible solutions to the problem. when the objective function is accommodated into the constraints through an auxiliary variable. This is equivalent to implicitly constructing tight approximations for the convex envelope of the objective function. The characteristic transformation induced by the Rl T therefore intrinsically yields enhanced lower bounds for use in a branch-and-bound procedure. In particular, we show that this technique actually constructs the exact convex hull representation for special (triangular and quadrilateral) polytopes in R<sup>2</sup>. Our results therefore generalize the convex envelope construction process over rectangular polytopes as done by AI-Khayyal and Falk [1983), and our approach significantly enhances the lower bounding capability of the underlying linear approximation, over that of the latter method.

Degree

thesis:*
Name thesis:degree_name
Ph. D.
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Industrial and Systems Engineering
Department dc:contributor.department
Industrial and Systems Engineering
Grantor dc:publisher
Virginia Tech
Year dc:date.issued
1990

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Alameddine, Amine R.
Chairs dc:contributor.committeechair
  • Sherali, Hanif D.
  • Glickman, Theodore S.
Committee members dc:contributor.committeemember
  • Sarin, Subhash C.
  • Koelling, C. Patrick
  • Sumichrast, Robert T.

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Other
etd-10192005-113325
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/39981

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Alameddine, Amine R.. A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management. doctoral thesis, Virginia Tech, 1990. http://hdl.handle.net/10919/39981