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

2019 41st Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops andinvitedsessions of the latest significant findings and developments in all the major fields ofbiomedical engineering.Submitted papers will be peer reviewed. Accepted high quality paperswill be presented in oral and postersessions, will appear in the Conference Proceedings and willbe indexed in PubMed/MEDLINE & IEEE Xplore


2019 IEEE 58th 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, systems and control, and related areas.The 58th CDC will feature contributed and invited papers, as well as workshops and may include tutorial sessions.The IEEE CDC is hosted by the IEEE Control Systems Society (CSS) 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).


2019 IEEE International Symposium on Information Theory (ISIT)

Information theory and coding theory and their applications in communications and storage, data compression, wireless communications and networks, cryptography and security, information theory and statistics, detection and estimation, signal processing, big data analytics, pattern recognition and learning, compressive sensing and sparsity, complexity and computation theory, Shannon theory, quantum information and coding theory, emerging applications of information theory, information theory in biology.


2019 IEEE Pulsed Power & Plasma Science (PPPS)

Combined conference of the IEEE International Conference on Plasma Science and the IEEE International Pulsed Power Conference


2019 IEEE/CVF International Conference on Computer Vision (ICCV)

Early Vision and Sensors Color, Illumination and Texture Segmentation and Grouping Motion and TrackingStereo and Structure from Motion Image -Based Modeling Physics -Based Modeling Statistical Methods and Learning in VisionVideo Surveillance and Monitoring Object, Event and Scene Recognition Vision - Based Graphics Image and Video RetrievalPerformance Evaluation Applications


More Conferences

Periodicals related to Linear programming

Back to Top

Antennas and Propagation, IEEE Transactions on

Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.


Applied Superconductivity, IEEE Transactions on

Contains articles on the applications and other relevant technology. Electronic applications include analog and digital circuits employing thin films and active devices such as Josephson junctions. Power applications include magnet design as well asmotors, generators, and power transmission


Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It 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, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...


Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


More Periodicals

Most published Xplore authors for Linear programming

Back to Top

Xplore Articles related to Linear programming

Back to Top

RTL power optimisation: concepts, tools and design experiences [Tutorial]

Proceedings Design, Automation and Test in Europe Conference and Exhibition, 2004

None


Optimal cell flipping in placement and floorplanning

2006 43rd ACM/IEEE Design Automation Conference, 2006

In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solving this flipping problem optimally. However, solving such a problem optimally is non-trivial given the gigantic sizes of modern circuits. We are able to identify a large portion of cells ...


Adaptive Service Composition in Flexible Processes

IEEE Transactions on Software Engineering, 2007

In advanced service oriented systems, complex applications, described as abstract business processes, can be executed by invoking a number of available Web services. End users can specify different preferences and constraints and service selection can be performed dynamically identifying the best set of services available at runtime. In this paper, we introduce a new modeling approach to the Web service ...


Multi-criteria capital budgeting using FLIP

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300), 1999

By using fuzzy linear programming (FLIP), tolerance intervals are used for calculating the availability of capital at each point in time. The main advantage, compared to the non-fuzzy problem formulation, is the fact that the decision maker is not forced into a precise formulation for mathematical reasons. Linear membership functions which monotonically increase or decrease in the tolerance interval are ...


Optimal capacitor placement using deterministic and genetic algorithms

IEEE Transactions on Power Systems, 2000

A procedure for solving the capacitor placement problem is presented. The objective is to determine the minimum investment required to satisfy suitable reactive constraints. Due to the discrete nature of reactive compensation devices, optimal capacitor placement leads to a nonlinear programming problem with mixed (discrete and continuous) variables. It is solved with an iterative algorithm based on successive linearizations of ...


More Xplore Articles

Educational Resources on Linear programming

Back to Top

