MATHEMATICAL PROGRAMMING IN PARTIALLY ORDERED BANACH SPACES.

Abstract

The purpose of this paper is to derive several necessary and sufficient conditions for the optimal solution of a mathematical programming problem in partially ordered Banach spaces. It is assumed that the objective function of this problem is defined by a nonlinear operator and its feasible domain is determined by a finite number of operator equations and inequalities as well as the restriction of the variable to an arbitrary convex set. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1968
Accession Number
AD0679493

Entities

People

  • K. Ritter

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Banach Space
  • Computer Programming
  • Convex Sets
  • Equations
  • Inequalities
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Systems Analysis and Design

Technology Areas

  • Space