Loading...
Search for: nonlinear-programming
0.01 seconds
Total 161 records

    Chaos control in single mode approximation of T-AFM systems using nonlinear delayed feedback based on sliding mode control

    , Article 2007 Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference ; Volume 3 PART B , 2008 , Pages 725-730 ; ISBN: 9780791848043 Sadeghian, H ; Salarieh, H ; Arjmand, M. T ; Alasty, A ; Sharif University of Technology
    Abstract
    The taping mode Atomic Force Microscopic (T-AFM) can be properly described by a sinusoidal excitation of its base and nonlinear potential interaction with sample. Thus the cantilever may cause chaotic behavior which decreases the performance of the sample topography. In this paper a nonlinear delayed feedback control.is proposed to control.chaos in a single mode approximation of a T-AFM system. Assuming model parameters uncertainties, the first order Unstable Periodic Orbits (UPOs) of the system is stabilized using the sliding nonlinear delayed feedback control. The effectiveness of the presented methods is numerically verified and the results show the high performance of the control.er  

    Pseudospectral optimal control of active magnetic bearing systems

    , Article Scientia Iranica ; Vol. 21, Issue. 5 , 2014 , pp. 1719-1725 ; ISSN: 10263098 Ghorbani, M. T ; Livani, M ; Sharif University of Technology
    Abstract
    In this paper, an optimal control framework is formed to control rotor-Active Magnetic Bearing (AMB) systems. The multi-input-multi-output non-affine model of AMBs is well established in the literature and represents a challenging problem for control design, where the design requirement is to keep the rotor at the bearing centre in the presence of external disturbances. To satisfy the constraints on the states and the control inputs of the AMB nonlinear dynamics, a nonlinear optimal controller is formed to minimize tracking error between the current and desired position of the rotor. To solve the resulted nonlinear constrained optimal control problem, the Gauss Pseudospectral Collocation... 

    An integrated approach for enhancing the quality of the product by combining robust design and customer requirements

    , Article Quality and Reliability Engineering International ; Vol. 30, Issue. 8 , 2014 , pp. 1285-1292 ; ISSN: 07488017 Shahriari, H ; Haji, M. J ; Eslamipoor, R ; Sharif University of Technology
    Abstract
    Enhancing the quality of the product has always been one considerable concern of production process management, and this subject gave way to implementing so many methods including robust design. In this paper, robust design utilizes response surface methodology (RSM) considering the mean and variance of the response variable regarding system design, parameter design, and tolerance design. In this paper, customer requirements and robust design are regarded simultaneously to achieve enriched quality. Subsequently, with a non-linear programming, a novel method for integrating RSM and quality function deployment has been proposed to achieve robustness in design. The customer requirements are... 

    An artificial neural network meta-model for constrained simulation optimization

    , Article Journal of the Operational Research Society ; Vol. 65, issue. 8 , August , 2014 , pp. 1232-1244 ; ISSN: 01605682 Mohammad Nezhad, A ; Mahlooji, H ; Sharif University of Technology
    Abstract
    This paper presents artificial neural network (ANN) meta-models for expensive continuous simulation optimization (SO) with stochastic constraints. These meta-models are used within a sequential experimental design to approximate the objective function and the stochastic constraints. To capture the non-linear nature of the ANN, the SO problem is iteratively approximated via non-linear programming problems whose (near) optimal solutions obtain estimates of the global optima. Following the optimization step, a cutting plane-relaxation scheme is invoked to drop uninformative estimates of the global optima from the experimental design. This approximation is iterated until a terminating condition... 

    Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint

    , Article International Journal of Advanced Manufacturing Technology ; Vol. 70, Issue. 1-4 , January , 2014 , pp. 501-514 ; ISSN: 02683768 Nejati, M ; Mahdavi, I ; Hassanzadeh, R ; Mahdavi-Amiri, N ; Mojarad, M ; Sharif University of Technology
    Abstract
    Lot streaming means breaking a lot into sublots, where sublots may be transferred to a number of machines for the operations. Here, the multi-job lot streaming problem in a multistage hybrid flow shop having identical parallel machines at stages with work-in-process (WIP) jobs, work shifts constraint, and sequence-dependent setup times is studied. The aim is to minimize the sum of weighted completion times of jobs in each shift in order to furnish a better machine utilization for the following shifts. Our model in meeting the job demands appropriates job scheduling onmachines for processing, the sequence of operations on allocated machines, the size of the sublots in the work shifts, the... 

    A queuing approach for a tri-objective manufacturing problem with defects: A tuned Pareto-based genetic algorithm

    , Article International Journal of Advanced Manufacturing Technology ; Vol. 73, issue. 9-12 , May , 2014 , p. 1373-1385 Pasandideh, S. H. R ; Niaki, S. T. A ; Maleki, L ; Sharif University of Technology
    Abstract
    In this research, a manufacturing facility with independent workstations to remanufacture nonconforming products is investigated. Each workstation is first modeled as an M/M/m queuing system with m being a decision variable. Then, a tri-objective integer nonlinear programming models is developed to formulate the problem. The first objective tries to minimize the waiting times of products, while the second one tries to maximize the minimum reliability of machines at the workstations. Since minimization of the waiting times results in using a large number of machines with higher idle times, the third objective is considered to minimize the mean idle time of the machines. The aim is to... 

    Optimal tracking control of an underactuated container ship based on direct Gauss Pseudospectral Method

    , Article Scientia Iranica ; Vol. 21, issue. 6 , 2014 Ghorbani, M. T ; Salarieh, H ; Sharif University of Technology
    Abstract
    In this paper, the problem of optimal tracking control for a container ship is addressed. The multi-input-multi-output nonlinear model of the S175 container ship is well established in the literature and represents a challenging problem for control design, where the design requirement is to follow a commanded maneuver at a desired speed. To satisfy the constraints on the states and the control inputs of the vessel nonlinear dynamics and minimize the heading error, a nonlinear optimal controller is formed. To solve the resulted nonlinear constrained optimal control problem, the Gauss Pseudospectral Method (GPM) is used to transcribe the optimal control problem into a Nonlinear Programming... 

    The robust redundancy allocation problem in series-parallel systems with budgeted uncertainty

    , Article IEEE Transactions on Reliability ; Vol. 63, issue. 1 , February , 2014 , p. 239-250 ; 00189529 Feizollahi, M. J ; Ahmed, S ; Modarres, M ; Sharif University of Technology
    Abstract
    We propose a robust optimization framework to deal with uncertain component reliabilities in redundancy allocation problems in series-parallel systems. The proposed models are based on linearized versions of standard mixed integer nonlinear programming (MINLP) formulations of these problems. We extend the linearized models to address uncertainty by assuming that the component reliabilities belong to a budgeted uncertainty set, and develop robust counterpart models. A key challenge is that, because the models involve nonlinear functions of the uncertain data, classical robust optimization approaches cannot apply directly to construct their robust optimization counterparts. We exploit problem... 

    Replenish-up-to multi-chance-constraint inventory control system under fuzzy random lost-sale and backordered quantities

    , Article Knowledge-Based Systems ; Volume 53 , 2013 , Pages 147-156 ; 09507051 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Meibodi, R. G ; Sharif University of Technology
    2013
    Abstract
    In this paper, a multiproduct multi-chance constraint stochastic inventory control problem is considered, in which the time-periods between two replenishments are assumed independent and identically distributed random variables. For the problem at hand, the decision variables are of integer-type, the service-level is a chance constraint for each product, and the space limitation is another constraint of the problem. Furthermore, shortages are allowed in the forms of fuzzy random quantities of lost sale that are backordered. The developed mathematical formulation of the problem is shown to be a fuzzy random integer-nonlinear programming model. The aim is to determine the maximum level of... 

    Optimizing a multi-vendor multi-retailer vendor managed inventory problem: Two tuned meta-heuristic algorithms

    , Article Knowledge Based Systems ; Volume 50 , September , 2013 , Pages 159-170 ; 09507051 (ISSN) Sadeghi, J ; Mousavi, S. M ; Niaki, S. T. A ; Sadeghi, S ; Sharif University of Technology
    2013
    Abstract
    The vendor-managed inventory (VMI) is a common policy in supply chain management (SCM) to reduce bullwhip effects. Although different applications of VMI have been proposed in the literature, the multi-vendor multi-retailer single-warehouse (MV-MR-SW) case has not been investigated yet. This paper develops a constrained MV-MR-SW supply chain, in which both the space and the annual number of orders of the central warehouse are limited. The goal is to find the order quantities along with the number of shipments received by retailers and vendors such that the total inventory cost of the chain is minimized. Since the problem is formulated into an integer nonlinear programming model, the... 

    A goal programming approach for optimal PMU placement

    , Article International Review on Modelling and Simulations ; Volume 6, Issue 2 , April , 2013 , Pages 490-497 ; 19749821 (ISSN) Khiabani, V ; Hamidi, M ; Farahmand, K ; Aghatehrani, R ; Sharif University of Technology
    2013
    Abstract
    This article proposes a multi-objective goal programming based approach with two objectives of maximizing the reliability and minimizing the placement cost of Phasor Measurement Units (PMUs) for full observability in power systems. The weighted sum goal programming formulation incorporates the reliability of individual PMUs and finds a placement to resolve the conflicting objectives of minimum number of PMUs cost-wise and maximum level of system-wide reliability. This multi-objective problem is formulated as a nonlinear goal programming model in which weights are associated with the objectives. The model is solved for several weight scenarios for the IEEE 14, 30, 57 and 118 bus test systems.... 

    A particle swarm-BFGS algorithm for nonlinear programming problems

    , Article Computers and Operations Research ; Volume 40, Issue 4 , April , 2013 , Pages 963-972 ; 03050548 (ISSN) Mohammad Nezhad, A ; Aliakbari Shandiz, R ; Eshraghniaye Jahromi, A ; Sharif University of Technology
    2013
    Abstract
    This article proposes a hybrid optimization algorithm based on a modified BFGS and particle swarm optimization to solve medium scale nonlinear programs. The hybrid algorithm integrates the modified BFGS into particle swarm optimization to solve augmented Lagrangian penalty function. In doing so, the algorithm launches into a global search over the solution space while keeping a detailed exploration into the neighborhoods. To shed light on the merit of the algorithm, we provide a test bed consisting of 30 test problems to compare our algorithm against two of its variations along with two state-of-the-art nonlinear optimization algorithms. The numerical experiments illustrate that the proposed... 

    Optimizing multiproduct multiconstraint inventory control systems with stochastic period length and emergency order

    , Article Journal of Uncertain Systems ; Volume 7, Issue 1 , 2013 , Pages 58-71 ; 17528909 (ISSN) Taleizadeh, A. A ; Niaki, S.T.A ; Naini, G. J ; Sharif University of Technology
    2013
    Abstract
    While the usual assumptions in multiperiodic inventory control problems are that the orders are placed either at the beginning of each period (periodic review) or depending on the inventory level they can happen at any time (continuous review), in this paper we assume the periods between two replenishments of several products are identical and independent random variables. For the problem at hand, the order quantities (decision variables) are of integertype and there are two kinds of space and service level constraints for each product. A model of the problem is first developed in which a combination of backorder and emergency orders is considered for the shortages, and the costs are... 

    A hybrid method of fuzzy simulation and genetic algorithm to optimize constrained inventory control systems with stochastic replenishments and fuzzy demand

    , Article Information Sciences ; Volume 220 , 2013 , Pages 425-441 ; 00200255 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Aryanezhad, M. B ; Shafii, N ; Sharif University of Technology
    2013
    Abstract
    Multi-periodic inventory control problems are mainly studied by employing one of two assumptions. First, the continuous review, where depending on the inventory level, orders can happen at any time, and next the periodic review, where orders can only be placed at the beginning of each period. In this paper, we relax these assumptions and assume the times between two replenishments are independent random variables. For the problem at hand, the decision variables (the maximum inventory of several products) are of integer-type and there is a single space-constraint. While demands are treated as fuzzy numbers, a combination of back-order and lost-sales is considered for the shortages. We... 

    Voltage security constrained multi-period optimal reactive power flow using benders and optimality condition decompositions

    , Article IEEE Transactions on Power Systems ; Volume 28, Issue 2 , 2013 , Pages 696-708 ; 08858950 (ISSN) Rabiee, A ; Parniani, M ; Sharif University of Technology
    2013
    Abstract
    This paper proposes a new coordinated voltage control scheme to ensure voltage security of power systems. The scheme schedules reactive power injection from VAR sources, including synchronous generators and condensers, capacitor banks, switchable reactors and FACTS devices, to ensure desired loading margin of power systems for a given horizon of time. The problem is treated as voltage security constrained multi-period optimal reactive power flow (VSC-MPORPF). To incorporate scheduling of both continuous and discrete VAR sources, the VSC-MPORPF is formulated as a mixed-integer nonlinear programming problem, and is solved using generalized Benders decomposition (GBD). Multi-period formulation... 

    A comprehensive formulation for railroad blocking problem

    , Article Proceedings - 27th European Conference on Modelling and Simulation, ECMS 2013 ; May , 2013 , Pages 758-763 Hasany, R. M ; Shafahi, Y ; Kazemi, S. F ; Sharif University of Technology
    European Council for Modelling and Simulation  2013
    Abstract
    In rail transportation, there have been several attempts to determine the best routes for shipments (a number of cars with the same origin-destination) through the network. Shipments enter into several intermediate yards on their routes to separate and regroup shipments into new trains. Most of time, every entering into a yard includes excessive delay for shipments; therefore it is an ideal plan that each shipment has been transported by an exclusive train service. Mainly because of restriction on a number of running trains, this plan cannot be adapted in most cases. Finding the optimal route over the rail network with above and other common constraints would be handled by railroad blocking... 

    Analyzing the price skimming strategy for new product pricing

    , Article Scientia Iranica ; Volume 20, Issue 6 , 2013 , Pages 2099-2108 ; 10263098 (ISSN) Shavandi, H ; Zare, A. G ; Sharif University of Technology
    Sharif University of Technology  2013
    Abstract
    This article presents a new model for pricing a new product considering a skimming pricing strategy in the presence of competition. We consider two periods for price setting, including skimming and an economy period. The problem is to decide on skimming as well as economy price, in order to maximize total profit. The derived model is a non-linear programming model and we have analyzed the structure and properties of an optimal solution to develop a solution method. Analytical results, as well as managerial insights, are presented by mathematical and numerical analyses  

    Optimal apogee burn time for low thrust spinning satellite in low altitude

    , Article European Journal of Operational Research ; Volume 222, Issue 2 , 2012 , Pages 386-391 ; 03772217 (ISSN) Fakhri Noushabadi, M ; Assadian, N ; Sharif University of Technology
    2012
    Abstract
    In this study, the optimal burn time for low-thrust impulsive propulsion systems is investigated to raise the perigee altitude of a low-Earth orbit. The maneuver is done using spin-stabilized attitude control and impulsive thrusting system for a time interval centered about apogee point. On the one hand, the low value of the thrust level causes more burn time needed to accomplish the transfer. This, in turn, will cause more thrust loss due to the deviation between the thrust axis (spin axis) and the velocity vector of the satellite. On the other hand, for small thrust duration, the transfer needs more revolutions around the Earth and more travel in lower altitudes with dense atmosphere and... 

    Superlinearly Convergent exact penalty projected structured Hessian updating Schemes for constrained nonlinear least squares: Asymptotic analysis

    , Article Bulletin of the Iranian Mathematical Society ; Volume 38, Issue 3 , 2012 , Pages 767-786 ; 10186301 (ISSN) Mahdavi Amiri, N ; Ansari, M. R ; Sharif University of Technology
    2012
    Abstract
    We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of Nocedal and Overton for handling quasi-Newton updates of projected Hessians. We discuss the comparative results of the testing of our programs and three nonlinear programming codes from KNITRO on some randomly generated test problems due to Bartels and Mahdavi-Amiri. The results indeed confirm the... 

    Multi-facility location problems in the presence of a probabilistic line barrier: A mixed integer quadratic programming model

    , Article International Journal of Production Research ; Volume 50, Issue 15 , Jul , 2012 , Pages 3988-4008 ; 00207543 (ISSN) Shiripour, S ; Mahdavi, I ; Amiri Aref, M ; Mohammadnia Otaghsara, M ; Mahdavi Amiri, N ; Sharif University of Technology
    T&F  2012
    Abstract
    We consider a multi-facility location problem in the presence of a line barrier with the starting point of the barrier uniformly distributed. The objective is to locate n new facilities among m existing facilities minimising the summation of the weighted expected rectilinear barrier distances of the locations of new facilities and new and existing facilities. The proposed problem is designed as a mixed-integer nonlinear programming model, conveniently transformed into a mixed-integer quadratic programming model. The computational results show that the LINGO 9.0 software package is effective in solving problems with small sizes. For large problems, we propose two meta-heuristic algorithms,...