Skip to main content
SpringerLink
Log in

Bilinear Programming: Applications in the Supply Chain Management

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Introduction

Formulation

  Concave Piecewise Linear Network Flow Problem

  Fixed Charge Network Flow Problem

  Capacitated Multi-Item Dynamic Pricing Problem

Methods

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Barr R, Glover F, Klingman D (1981) A New Optimization Method for Large Scale Fixed Charge Transportation Problems. Oper Res 29:448–463

    MathSciNet  MATH  Google Scholar 

  2. Cabot A, Erenguc S (1984) Some Branch-and-Bound Procedures for Fixed-Cost Transportation Problems. Nav Res Logist Q 31:145–154

    Article  MathSciNet  MATH  Google Scholar 

  3. Cooper L, Drebes C (1967) An Approximate Solution Method for the Fixed Charge Problem. Nav Res Logist Q 14:101–113

    Article  MATH  Google Scholar 

  4. Diaby M (1991) Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problem. J Oper Res Soc 42:991–1001

    Article  MATH  Google Scholar 

  5. Gray P (1971) Exact Solution for the Fixed-Charge Transportation Problem. Oper Res 19:1529–1538

    MATH  Google Scholar 

  6. Guisewite G, Pardalos P (1990) Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann Oper Res 25:75–100

    Article  MathSciNet  MATH  Google Scholar 

  7. Kennington J, Unger V (1976) A New Branch-and-Bound Algorithm for the Fixed Charge Transportation Problem. Manag Sci 22:1116–1126

    MathSciNet  MATH  Google Scholar 

  8. Khang D, Fujiwara O (1991) Approximate Solution of Capacitated Fixed-Charge Minimum Cost Network Flow Problems. Netw 21:689–704

    Google Scholar 

  9. Kim D, Pardalos P (1999) A Solution Approach to the Fixed Charge Network Flow Problem Using a Dynamic Slope Scaling Procedure. Oper Res Lett 24:195–203

    Article  MathSciNet  MATH  Google Scholar 

  10. Kim D, Pardalos P (2000) Dynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems. Netw 35:216–222

    Article  MathSciNet  MATH  Google Scholar 

  11. Konno H (1976) A Cutting Plane Algorithm for Solving Bilinear Programs. Math Program 11:14–27

    Article  MathSciNet  MATH  Google Scholar 

  12. Kuhn H, Baumol W (1962) An Approximate Algorithm for the Fixed Charge Transportation Problem. Nav Res Logist Q 9:1–15

    Article  MathSciNet  MATH  Google Scholar 

  13. Nahapetyan A, Pardalos P (2007) A Bilinear Relaxation Based Algorithm for Concave Piecewise Linear Network Flow Problems. J Ind Manag Optim 3:71–85

    MathSciNet  MATH  Google Scholar 

  14. Nahapetyan A, Pardalos P (2008) Adaptive Dynamic Cost Updating Procedure for Solving Fixed Charge Network Flow Problems. Comput Optim Appl 39:37–50. doi:10.1007/s10589-007-9060-x

  15. Nahapetyan A, Pardalos P (2008) A Bilinear Reduction Based Algorithm for Solving Capacitated Multi-Item Dynamic Pricing Problems. Comput Oper Res J 35:1601–1612. doi:10.1016/j.cor.2006.09.003

  16. Palekar U, Karwan M, Zionts S (1990) A Branch-and-Bound Method for Fixed Charge Transportation Problem. Manag Sci 36:1092–1105

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Optimization, Industrial and Systems Engineering Department, University of Florida, Gainesville, USA

    Artyom G. Nahapetyan

Authors
  1. Artyom G. Nahapetyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Nahapetyan, A.G. (2008). Bilinear Programming: Applications in the Supply Chain Management . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_49

Download citation

Publish with us

Policies and ethics

Search

Navigation