IEEE-USA E-Books

  • RTL power optimisation: concepts, tools and design experiences [Tutorial]

    None

  • Optimal cell flipping in placement and floorplanning

    In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solving this flipping problem optimally. However, solving such a problem optimally is non-trivial given the gigantic sizes of modern circuits. We are able to identify a large portion of cells (about 75%) of which the orientation (flipped or not flipped) can be determined independent of the orientations of all the other cells. We have derived three non-trivial conditions to identify those so called independent cells, strictly solvable cells and conditionally solvable cells. In this way, we can greatly reduce the number of cells whose orientations are dependent on each other. Finally, the cell flipping problem of the remaining dependent cells can be formulated as a mixed integer linear programming (MILP) problem and solved optimally. However, this may still be too slow for extremely large circuits and we have applied two other methods, linear programming (LP) and linear programming followed by mixed integer linear programming (LP+MILP) to solve the problem. Experimental results show that by identifying those independent and solvable cells first and applying the LP+MILP technique, we can solve this flipping problem effectively and obtain results just 0.01% more than the optimal. In addition, we can improve the wirelength and number of overflow tiles by 5% and 9% respectively on the floorplanning benchmarks

  • Adaptive Service Composition in Flexible Processes

    In advanced service oriented systems, complex applications, described as abstract business processes, can be executed by invoking a number of available Web services. End users can specify different preferences and constraints and service selection can be performed dynamically identifying the best set of services available at runtime. In this paper, we introduce a new modeling approach to the Web service selection problem that is particularly effective for large processes and when QoS constraints are severe. In the model, the Web service selection problem is formalized as a mixed integer linear programming problem, loops peeling is adopted in the optimization, and constraints posed by stateful Web services are considered. Moreover, negotiation techniques are exploited to identify a feasible solution of the problem, if one does not exist. Experimental results compare our method with other solutions proposed in the literature and demonstrate the effectiveness of our approach toward the identification of an optimal solution to the QoS constrained Web service selection problem

  • Multi-criteria capital budgeting using FLIP

    By using fuzzy linear programming (FLIP), tolerance intervals are used for calculating the availability of capital at each point in time. The main advantage, compared to the non-fuzzy problem formulation, is the fact that the decision maker is not forced into a precise formulation for mathematical reasons. Linear membership functions which monotonically increase or decrease in the tolerance interval are used because they can be handled quite easily. A numeric example is given.

  • Optimal capacitor placement using deterministic and genetic algorithms

    A procedure for solving the capacitor placement problem is presented. The objective is to determine the minimum investment required to satisfy suitable reactive constraints. Due to the discrete nature of reactive compensation devices, optimal capacitor placement leads to a nonlinear programming problem with mixed (discrete and continuous) variables. It is solved with an iterative algorithm based on successive linearizations of the original nonlinear model. The mixed integer linear programming problem to be solved at each iteration of the procedure is tackled by applying both a deterministic method (branch and bound) and genetic algorithm techniques. A hybrid procedure, aiming to exploit the best features of both algorithms is also considered. The proposed procedures are tested and compared with reference to a small CIGRE system and two actual networks derived from the Italian transmission and distribution system.

  • Constraint and integer programming techniques and tools for digital system design [Tutorial]

    None

  • Modern design techniques with systemC [Tutorial]

    Summary form only given, as follows. Even with new design languages coming up, SystemC is widely accepted by EDA companies and used in many design teams. The tutorial gives an extensive overview of the application of SystemC for various aspects of system-on-chip design. It starts with an introduction to SystemC 2.0. Modelling at different levels of abstraction - from system development down to a synthesisable ASIC implementation - are covered. The tutorial is extended by HW/SW partitioning methodologies using SystemC, and includes analogue and mixed analogue/digital modelling with SystemC AMS. The verification of hardware dependent software and the novel SystemC verification library and its usage are also presented. Intended audience: This master course is targeted to designers, who want to acquire basic knowledge of SystemC and its applications as well as design managers, searching for an inside view on the usage of SystemC in a C/C++ based design flow.

  • MINLP algorithms mixed with constraint programming

    This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. It can effectively solve hybrid model mixed with logical rule by integrating CP, nonlinear programming and mixed integer linear programming. Computational results demonstrated this algorithm.

  • A method for solving a class of mixed integer linear programming problem with block angular structure

    None

  • Integer linear programming heuristics that exploit a relationship between computational complexity and bandwidth

    We consider problems of choosing an n-vector x, whose entries must be integers, to optimize a linear objective subject to m linear constraints. For example, the "selection problem" is to choose some subset from among n discrete alternatives so that requirements are satisfied at least cost. Such problems are known to be NP-hard. In this paper, we exploit the concept of bandwidth to explain in a novel way why integer linear programming is difficult. The main contribution is a heuristic based on these ideas. It requires computational effort exponential in m but nearly linear in n, and may be run to any desired prespecified accuracy.



Standards related to Linear programming

Back to Top

(Replaced) IEEE Standard VHDL Language Reference Manual

his standard revises and enhances the VHDL language reference manual (LRM) by including a standard C language interface specification; specifications from previously separate, but related, standards IEEE Std 1164 -1993,1 IEEE Std 1076.2 -1996, and IEEE Std 1076.3-1997; and general language enhancements in the areas of design and verification of electronic systems.


IEEE Standard for Automatic Test Markup Language (ATML) for Exchanging Automatic Test Information via eXtensible Markup Language (XML): Exchanging Test Configuration Information

The scope of this trial-use standard is the definition of an exchange format, using eXtensible Markup Language (XML), for identifying all of the hardware, software, and documentation that may be used to test and diagnose a UUT on an automatic test system (ATS).


IEEE Standard for Information Technology - POSIX Ada Language Interfaces - Part 1: Binding for System Application Program Interface (API)

This document is part of the POSIX series of standards for applications and user interfaces to open systems. It defines the Ada language bindings as package specifications and accompanying textual descriptions of the applications program interface (API). This standard supports application portability at the source code level through the binding between ISO 8652:1995 (Ada) and ISO/IEC 9945-1:1990 (IEEE Std 1003.1-1990 ...


IEEE Standard for Software Unit Testing


IEEE Trial-Use Standard for Automatic Test Markup Language (ATML) for Exchanging Automatic Test Equipment and Test Information via XML: Exchanging Test Descriptions

The scope of this trial-use standard is the definition of an exchange format, utilizing eXtensible Markup Language (XML), for exchanging the test description information defining test performance, test conditions, diagnostic requirements, and support equipment to locate, align, and verify the proper operation of a UUT. This is in support of the development of test program sets (TPSs) that will be ...



Jobs related to Linear programming

Back to Top