Nonlinear-programming reformulation of the order-value optimization problem
نویسندگان
چکیده
منابع مشابه
Nonlinear-programming reformulation of the order-value optimization problem
Order-value optimization (OVO) is a generalization of the minimax problem motivated by decision-making problems under uncertainty and by robust estimation. New optimality conditions for this nonsmooth optimization problem are derived. An equivalent mathematical programming problem with equilibrium constraints is deduced. The relation between OVO and this nonlinear-programming reformulation is s...
متن کاملA linear programming reformulation of the standard quadratic optimization problem
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NPhard, and contains the maximum stable set problem in graphs as a special case. In this note we show that the SQO problem may be reformulated as an (exponentially sized) linear program.
متن کاملDesign Optimization Problem Reformulation Using Singular Value Decomposition
This paper presents a design optimization problem reformulation method based on Singular Value Decomposition (SVD), dimensionality reduction, and unsupervised clustering. The method calculates linear approximations of the associative patterns of symbol co-occurrences in a design problem representation to infer induced interaction/coupling strengths between variables and constraints. Unsupervise...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولA Boxed Optimization Reformulation for the Convex Second Order Cone Programming
By using the the equivalent expression of the second order cone, we reformulate the convex second order cone programming as a boxed constrained optimization, which is a nonlinear programming with four nonnegative constraints. We give the conditions under which the stationary point of the reformulation problem solve the original problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2005
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s001860400410