Results 291 to 300 of about 6,410,351 (366)
Some of the next articles are maybe not open access.
1987
Abstract This is the second of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It introduces convexity conditions, and shows where they have effect, together with Slater's condition, in assuring the existence of a support to the limit function, so providing ...
openaire +2 more sources
Abstract This is the second of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It introduces convexity conditions, and shows where they have effect, together with Slater's condition, in assuring the existence of a support to the limit function, so providing ...
openaire +2 more sources
Convex programming for disjunctive convex optimization
Mathematical Programming, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ceria, Sebastián, Soares, João
openaire +1 more source
CONVEX: A COMPUTER PROGRAM FOR SOLVING CONVEX PROGRAMS
1970Abstract : The report describes a computer program implementing the Hartley- Hocking convex programming algorithm. The two parts of this report are, respectively, a description of the Hartley-Hocking method as extracted from the original paper, and the documentation of the computer program.
H. H. Oxspring +3 more
openaire +1 more source
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grossmann, Ignacio E., Lee, Sangbum
openaire +2 more sources
Convex Quadratic Programming Approach
Journal of Global Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Mathematische Operationsforschung und Statistik. Series Optimization, 1982
We will prove that a generalized convex programming problem is normal if and only if a sequence of appropriately disturbed problems converges in value to the value of the undisturbed problem. The generalization consists in admitting for so-called supremal points, a notion closely related to Paeeto-optimal points.
openaire +1 more source
We will prove that a generalized convex programming problem is normal if and only if a sequence of appropriately disturbed problems converges in value to the value of the undisturbed problem. The generalization consists in admitting for so-called supremal points, a notion closely related to Paeeto-optimal points.
openaire +1 more source
Applied Mathematics & Optimization, 1980
Reverse convex programs generally have disconnected feasible regions. Basic solutions are defined and properties of the latter and of the convex hull of the feasible region are derived. Solution procedures are discussed and a cutting plane algorithm is developed.
Hillestad, Richard J. +1 more
openaire +1 more source
Reverse convex programs generally have disconnected feasible regions. Basic solutions are defined and properties of the latter and of the convex hull of the feasible region are derived. Solution procedures are discussed and a cutting plane algorithm is developed.
Hillestad, Richard J. +1 more
openaire +1 more source
Journal of the Society for Industrial and Applied Mathematics, 1963
Introduction. In their paper, Newton's Method for Convex Programming and Tchebycheff Approximation [1], E. WV. Cheney and A. A. Goldstein consider the following problem: "Given a convex continuous function F defined on a closed convex subset K of En, obtain (if such exists) a point x of K such that F(x) ?
openaire +2 more sources
Introduction. In their paper, Newton's Method for Convex Programming and Tchebycheff Approximation [1], E. WV. Cheney and A. A. Goldstein consider the following problem: "Given a convex continuous function F defined on a closed convex subset K of En, obtain (if such exists) a point x of K such that F(x) ?
openaire +2 more sources
E-Convex Sets, E-Convex Functions, and E-Convex Programming
Journal of Optimization Theory and Applications, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Variant of nontandard convex programming
Siberian Mathematical Journal, 1987Rules for computing subdifferentials of convex operators with infinitesimal accuracy are derived. Applications to convex minimization problems are considered. The exposition is based on internal set theory, invented by \textit{E. Nelson} [Bull. Am. Math. Soc. 83, 1165-1198 (1977; Zbl 0373.02040)].
openaire +3 more sources