The paper presents the Mixed-Integer Non-Linear Programming (MINLP) approach to structural optimization. MINLP is a combined discrete/continuous optimization technique, where discrete binary 0-1 variables are defined for optimization of discrete alternatives and continuous variables for optimization of parameters. The MINLP optimization is performed through three steps: i.e. the generation of a...

The aim of this article was to solve a multi-objective maintenance optimization problem by minimizing both unavailability and cost through the use an optimal strategy. took into account three different system designs upon which objective functions are dependent, time start preventive (PM) used as decision variable. This variable optimized for all components using discrete model that allows spec...

Instruction scheduling is an optimization phase aimed at balancing the performance-cost tradeoffs of the design of digital systems. In this paper, a formal framework is tailored in particular to find an optimal solution to the resource-constrained instruction scheduling problem in high-level synthesis. The scheduling problem is formulated as a discrete optimization problem and an efficient popu...

Reactive power optimization is important to ensure power quality, improve system security, and reduce active power loss. So, this paper proposed parallel immune particle swarm optimization (PIPSO) algorithm. This algorithm makes basic particle swarm optimization (BPSO) and discrete particle swarm optimization (DPSO) to optimize in parallel, and improves the convergence capability of particle sw...

this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...

In this paper, a lapped orthogonal transform adapted for local directionality of an image is proposed and its application in adaptive image coding is presented. First, we address the problem to construct the lapped orthogonal transform with short and long functions such that the long functions are twice the length of the short functions, and derive the transform with the optimal short functions...

[6] Lawler, E. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Manag.

This paper proposes a new method for solving Bayesian decision problems. The method consists of representing a Bayesian decision problem as a valuation-based system and applying a fusion algorithm for solving it. The fusion algorithm is a hybrid of local computational methods for computation of marginals of joint probability distributions and the local computational methods for discrete optimiz...