Linear programming

View this topic in
Linear programming (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. (Wikipedia.org)






Conferences related to Linear programming

Back to Top

2016 IEEE 55th IEEE Conference on Decision and Control (CDC)

The CDC is recognized as the premier scientific and engineering conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.

  • 2014 IEEE 53rd Annual Conference on Decision and Control (CDC)

    Largest annual conference in control theory and its applications. Areas covered all applied math, communication, control, aerospace, biology, etc.

  • 2013 IEEE 52nd Annual Conference on Decision and Control (CDC)

    The 52nd IEEE Conference on Decision and Control will be held Tuesday through Friday, December 10-13, 2013 at the Congress Centre in Firenze, Italy. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss the latest advancements of the discipline, shape its future directions, and promote its diffusion among the scientific community at large. The 52nd CDC will feature the presentation of contributed and invited papers, as well as tutorial sessions and workshops. The CDC is hosted by the IEEE Control Systems Society (CSS), and is organized in cooperation with the Society for Industrial and Applied Mathematics (SIAM), the Institute for Operations Research and the Management Sciences (INFORMS), the Japanese Society for Instrument and Control Engineers (SICE), and the European Union Control Association (EUCA).

  • 2012 IEEE 51st Annual Conference on Decision and Control (CDC)

    The conference discusses advances in theory, design and application of control systems. Papers will highlight the latest knowledge, exploratory developments, and practical applications in all aspects of the control systems from analysis and design through simulation and hardware. Its scope shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organiz

  • 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC 2011)

    This conference is dedicated to the advancement of the theory and practice of systems and control, bringing together an international community of researchers and practitioners to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.

  • 2010 49th IEEE Conference on Decision and Control (CDC)

    Theory and applications of control theory and control systems technology

  • 2009 Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC)

    This conference is dedicated to the advancement of the theory and practice of systems and control, bringing together an international community of researchers and practitioners to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.

  • 2008 47th IEEE Conference on Decision and Control (CDC)

    The CDC is the premier scientific and engineering conference dedicated to the advancement of the theory and practice of systems and control, bringing together an international community of researchers and practitioners to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.


2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

FSKD is an international forum on fuzzy systems and knowledge discovery. Specific topics include fuzzy theory and foundations; stability of fuzzy systems; fuzzy methods and algorithms; fuzzy image, speech and signal processing; multimedia; fuzzy hardware and architectures; data mining.

  • 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

    FSKD is an international forum on fuzzy systems and knowledge discovery. Specific topics include fuzzy theory and foundations; stability of fuzzy systems; fuzzy methods and algorithms; fuzzy image, speech and signal processing; multimedia; fuzzy hardware and architectures; data mining.

  • 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

    FSKD is an international forum on fuzzy systems and knowledge discovery. Specific topics include fuzzy theory and foundations; stability of fuzzy systems; fuzzy methods and algorithms; fuzzy image, speech and signal processing; multimedia; fuzzy hardware and architectures; data mining.


2012 Eighth International Conference on Computational Intelligence and Security (CIS)

CIS'12 provides a platform to explore the potential applications of CI models, algorithms and technologies to IS. Definitely, the subjects of CIS'12 conference, e.g. data minging, pattern recognition, machine learning, image processing, web application, and so forth, are closely related to the IEEE Computer Society's fields of interest.

  • 2008 International Conference on Computational Intelligence and Security (CIS 2008)

    International Conference on Computational Intelligence and Security (CIS) is a major annual international conference to bring together researchers, engineers, developers and practitioners from academia and industry working in all areas of two crucial fields in information processing: computational intelligence (CI) and information security (IS), to share the experience, and exchange and cross-fertilize ideas. In particular, the series of CIS conference provides an ideal platform to explore the potential app

  • 2007 International Conference on Computational Intelligence and Security (CIS 2007)

    International Conference on Computational Intelligence and Security (CIS) is a major annual international conference to bring together researchers, engineers, developers and practitioners from academia and industry working in all areas of two crucial fields in information processing: computational intelligence (CI) and information security (IS), to share the experience, and exchange and cross-fertilize ideas.

  • 2006 International Conference on Computational Intelligence and Security (CIS 2006)


2010 IEEE 2nd International Advance Computing Conference (IACC 2010)

