Abstract
is commonly referred to as a problem. We propose to investigate here an iterative procedure for solving a certain class of mathematical programming problems which we shall designate as convex problems. Let Em+, be the (m + 1)-dimensional euclidean space of (m + 1) tuples p = (PO X pi , * * * , m) (called points or vectors), let Em be the horizontal subspace of points (0, pi, * *, Pm), let Ao be the vertical axis containing points (po, 0, -*, 0) whose negative direction we describe as lower and let a prime represent the orthogonal projection of a point or a set on En. Thus p = (0, pi, * P* ,Pm) A = {(0, a1, , ,am) i a = (a', a1, ... am) E A We also let
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Society for Industrial and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
