Reverse convex programming
Copyright policy )Reverse convex programming
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.
- University of California, Los Angeles United States
- RAND Corporation United States
pseudo- concave function, Convex programming, reverse convex program, optimality conditions, Numerical mathematical programming methods, Nonlinear programming, cutting plane algorithm, pseudo-convex function, Convexity of real functions in one variable, generalizations, basic solution
pseudo- concave function, Convex programming, reverse convex program, optimality conditions, Numerical mathematical programming methods, Nonlinear programming, cutting plane algorithm, pseudo-convex function, Convexity of real functions in one variable, generalizations, basic solution
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).77 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!