Accession Number:

ADA022686

Title:

Necessary and Sufficient Conditions for a Pareto-Optimum in Convex Programming.

Descriptive Note:

Research rept.,

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

• Ben-Israel,A.
• Ben-Tal,A.
• Charnes,A.

Report Date:

1976-01-01

Pagination or Media Count:

20.0

Abstract:

Necessary and sufficient conditions for Pareto optimality are derived for problems involving convex criteria and convex constraints. For a wide class of convex functions, the characterization of Pareto optimality is given in terms of systems of linear programs, which, under suitable regularization conditions, reduce to a single linear program. The consideration of a system of linear programs and their duals leads naturally to a system of partial prices associated with a Pareto optimum. Author

Descriptors:

• *ECONOMICS
• *ADAPTIVE SYSTEMS
• *OPERATIONS RESEARCH
• *CONVEX SETS
• OPTIMIZATION
• INDUSTRIAL PRODUCTION
• PROBLEM SOLVING
• SYSTEMS ANALYSIS
• INDUSTRIAL ENGINEERING
• CYBERNETICS

Subject Categories:

• Economics and Cost Analysis
• Theoretical Mathematics
• Operations Research
• Manufacturing and Industrial Engineering and Control of Production Systems
• Bionics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE