Search
Search Results
-
Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
In this paper, we are concerned with a set-valued fractional extremal programming problem under inclusion constraints. Our approach consists of using...
-
Fuzzy Combinatorial Optimization Problems
Decision-making is an ongoing process for humankind. Many of these real-world decisions can be modeled using the problems contained in the...
-
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly...
-
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
This paper studies the sum-of-ratios version of the classical minimum spanning tree problem. We describe a branch-and-bound algorithm for solving the...
-
Using the parametric approach to solve the continuous-time linear fractional max–min problems
A numerical algorithm based on parametric approach is proposed in this paper to solve a class of continuous-time linear fractional max-min...
-
An Application of the Modified Subgradient Method for Solving Fuzzy Linear Fractional Programming Problem
We present an application of the “modified subgradient method” to solve a fuzzy linear fractional programming problem. We concentrate on a linear...
-
On generalizations of network design problems with degree bounds
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In...
-
Introduction
The primary objectives of this chapter are to Provide a broad overview of standard optimization techniques. When using optimization techniques:...
-
Multicriteria Portfolio Management
The portfolio management process is an integrated set of steps undertaken in a consistent manner to create and maintain an appropriate portfolio...
-
Subdifferential and optimality conditions for the difference of set-valued map**s
In this paper, an existence theorem of the subgradients for set-valued map**s, which introduced by Borwein (Math Scand 48:189–204,
1981 ), and... -
On Lagrangian duality in vector optimization: applications to the linear case
We recall a general scheme for vector problems based on separation arguments and alternative theorems, and then, this approach is exploited to study...
-
Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
A Dinkelbach-type algorithm is proposed in this paper to solve a class of continuous-time linear fractional programming problems. We shall transform...
-
Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems
This chapter provides a review of decomposition algorithms for models that are formulated as hybrid mixed-integer linear/constraint programming...
-
Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
In this paper we present a new framework for identifying preferred solutions to multi-objective binary optimisation problems. We develop the...
-
Design of robust H ∞-controller for energetic boiler plant
A problem of robust controller design for control of a boiler plant is solved using an H ∞ loop-sha** method with constraints imposed on regional...
-
A reference point technique to compute nondominated solutions in MOLFP
This paper presents a new technique to compute nondominated solutions in multiobjective linear-fractional programming (MOLFP) by using reference...
-
On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization
Various type of optimal solutions of multiobjective optimization problems can be characterized by means of different cones. Provided the partial...
-
Covering Problems
In this chapter, we investigate the behavior of stochastic search algorithms on a class of covering problems. Such problems occur frequently in...
-
An outcome space approach for generalized convex multiplicative programs
This paper addresses the problem of minimizing an arbitrary finite sum of products of two convex functions over a convex set. Nonconvex problems in...