Download or read book Parametric Fractional Programming written by Zhong-guo Zhou and published by . This book was released on 1988 with total page 128 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Handbook of Generalized Convexity and Generalized Monotonicity written by Nicolas Hadjisavvas and published by Springer Science & Business Media. This book was released on 2006-01-16 with total page 684 pages. Available in PDF, EPUB and Kindle. Book excerpt: Studies in generalized convexity and generalized monotonicity have significantly increased during the last two decades. Researchers with very diverse backgrounds such as mathematical programming, optimization theory, convex analysis, nonlinear analysis, nonsmooth analysis, linear algebra, probability theory, variational inequalities, game theory, economic theory, engineering, management science, equilibrium analysis, for example are attracted to this fast growing field of study. Such enormous research activity is partially due to the discovery of a rich, elegant and deep theory which provides a basis for interesting existing and potential applications in different disciplines. The handbook offers an advanced and broad overview of the current state of the field. It contains fourteen chapters written by the leading experts on the respective subject; eight on generalized convexity and the remaining six on generalized monotonicity.
Download or read book Generalized Convexity and Fractional Programming with Economic Applications written by Alberto Cambini and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 372 pages. Available in PDF, EPUB and Kindle. Book excerpt: Generalizations of convex functions have been used in a variety of fields such as economics. business administration. engineering. statistics and applied sciences.· In 1949 de Finetti introduced one of the fundamental of generalized convex functions characterized by convex level sets which are now known as quasiconvex functions. Since then numerous types of generalized convex functions have been defined in accordance with the need of particular applications.· In each case such functions preserve soine of the valuable properties of a convex function. In addition to generalized convex functions this volume deals with fractional programs. These are constrained optimization problems which in the objective function involve one or several ratios. Such functions are often generalized convex. Fractional programs arise in management science. economics and numerical mathematics for example. In order to promote the circulation and development of research in this field. an international workshop on "Generalized Concavity. Fractional Programming and Economic Applications" was held at the University of Pisa. Italy. May 30 - June 1. 1988. Following conferences on similar topics in Vancouver. Canada in 1980 and in Canton. USA in 1986. it was the first such conference organized in Europe. It brought together 70 scientists from 11 countries. Organizers were Professor A. Cambini. University of Pisa. Professor E. Castagnoli. Bocconi University. Milano. Professor L. Martein. University of Pisa. Professor P. Mazzoleni. University of Verona and Professor S. Schaible. University of California. Riverside.
Download or read book Fractional Programming written by I.M. Stancu-Minasian and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 430 pages. Available in PDF, EPUB and Kindle. Book excerpt: Mathematical programming has know a spectacular diversification in the last few decades. This process has happened both at the level of mathematical research and at the level of the applications generated by the solution methods that were created. To write a monograph dedicated to a certain domain of mathematical programming is, under such circumstances,especially difficult. In the present monograph we opt for the domain of fractional programming. Interest of this subject was generated by the fact that various optimization problems from engineering and economics consider the minimization of a ratio between physical and/or economical functions, for example cost/time, cost/volume,cost/profit, or other quantities that measure the efficiency of a system. For example, the productivity of industrial systems, defined as the ratio between the realized services in a system within a given period of time and the utilized resources, is used as one of the best indicators of the quality of their operation. Such problems, where the objective function appears as a ratio of functions, constitute fractional programming problem. Due to its importance in modeling various decision processes in management science, operational research, and economics, and also due to its frequent appearance in other problems that are not necessarily economical, such as information theory, numerical analysis, stochastic programming, decomposition algorithms for large linear systems, etc., the fractional programming method has received particular attention in the last three decades.
Download or read book Discrete and Fractional Programming Techniques for Location Models written by A.I. Barros and published by Springer Science & Business Media. This book was released on 2013-11-21 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt: At first sight discrete and fractional programming techniques appear to be two com pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc. , while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models.
Download or read book Complexity In Numerical Optimization written by Panos M Pardalos and published by World Scientific. This book was released on 1993-07-31 with total page 538 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable.The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.
Download or read book Semi Infinite Fractional Programming written by Ram U. Verma and published by Springer. This book was released on 2017-10-24 with total page 298 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents a smooth and unified transitional framework from generalised fractional programming, with a finite number of variables and a finite number of constraints, to semi-infinite fractional programming, where a number of variables are finite but with infinite constraints. It focuses on empowering graduate students, faculty and other research enthusiasts to pursue more accelerated research advances with significant interdisciplinary applications without borders. In terms of developing general frameworks for theoretical foundations and real-world applications, it discusses a number of new classes of generalised second-order invex functions and second-order univex functions, new sets of second-order necessary optimality conditions, second-order sufficient optimality conditions, and second-order duality models for establishing numerous duality theorems for discrete minmax (or maxmin) semi-infinite fractional programming problems. In the current interdisciplinary supercomputer-oriented research environment, semi-infinite fractional programming is among the most rapidly expanding research areas in terms of its multi-facet applications empowerment for real-world problems, which may stem from many control problems in robotics, outer approximation in geometry, and portfolio problems in economics, that can be transformed into semi-infinite problems as well as handled by transforming them into semi-infinite fractional programming problems. As a matter of fact, in mathematical optimisation programs, a fractional programming (or program) is a generalisation to linear fractional programming. These problems lay the theoretical foundation that enables us to fully investigate the second-order optimality and duality aspects of our principal fractional programming problem as well as its semi-infinite counterpart.
Download or read book Encyclopedia of Operations Research and Management Science written by Saul I. Gass and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 774 pages. Available in PDF, EPUB and Kindle. Book excerpt: Operations Research: 1934-1941," 35, 1, 143-152; "British The goal of the Encyclopedia of Operations Research and Operational Research in World War II," 35, 3, 453-470; Management Science is to provide to decision makers and "U. S. Operations Research in World War II," 35, 6, 910-925; problem solvers in business, industry, government and and the 1984 article by Harold Lardner that appeared in academia a comprehensive overview of the wide range of Operations Research: "The Origin of Operational Research," ideas, methodologies, and synergistic forces that combine to 32, 2, 465-475. form the preeminent decision-aiding fields of operations re search and management science (OR/MS). To this end, we The Encyclopedia contains no entries that define the fields enlisted a distinguished international group of academics of operations research and management science. OR and MS and practitioners to contribute articles on subjects for are often equated to one another. If one defines them by the which they are renowned. methodologies they employ, the equation would probably The editors, working with the Encyclopedia's Editorial stand inspection. If one defines them by their historical Advisory Board, surveyed and divided OR/MS into specific developments and the classes of problems they encompass, topics that collectively encompass the foundations, applica the equation becomes fuzzy. The formalism OR grew out of tions, and emerging elements of this ever-changing field. We the operational problems of the British and U. s. military also wanted to establish the close associations that OR/MS efforts in World War II.
Download or read book Linear Fractional Programming Theory Methods Applications and Software written by E.B. Bajalinov and published by Springer Science & Business Media. This book was released on 2013-12-01 with total page 442 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is a book on Linear-Fractional Programming (here and in what follows we will refer to it as "LFP"). The field of LFP, largely developed by Hungarian mathematician B. Martos and his associates in the 1960's, is concerned with problems of op timization. LFP problems deal with determining the best possible allo cation of available resources to meet certain specifications. In particular, they may deal with situations where a number of resources, such as people, materials, machines, and land, are available and are to be combined to yield several products. In linear-fractional programming, the goal is to determine a per missible allocation of resources that will maximize or minimize some specific showing, such as profit gained per unit of cost, or cost of unit of product produced, etc. Strictly speaking, linear-fractional programming is a special case of the broader field of Mathematical Programming. LFP deals with that class of mathematical programming problems in which the relations among the variables are linear: the con straint relations (i.e. the restrictions) must be in linear form and the function to be optimized (i.e. the objective function) must be a ratio of two linear functions.
Download or read book Generalized Concavity written by Mordecai Avriel and published by SIAM. This book was released on 2010-11-25 with total page 342 pages. Available in PDF, EPUB and Kindle. Book excerpt: Originally published: New York: Plenum Press, 1988.
Download or read book Multi Objective Stochastic Programming in Fuzzy Environments written by Biswas, Animesh and published by IGI Global. This book was released on 2019-03-22 with total page 434 pages. Available in PDF, EPUB and Kindle. Book excerpt: It is frequently observed that most decision-making problems involve several objectives, and the aim of the decision makers is to find the best decision by fulfilling the aspiration levels of all the objectives. Multi-objective decision making is especially suitable for the design and planning steps and allows a decision maker to achieve the optimal or aspired goals by considering the various interactions of the given constraints. Multi-Objective Stochastic Programming in Fuzzy Environments discusses optimization problems with fuzzy random variables following several types of probability distributions and different types of fuzzy numbers with different defuzzification processes in probabilistic situations. The content within this publication examines such topics as waste management, agricultural systems, and fuzzy set theory. It is designed for academicians, researchers, and students.
Download or read book Handbook of Combinatorial Optimization written by Ding-Zhu Du and published by Springer Science & Business Media. This book was released on 2006-08-18 with total page 395 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Download or read book Non Linear Parametric Optimization written by BANK and published by Birkhäuser. This book was released on 2013-12-21 with total page 227 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Parameterized Algorithms written by Marek Cygan and published by Springer. This book was released on 2015-07-20 with total page 618 pages. Available in PDF, EPUB and Kindle. Book excerpt: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Download or read book Handbook of Global Optimization written by R. Horst and published by Springer Science & Business Media. This book was released on 2013-12-11 with total page 891 pages. Available in PDF, EPUB and Kindle. Book excerpt: Global optimization is concerned with the computation and characterization of global optima of nonlinear functions. During the past three decades the field of global optimization has been growing at a rapid pace, and the number of publications on all aspects of global optimization has been increasing steadily. Many applications, as well as new theoretical, algorithmic, and computational contributions have resulted. The Handbook of Global Optimization is the first comprehensive book to cover recent developments in global optimization. Each contribution in the Handbook is essentially expository in nature, but scholarly in its treatment. The chapters cover optimality conditions, complexity results, concave minimization, DC programming, general quadratic programming, nonlinear complementarity, minimax problems, multiplicative programming, Lipschitz optimization, fractional programming, network problems, trajectory methods, homotopy methods, interval methods, and stochastic approaches. The Handbook of Global Optimization is addressed to researchers in mathematical programming, as well as all scientists who use optimization methods to model and solve problems.
Download or read book Essays and Surveys on Multiple Criteria Decision Making written by P. Hansen and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 451 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Fifth International Conference on Multiple Criteria Decision Making, not suprisingly, had several objectives. First, it aimed at beinq a forum for exchange and intensive discussion of recent ideas on theory and practice of MCDM, following the now well-established tradition of the previous meetings in the series, organized by H. Thiriez and S. Zionts in Jouy-en-Josas (1975), S. Zionts in Buffalo (1977), G. Fandel and T. Gal in Hagen/Konigswinter (1979) and J. Morse in Newark (1980). Second, closer contacts Nere desired between participants in these meetings and other active groups in the field, prominent among which is the European Working Group on Multiple Criteria Decision Aid. Third, participation of senior or junior researchers who had recently developped important new methodolo0ies, such as the Analytical Hierarchy Process, was actively sought for. Fourth, a synthesis of the rapidly expanding field of MCDM was to be made through selective surveys by leading researchers in the various areas it comprises. Fifth, cross-fertilization and multidisciplinary research was to be encouraged through presentations on the connections between MCDM and mathematics, economics, game theory, computer science and other subjects. Sixth, much emphasis was to be given to real-world applications of MCDM, particularly large scale ones and/or pioneering work in new fields. The present volume reflects the general agreement observed among participants that these goals were largely attained.
Download or read book Clusters Orders and Trees Methods and Applications written by Fuad Aleskerov and published by Springer. This book was released on 2014-06-11 with total page 404 pages. Available in PDF, EPUB and Kindle. Book excerpt: The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings and hierarchies—in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin’s fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining and knowledge discovery. Researchers, students and software engineers will benefit from new knowledge discovery techniques and application directions.