Organizations and Institutions are competing to take leads in different areas of advance computing. Due to increasing complexity and size of problems the importance of this area has grown tremendously. The problems which were out of bounds to the computer scientists are now being solved using advance computing technologies. It has opened the flood gates for new research and innovations. In this endeavor we have taken an initiative to provide a common platform for all who are involved in this field.

  • 2009 IEEE International Advance Computing Conference (IACC 2009)

    In Computer Science the problem complexity and size is increasing. The Projects are becomingincreasingly difficult and huge in volume. Therefore the area of advance computing techniques in terms of efficient algorithms and reliable computing technologies is becoming of utmostimportance. This conference will work towards bridging the gap regarding the solution of the latest problems and the available techniques and technologies.



Periodicals related to Linear programming

Back to Top

Information Theory, IEEE Transactions on

The fundamental nature of the communication process; storage, transmission and utilization of information; coding and decoding of digital and analog communication transmissions; study of random interference and information-bearing signals; and the development of information-theoretic techniques in diverse areas, including data communication and recording systems, communication networks, cryptography, detection systems, pattern recognition, learning, and automata.


Neural Networks, IEEE Transactions on

Devoted to the science and technology of neural networks, which disclose significant technical knowledge, exploratory developments, and applications of neural networks from biology to software to hardware. Emphasis is on artificial neural networks.


Selected Areas in Communications, IEEE Journal on

All telecommunications, including telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space, and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; communication theory; and wireless communications.


Systems, Man, and Cybernetics, Part B, IEEE Transactions on

The scope of the IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or between machines, humans, and organizations. The scope of Part B includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, ...



Most published Xplore authors for Linear programming

Back to Top

Xplore Articles related to Linear programming

Back to Top

Optimal power system steady-state security regions with fuzzy constraints

J. Z. Zhu 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309), 2002

This paper proposes a new approach to compute the maximal power system steady- state security regions using optimization approach. The maximal steady-state security region-hyperbox-is directly computed through a linear programming (LP) model, in which the upper and lower limits of each component forming a hyperbox are taken as unknown variables, and the objective is to maximize the sum of the ...


Application of an ant colony system to optimize the total distance and the customers response time for the real time vehicle routing problem

Messaoud Elhassania; Elhilali Alaoui Ahmed; Boukachour Jaouad 2016 3rd International Conference on Logistics Operations Management (GOL), 2016

Transport is one of the largest emission driving forces and has many economic and social impacts. Thus, it is crucial to model and optimize practical transportation problems. In this paper, we present a mathematical model for a Real Time Multi-Objective Vehicle Routing Problem which can be described as the problem of designing optimal delivery or collection routes from one or ...


Mask-Constrained Power Synthesis of Linear Arrays With Even Excitations

T. Isernia; A. F. Morabito IEEE Transactions on Antennas and Propagation, 2016

An existing effective approach for the synthesis of linear arrays providing power patterns lying in arbitrary masks is extended to the case where an even distribution is required on element excitations. The approach consists of a linear programming optimization plus a polynomial factorization, and it allows one to deal with a considerably reduced computational burden with respect to the previous ...


Design and evaluation of a delay-efficient RPL routing metric

Pietro Gonizzi; Riccardo Monica; Gianluigi Ferrari 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), 2013

The Routing Protocol for Low power and Lossy Networks (RPL) is the IETF standard for IPv6 routing in low-power wireless sensor networks. It is a distance vector routing protocol that builds a Destination Oriented Directed Acyclic Graph (DODAG) rooted towards one sink (the DAG root), using an objective function and a set of metrics/constraints to compute the best path. In ...


The distributed intelligent control of complex systems

W. J. Davis Intelligent Processing and Manufacturing of Materials, 1999. IPMM '99. Proceedings of the Second International Conference on, 1999

The paper begins by discussing the relationship of planning and control, the notion of intelligent control, and the need for the distributed intelligent control of complex systems. The paper then discusses an architecture for a distributed intelligent control architecture. The first step is to define a modeling paradigm that will recursively decompose the overall system into a collection of subsystems ...


More Xplore Articles

Educational Resources on Linear programming

Back to Top

eLearning

Optimal power system steady-state security regions with fuzzy constraints

J. Z. Zhu 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309), 2002

This paper proposes a new approach to compute the maximal power system steady- state security regions using optimization approach. The maximal steady-state security region-hyperbox-is directly computed through a linear programming (LP) model, in which the upper and lower limits of each component forming a hyperbox are taken as unknown variables, and the objective is to maximize the sum of the ...


