Multilevel Optimization: Algorithms and Applications by Yang Chen, Michael Florian (auth.), Athanasios Migdalas,

By Yang Chen, Michael Florian (auth.), Athanasios Migdalas, Panos M. Pardalos, Peter Värbrand (eds.)

Researchers operating with nonlinear programming frequently declare "the note is non­ linear" indicating that actual functions require nonlinear modeling. an analogous is correct for different parts resembling multi-objective programming (there are continually a number of pursuits in a true application), stochastic programming (all facts is uncer­ tain and as a result stochastic versions may be used), etc. during this spirit we declare: The note is multilevel. in lots of selection approaches there's a hierarchy of selection makers, and judgements are made at diversified degrees during this hierarchy. a method to deal with such hierar­ chies is to target one point and contain different degrees' behaviors as assumptions. Multilevel programming is the learn sector that makes a speciality of the full hierar­ chy constitution. by way of modeling, the constraint area linked to a multilevel programming challenge is implicitly made up our minds through a chain of opti­ mization difficulties which has to be solved in a predetermined series. If basically degrees are thought of, now we have one chief (associated with the higher point) and one follower (associated with the decrease level).

Show description

Read or Download Multilevel Optimization: Algorithms and Applications PDF

Best algorithms books

Computational Geometry: An Introduction Through Randomized Algorithms

This creation to computational geometry is designed for newcomers. It emphasizes uncomplicated randomized equipment, constructing uncomplicated rules with the aid of planar purposes, starting with deterministic algorithms and moving to randomized algorithms because the difficulties turn into extra advanced. It additionally explores larger dimensional complicated functions and gives workouts.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings

This e-book constitutes the joint refereed court cases of the 14th overseas Workshop on Approximation Algorithms for Combinatorial Optimization difficulties, APPROX 2011, and the fifteenth foreign Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, united states, in August 2011.

Conjugate Gradient Algorithms and Finite Element Methods

The placement taken during this number of pedagogically written essays is that conjugate gradient algorithms and finite point tools supplement one another tremendous good. through their mixtures practitioners were capable of clear up differential equations and multidimensional difficulties modeled via usual or partial differential equations and inequalities, now not inevitably linear, optimum keep an eye on and optimum layout being a part of those difficulties.

Routing Algorithms in Networks-on-Chip

This ebook offers a single-source connection with routing algorithms for Networks-on-Chip (NoCs), in addition to in-depth discussions of complicated strategies utilized to present and subsequent iteration, many middle NoC-based Systems-on-Chip (SoCs). After a simple advent to the NoC layout paradigm and architectures, routing algorithms for NoC architectures are awarded and mentioned in any respect abstraction degrees, from the algorithmic point to genuine implementation.

Additional resources for Multilevel Optimization: Algorithms and Applications

Sample text

Control AC-29 (1984), 1111-1114. , Convex two-level optimization, Mathematical Programming 40 (1988), 15-27. F. E. Falk, An explicit solution to the multilevel programming problem, Computers and Operations Research 9 (1982), 77-100. [4] Bell, M. G. , The estimation of an origin-destination matrix from traffic counts, Transportation Science 17 (1983),198-217. E. E. Blair, A General Bilevel Linear Programming Formulation of the Network Design Problem, Transportation Research B 22 (1988), 311-318.

Compute prices as a function of tax credits 2. Call FARM_MODEL to solve LP 3. Compute gobj. surface constraint. out Subroutine FARM_MODEL 1. (first call) Read in external data files and initialize system; solve base case 2. (subsequent calls) Solve LP for new prices Subroutine OSLMPS 1. Call OSL to read MPS file 2. mps Subroutine OSL_RE_SOL VE Call OSL to solve revised LP Notes: • LP denotes the farm sector LP presented to OSL • dspace is the workspace in which OSL builds the problem • LP_OBI denotes the optimal LP objective function value • X denotes the optimal land allocations in the LP solution Figure 1.

Bard, " Algorithms for Nonlinear Mathematical Bilevel Programs," IEEE Trans. Systems, Man, and Cybernetics, Vol. 1, pp. 83-89, 1991. Y. Fan, S. Sarkar, and L. Lasdon, "Experiments with Successive Quadratic Programming Algorithms," Journal of Optimization Theory and Applications, Vol. 3, pp. 359-383, 1988. 44 CHAPTER 2 J. Fortuny-Amat and B. McCarl, "A Representation and Economic Interpretation of a Two-Level Programming Problem," Journal of the Operational Research Society, Vol. 32, pp. 783-792, 1981.

Download PDF sample

Rated 4.75 of 5 – based on 27 votes