Simple Polaroids for Non-Convex Quadratic Programming

Abstract

The paper presents an application of polaroid wets; in the first section the author shows how bilinear polaroid bifunctions can be defined for an arbitrary quadratic function. The second section establishes two properties (convexity and validity) of the corresponding polaroid sets; this allows one to define valid cutting planes for the Quadratic Program: 'optimize an arbitrary quadratic function over an arbitrary (closed) set of feasible solution.' A third section describes the structure of polaroids in relation to a given polyhedral feasible set.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1972
Accession Number
AD0744676

Entities

People

  • Claude-alain Burdet

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Sets
  • Decomposition
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Optimization
  • Quadratic Programming
  • Schools
  • Statistics
  • Supply Chain Management
  • Theorems
  • Universities

Readers

  • Operations Research