Application of an ant colony system to optimize the total distance and the customers response time for the real time vehicle routing problem

Messaoud Elhassania; Elhilali Alaoui Ahmed; Boukachour Jaouad 2016 3rd International Conference on Logistics Operations Management (GOL), 2016

Transport is one of the largest emission driving forces and has many economic and social impacts. Thus, it is crucial to model and optimize practical transportation problems. In this paper, we present a mathematical model for a Real Time Multi-Objective Vehicle Routing Problem which can be described as the problem of designing optimal delivery or collection routes from one or ...


Mask-Constrained Power Synthesis of Linear Arrays With Even Excitations

T. Isernia; A. F. Morabito IEEE Transactions on Antennas and Propagation, 2016

An existing effective approach for the synthesis of linear arrays providing power patterns lying in arbitrary masks is extended to the case where an even distribution is required on element excitations. The approach consists of a linear programming optimization plus a polynomial factorization, and it allows one to deal with a considerably reduced computational burden with respect to the previous ...


Design and evaluation of a delay-efficient RPL routing metric

Pietro Gonizzi; Riccardo Monica; Gianluigi Ferrari 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), 2013

The Routing Protocol for Low power and Lossy Networks (RPL) is the IETF standard for IPv6 routing in low-power wireless sensor networks. It is a distance vector routing protocol that builds a Destination Oriented Directed Acyclic Graph (DODAG) rooted towards one sink (the DAG root), using an objective function and a set of metrics/constraints to compute the best path. In ...


The distributed intelligent control of complex systems

W. J. Davis Intelligent Processing and Manufacturing of Materials, 1999. IPMM '99. Proceedings of the Second International Conference on, 1999

The paper begins by discussing the relationship of planning and control, the notion of intelligent control, and the need for the distributed intelligent control of complex systems. The paper then discusses an architecture for a distributed intelligent control architecture. The first step is to define a modeling paradigm that will recursively decompose the overall system into a collection of subsystems ...


More eLearning Resources

