DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0743265
Title:
On Polaroid Intersections
Corporate Author:
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Report Date:
1972-04-01
Abstract:
Polaroid sets and functions have been introduced as a new tool, with applications in non-linear programming, particularly in quasi-concave and integer optimization problems over a linearly constrained set of feasible solutions. The name polar programming applies to a general class of non-linear mathematical programming problems which can be solved by the polaroid approach. In integer programming polaroids yield non-trivial extensions of the intersection cut approach. The paper builds on the properties of polaroid sets particularly complete convex polaroids and focuses on the following intersection problem Given a point x bar belonging to the polaroid set P, find the intersection point u of a one-dimensional ray u with the boundary of P.
Descriptive Note:
Research rept.
Pages:
0022
Distribution Statement:
Availability: Document partially illegible.
Contract Number:
N00014-67-A-0314-0007
File Size:
0.92MB
