Skip to main content
SpringerLink
Log in

A goal programming network for linear programming

  • Published:
Biological Cybernetics Aims and scope Submit manuscript

Abstract

Tank and Hopfield have shown that networks of analog neurons can be used to solve linear programming (LP) problems. We have re-examined their approach and found that their network model frequently computes solutions that are only suboptimal or that violate the LP problem's constraints. As their approach has proven unreliable, we have developed a new network model: the goal programming network. To this end, a network model was first developed for goal programming problems, a particular type of LP problems. From the manner the network operates on such problems, it was concluded that overconstrainedness, which is possibly present in an LP formulation, should be removed, and we have provided a simple procedure to accomplish this.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Hillier FS, Lieberman GJ (1986) Introduction to operations research. Holden-Day, Oakland Calif

    Google Scholar 

  • Hopfield JJ, Tank DW (1985) “Neural” computation of decisions in optimization problems. Biol Cybern 52:141–152

    PubMed  Google Scholar 

  • Kamgar-Parsi B, Kamgar-Parsi B (1990) On problem solving with Hopfield neural networks. Biol Cybern 62:415–423

    Article  Google Scholar 

  • Mead C (1989) Analog VLSI and neural systems. Addison Wesley, Reading Mass

    Google Scholar 

  • Pyne IB (1956) Linear programming on an electronic analogue computer. Trans AIEE 75:139–143

    Google Scholar 

  • Shawe-Taylor JS, Cohen DA (1990) Linear programming algorithm for neural networks. Neural Networks 3:572–582

    Article  Google Scholar 

  • Tank DW, Hopfield JJ (1986) Simple “neural” optimization networks: an A/D converter, signal decision circuit, and a linear programming circuit. IEEE Trans Circuits Syst 33:533–541

    Article  Google Scholar 

  • Van Hulle MM (1991) A goal programming network for mixed integer linear programming: a case study for the job-shop scheduling problem, (accepted for publication in Int J Neural Syst)

  • Wilson GV, Pawley GS (1988) On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank. Biol Cybern 57:63–70

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratorium voor Neuro- en Psychofysiologie, Katholieke Universiteit Leuven, Campus Gasthuisberg, Herestraat, B-3000, Leuven, Belgium

    M. M. Van Hulle

  2. Department of Electrotechnology, E.S.A.T. Division, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium

    M. M. Van Hulle

Authors
  1. M. M. Van Hulle
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van Hulle, M.M. A goal programming network for linear programming. Biol. Cybern. 65, 243–252 (1991). https://doi.org/10.1007/BF00206222

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00206222

Keywords

Search

Navigation