Cauliflower leaf powder (CLP), a biosorbent prepared from seasonal agricultural crop waste material, has been employed as a prospective adsorbent for the removal of a basic dye, methylene blue (MB) from aqueous solution by the batch adsorption method under varying conditions, namely, initial dye concentration, adsorbent dose, solution pH, and temperature. Characterization of the material by FTI...

We construct a family of globally defined dynamical systems for a nonlinear programming problem, such that: (a) the equilibrium points are the unknown (and sought) critical points of the problem, (b) for every initial condition, the solution of the corresponding initial value problem converges to the set of critical points, (c) every strict local minimum is locally asymptotically stable, (d) th...

In this paper the nite criss-cross method is generalized to solve hyperbolic programming problems. Just as in the case of linear or quadratic programming the criss-cross method can be initialized with any, not necessarily feasible basic solution. Finiteness of the procedure is proved under the usual mild assumptions. Some small numerical examples illustrate the main features of the algorithm.

In model identification, calibration or sensitivity analysis, the model-parameter values may be required to yield model-output values that satisfy specified constraints, for given initial conditions and forcing. Inequality constraints on scalar functions of the model outputs (henceforth called output bounds) confine the parameters to their feasible set. Output bounds are fundamental to regional...

Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast execu...

A co-ordination mechanism is proposed for multi-agent production-distribution co-operative scheduling problems, based on a purely temporal perspective. This mechanism is based on communication among pairs of client-supplier agents involved in the problem, and allows agents to locally perceive hard global temporal constraints. By exchanging limited specific information, the agents are able to re...

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solut...

In the Broadcast Scheduling Problem (BSP), a finite set of wireless stations are to be scheduled in a time division multiple access frame. The objective is to provide a collision free broadcast schedule which minimizes the total frame length and maximizes the slot utilization within the frame. We present a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. GRASP is a two-phase met...

To solve the problems of Engineering and Management Science Generalized Assignment Problem (GAP) plays a very important role. The GAP is a classical example of a difficult combinatorial optimization problem that has received considerable attention over the years due to its widespread applications. In many instances it appears as a substructure in more complicated models, including routing probl...