Polaroids: A New Tool in Non-Convex and in Integer Programming

Abstract

The paper presents a generalization, called polaroid, of the concept of polar sets. A list of properties satisfied by polaroids is established indicating that the new concept may be fruitfully used in an area of non-convex (called here polar) programming as well as in integer programming, by means of polaroid cuts; this class of new cuts contains the ones defined by Tuy for concave programming (a special case of polar programming) and by Balas for integer programming; it furthermore provides for new degrees of freedom in the construction of algorithms in the above-mentioned areas of mathematical programming.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1972
Accession Number
AD0744677

Entities

People

  • Claude-alain Burdet

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Programming
  • Construction
  • Evolutionary Algorithms
  • Inclusions
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Optimization
  • Schools
  • Universities

Readers

  • Operations Research