Results 21 to 30 of about 1,060,463 (289)
Convex approximations for complete integer recourse models [PDF]
, 2002 We consider convex approximations of the expected value function of a two-stage integer recourse problem. The convex approximations are obtained by perturbing the distribution of the random right-hand side vector.
Vlerk, Maarten H. van der +2 more
core +2 more sources
Mehran University Research Journal of Engineering and Technology, 2020 Economic Dispatch (ED) is one of the major concerns for the efficient and economical operation of the modern power system. Actual ED problem is non-convex in nature due to Ramp Rate Limits (RRL), Valve-Point Loading Effects (VPLE), and Prohibited ...
Hafiz Muhammad Awais +2 more
doaj +1 more source
Convex Optimisation Model for Ship Speed Profile: Optimisation under Fixed Schedule
Journal of Marine Science and Engineering, 2021 We present a novel convex optimisation model for ship speed profile optimisation under varying environmental conditions, with a fixed schedule for the journey.
Janne Huotari +3 more
doaj +1 more source
Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method
International Journal of Aerospace Engineering, 2019 A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal ...
Chun-Mei Yu, Dang-Jun Zhao, Ye Yang
doaj +1 more source
Journal of Numerical Analysis and Approximation Theory, 2004 In [6] one shows that some of the results obtained in [5] on \(E\)-convex programming are incorrect. In this paper we recover these results in the new hypotheses.
Liana Lupşa, Dorel Duca
doaj +2 more sources
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Abstract and Applied Analysis, 2014 This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang +2 more
doaj +1 more source
On Mixed-Integer Random Convex Programs [PDF]
, 2012 We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the
D. Lyons +8 more
core +1 more source
A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, 2014 By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj +1 more source
Upper bounds for packings of spheres of several radii
Forum of Mathematics, Sigma, 2014 We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of
DAVID DE LAAT +2 more
doaj +1 more source
Inexact Restoration Methods for Semivectorial Bilevel Programming Problem on Riemannian Manifolds
Axioms, 2022 For a better understanding of the bilevel programming on Riemannian manifolds, a semivectorial bilevel programming scheme is proposed in this paper. The semivectorial bilevel programming is firstly transformed into a single-level programming problem by ...
Jiagen Liao, Zhongping Wan
doaj +1 more source