IEEE-USA E-Books

  • Emergent Task Allocation for Mobile Robots

    Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computationally expensive and may require a large number of messages between the robots as the robots need to be aware of the global spatiotemporal information. In this paper, we introduce an emergent task allocation approach for mobile robots. Each robot uses only the information obtained from its immediate neighbors in its decision. Our technique is general enough to be applicable to any task allocation scheme as long as a utilization criteria is given. We demonstrate that our approach performs similar to the integer linear programming technique which finds the global optimal solution at the fraction of its cost. The tasks we are interested in are detecting and controlling multiple regions of interest in an unknown environment in the presence of obstacles and intrinsic constraints. The objective function contains four basic requirements of a multi-robot system serving this purpose: control regions of interest, provide communication between robots, control maximum area and detect regions of interest. Our solution determines optimal locations of the robots to maximize the objective function for small problem instances while efficiently satisfying some constraints such as avoiding obstacles and staying within the speed capabilities of the robots, and finds an approximation to global optimal solution by correlating solutions of small problems.

  • About the Author

    The ever-growing number of new telecommunications technologies, along with the rapid growth of data networks and cable television systems has created a demand for sound network planning. In one concise volume, this book offers professionals in telecommunications and networking and graduate students an introduction to the theory underlying the interdisciplinary field of network planning, a critical aspect of network management that integrates planning telecommunications and data networks. In PLANNING TELECOMMUNICATIONS NETWORKS you will learn about the mathematical theory behind network planning, including an accessible treatment of linear programming and graph algorithms. Other featured topics cover: Reliability theory for network planning Recent software advances in databases, expert systems, object-oriented programming, data mining and data visualization Latest developments in new optimization techniques such as tabu search, simulated annealing, genetic algorithms, and neural networks Complete with homework problems, this text offers you a broad overview of network planning to begin your exploration of this emerging field. Sponsored by: IEEE Communications Society. An Instructor's Manual presenting detailed solutions to all the problems in the book is available upon request from the Wiley Makerting Department.

  • Post Global Routing Crosstalk Synthesis

    For the generation of a risk-free layout solution of a chip, crosstalk synthesis should be pursued at various stages in the routing process. This paper proposes a post global routing crosstalk optimization approach, which to our knowledge, is the first to estimate and reduce crosstalk risk at the global routing level. It consists of two parts: region-based crosstalk risk estimation and crosstalk risk reduction at the global routing level. In Part One, crosstalk risk graphs are first introduced for each routing region representing its current crosstalk situation. The crosstalk risk of each region, which indicates whether a risk-free routing solution of the region is possible, is then quantitatively defined and estimated using a graph-based approach. In Part Two, the risk tolerance bound of each net is partitioned appropriately among its routing regions via integer linear programming for accurate (minimized) crosstalk risk estimation. If high risk regions still exist after bound partitioning, net ripping-up and rerouting is applied to reduce their crosstalk risks. At the end of the entire optimization process, a risk-free global routing solution is obtained together with partitions of nets' risk tolerance bounds which reflect the current crosstalk situation of the chip. These can greatly facilitate the generation of a risk-free final solution at later stages in the layout process. The proposed approach has been implemented and tested on CBL/NCSU benchmarks and the experimental results are very promising.

  • Generalized Support Vector Machines

    This chapter contains sections titled: Introduction, GSVM: The General Support Vector Machine, Quadratic Programming Support Vector Machines, Linear Programming Support Vector Machines, A Simple Illustrative Example, Conclusion, Acknowledgments

  • Optimal Reconfiguration of Electrical Distribution Network

    This chapter contains sections titled: Introduction Mathematical Model of DNRC Heuristic Methods Rule-Based Comprehensive Approach Mixed-Integer Linear Programming Approach Application of GA to DNRC Multiobjective Evolution Programming to DNRC Genetic Algorithm Based on Matroid Theory References

  • Semantics and Consistency of Empirical Databases

    In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most proposals are either non-probabilistic in nature or based on subjective probabilities. In this paper, we address the problem of incorporating empirical probabilities - that is, probabilities obtained from statistical findings - in deductive databases. To this end, we develop a formal model-theoretic basis for such databases. We also present a sound and complete algorithm for checking the consistency of such databases. This algorithm is based on constraint satisfaction and can be implemented by linear programming techniques. Moreover, we develop consistency-preserving ways to optimize the algorithm for practical usage.

  • No title

    In this book we give an overview of modeling techniques used to describe computer systems to mathematical optimization tools. We give a brief introduction to various classes of mathematical optimization frameworks with special focus on mixed integer linear programming which provides a good balance between solver time and expressiveness. We present four detailed case studies -- instruction set customization, data center resource management, spatial architecture scheduling, and resource allocation in tiled architectures -- showing how MILP can be used and quantifying by how much it outperforms traditional design exploration techniques. This book should help a skilled systems designer to learn techniques for using MILP in their problems, and the skilled optimization expert to understand the types of computer systems problems that MILP can be applied to.

  • Solution of Equations, Inequalities, and Linear Programs

    This chapter contains sections titled: Extreme Values, Relative Maximum and Minimum Concave and Convex Functions Solution of Linear Equation Systems Linear Optimization Problems Linear Programs and Convex Sets - Relation Linear Programs Illustration of the Simplex Method Solution of Linear Programs Using Excel Solver Transportation Problems Duality in Linear Programming Exercise Problems

  • Mathematical Programming for Planning

    This chapter contains sections titled: Optimal Solutions Linear Programming Examples of Linear Programming Problems Solving Linear Programs Integer Linear Programming Dynamic Programming Case Study I: A Cell Assignment Problem Case Study II: Cellular Economic Model Problems

  • Bibliography

    The ever-growing number of new telecommunications technologies, along with the rapid growth of data networks and cable television systems has created a demand for sound network planning. In one concise volume, this book offers professionals in telecommunications and networking and graduate students an introduction to the theory underlying the interdisciplinary field of network planning, a critical aspect of network management that integrates planning telecommunications and data networks. In PLANNING TELECOMMUNICATIONS NETWORKS you will learn about the mathematical theory behind network planning, including an accessible treatment of linear programming and graph algorithms. Other featured topics cover: Reliability theory for network planning Recent software advances in databases, expert systems, object-oriented programming, data mining and data visualization Latest developments in new optimization techniques such as tabu search, simulated annealing, genetic algorithms, and neural networks Complete with homework problems, this text offers you a broad overview of network planning to begin your exploration of this emerging field. Sponsored by: IEEE Communications Society. An Instructor's Manual presenting detailed solutions to all the problems in the book is available upon request from the Wiley Makerting Department.



Standards related to Linear programming

Back to Top

No standards are currently tagged "Linear programming"


Jobs related to Linear programming

Back to Top