Results 141 to 150 of about 724 (154)

An exact quadratic programming approach based on convex reformulation for seru scheduling problems

Naval Research Logistics (NRL), 2022
AbstractMotivated by a practical production scheduling problem at a factory, this article studies scheduling problems in seru production system (SPS). Seru is a relatively new‐type production mode originating in Japan and has brought inspiring benefits to production practice.
Zhe Zhang, Xiaoling Song, Xue Gong, Yong Yin, Benjamin Lev, Xiaoyang Zhou   +5 more
openaire   +2 more sources

Unconstrained Reformulation of Sequential Quadratic Programming and Its Application in Convex Optimization

2021
A convex optimization problem with linear equality constraints is solved by the unconstrained minimization of a sequence of convex quadratic functions. The idea of sequential quadratic programming is combined with the concept of regularized gap function to construct an exact differentiable penalty function.
R. Sadhu, C. Nahak, S. P. Dash
openaire   +1 more source

Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations

European Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marie-Christine Plateau, Yasmín Á. Ríos-Solís   +1 more
openaire   +1 more source

Reformulation-Convexification Technique for Quadratic Programs and Some Convex Envelope Characterizations

1999
In the previous chapter, we have presented general concepts and theory for using RLT to solve polynomial problems. In the present chapter, we discuss certain specialized RLT results and implementation strategies, focusing on the global optimization of nonconvex quadratic programming problems.
Hanif D. Sherali, Warren P. Adams
openaire   +1 more source

Convex reformulations of mixed-integer quadratically constrained programs

2013
We present a solution approach for the general problem (QP) of minimizing a quadratic function of integer variables subject to a set of quadratic constraints. The resolution is divided into two phases. The ?rst phase is to reformulate the initial problem as an equivalent quadratic problem which continuous relaxation is convex; the second phase is to ...
Billionnet, Alain, Elloumi, Sourour, Lambert, Amélie   +2 more
openaire   +1 more source

A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program

Optimization, 2022
Jing Zhou, Ye Tian
exaly  

Quadratic convex reformulation for partitioning problems

2017
Lambert, Amélie, Elloumi, Sourour
openaire   +1 more source

Reformulation and solution approach for non-separable integer quadratic programs

Journal of the Operational Research Society, 2015
Dominique Quadri
exaly  

Convex Quadratic Reformulation Applied to the Graph Equicut Problem

2005
Billionnet, Alain, Elloumi, Sourour, Plateau, Marie-Christine   +2 more
openaire   +1 more source

Multi-objective online convex optimization via quadratic distance reformulation with utopian anchoring

Mathematical Methods of Operations Research
Jieyuan Guo, Lizhen Shao, Fangyuan Zhao
openaire   +1 more source