Results 11 to 20 of about 1,060,463 (289)
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S, Letchford, Adam
core +4 more sources
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +6 more sources
LINEAR PROGRAMMING APPLIED TO A CONVEX PROGRAMMING TYPE
Pesquimat, 2014 In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior.
Edinson Raúl Montoro Alegre +3 more
doaj +1 more source
Componentwise Fractional Programming with Application to Resource Allocation [PDF]
Modeling, Identification and Control, 1983 A fractional programming problem is considered of the maximization of the ratio of a concave and a convex function, with each variable occurring in a single convex component constraint.
Kåre M. Mjelde
doaj +1 more source
Global Optimization for the Sum of Concave-Convex Ratios Problem
Journal of Applied Mathematics, 2014 This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1).
XueGang Zhou, JiHui Yang
doaj +1 more source
Journal of Applied Mathematics, 2011 Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for
Le Quang Thuy +2 more
doaj +1 more source
A Multi-Step Inertial Proximal Peaceman-Rachford Splitting Method for Separable Convex Programming
IEEE Access, 2023 In this paper, we propose a multi-step inertial proximal Peaceman-Rachford splitting method (abbreviated as MIP-PRSM) for solving the two-block separable convex optimization problems with linear constraints, which is a unified framework for such Peaceman-
Hongyan Li, Dongmei Yu, Leifu Gao
doaj +1 more source
Properties of Answer Set Programming with Convex Generalized Atoms [PDF]
In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized ...
Alviano, Mario, Faber, Wolfgang
core +3 more sources
Journal of Inequalities and Applications, 2023 In this paper, we present an inexact multiblock alternating direction method for the point-contact friction model of the force-optimization problem (FOP).
Yaling Zhang, Xuewen Mu
doaj +1 more source
Midcourse Guidance Trajectory Optimization of Interceptor Missile Based on Sequential Convex Programming [PDF]
Hangkong bingqi, 2023 Aiming at the trajectory optimization problem of interceptor midcourse guidance under strong nonlinear multi-constraint conditions, a trajectory optimization algorithm for fixed time constraints is proposed based on sequential convex programming method ...
Li Jiong, Zhang Jinlin, Shao Lei, Li Wanli, He Yangchao
doaj +1 more source