TY - JOUR

T1 - Tropical optimization problems with application to project scheduling with minimum makespan

AU - Кривулин, Николай Кимович

PY - 2017/9/1

Y1 - 2017/9/1

N2 - We consider multidimensional optimization problems in the framework of tropical mathematics. The problems are formulated to minimize a nonlinear objective function that is defined on vectors over an idempotent semifield and calculated by means of multiplicative conjugate transposition. We start with an unconstrained problem and offer two complete direct solutions to demonstrate different practicable argumentation schemes. The first solution consists of the derivation of a sharp lower bound for the objective function and the solving of an equation to find all vectors that yield the bound. The second is based on extremal properties of the spectral radius of matrices and involves the evaluation of this radius for a certain matrix. This solution is then extended to problems with boundary constraints that specify the feasible solution set by a double inequality, and with a linear inequality constraint given by a matrix. To illustrate one application of the results obtained, we solve problems in project scheduling under the minimum makespan criterion subject to various precedence constraints on the time of initiation and completion of activities in the project. Simple numerical examples are given to show the computational technique used for solutions.

AB - We consider multidimensional optimization problems in the framework of tropical mathematics. The problems are formulated to minimize a nonlinear objective function that is defined on vectors over an idempotent semifield and calculated by means of multiplicative conjugate transposition. We start with an unconstrained problem and offer two complete direct solutions to demonstrate different practicable argumentation schemes. The first solution consists of the derivation of a sharp lower bound for the objective function and the solving of an equation to find all vectors that yield the bound. The second is based on extremal properties of the spectral radius of matrices and involves the evaluation of this radius for a certain matrix. This solution is then extended to problems with boundary constraints that specify the feasible solution set by a double inequality, and with a linear inequality constraint given by a matrix. To illustrate one application of the results obtained, we solve problems in project scheduling under the minimum makespan criterion subject to various precedence constraints on the time of initiation and completion of activities in the project. Simple numerical examples are given to show the computational technique used for solutions.

KW - сonstrained optimization problem

KW - direct solution

KW - idempotent semifield

KW - tropical mathematics

KW - project scheduling

KW - minimum makespan

UR - https://arxiv.org/abs/1403.0268

U2 - 10.1007/s10479-015-1939-9

DO - 10.1007/s10479-015-1939-9

M3 - Article

VL - 256

SP - 75

EP - 92

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -