Skip to main content
SpringerLink
Log in

Multiplicative Programming

  • Reference work entry
Encyclopedia of Optimization

  • 110 Accesses

Article Outline

Keywords

See also

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. Avriel M, Diewert WE, Schaible S, Zang I (1988) Generalized concavity. Plenum, New York

    MATH  Google Scholar 

  2. Evans DH (1963) Modular design: A special case in nonlinear programming. Oper Res 11:637–647

    Article  MATH  Google Scholar 

  3. Geoffrion M (1967) Solving bicriterion mathematical programs. Oper Res 15:39–54

    Article  MathSciNet  MATH  Google Scholar 

  4. Henderson JM, Quandt RE (1971) Microeconomic theory. McGraw-Hill, New York

    MATH  Google Scholar 

  5. Horst R, Pardalos PM (1995) Handbook of global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  6. Horst R, Tuy H (1993) Global optimization: deterministic approaches. second Springer, Berlin

    Google Scholar 

  7. Konno H, Inori M (1989) Bond portfolio optimization by bilinear fractional programming. J Oper Res Japan 32:143–158

    MathSciNet  MATH  Google Scholar 

  8. Konno H, Kuno T (1992) Linear multiplicative programming. Math Program 56:51–64

    Article  MathSciNet  MATH  Google Scholar 

  9. Konno H, Thach PT, Tuy H (1997) Optimization on low rank nonconvex structures. Kluwer, Dordrecht

    MATH  Google Scholar 

  10. Maling K, Mueller SH, Heller WR (1982) On finding most optimal rectangular package plans. Proc 19th Design Automation Conf, pp 663–670

    Google Scholar 

  11. Matsui T (1996) NP-hardness of linear multiplicative programming and related problems. J Global Optim 9:113–119

    Article  MathSciNet  MATH  Google Scholar 

  12. Pardalos PM (1990) Polynomial time algorithms for some classes of constrained nonconvex quadratic problems. Optim 21:843–853

    Article  MathSciNet  MATH  Google Scholar 

  13. Swarup K (1966) Programming with indefinite quadratic function with linear constraints. Cahiers CERO 8:132–136

    MATH  Google Scholar 

  14. Thoai NV (1991) A global optimization approach for solving the convex multiplicative programming problem. J Global Optim 1:341–357

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Tsukuba, Ibaraki, Japan

    Takahito Kuno

Authors
  1. Takahito Kuno
    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

Kuno, T. (2008). Multiplicative Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_432

Download citation

Publish with us

Policies and ethics

Search

Navigation