Minimum ConvexCost Network Flow Problems: A Solution Algorithm of Minimum ConvexCost Network Flow Problems (MCCNFP),Used

Minimum ConvexCost Network Flow Problems: A Solution Algorithm of Minimum ConvexCost Network Flow Problems (MCCNFP),Used

In Stock
SKU: DADAX3847372564
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$100.00
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

The Minimum ConvexCost Network Flow Problems (MCCNFP) is a class of network flow problem, with nonlinear (convex) cost function, has an important role in operations research. The convexity of the cost (or objective) function arise in various ways such as strictly convex, mixed linear and strictly convex, piecewise linear convex, pseudoconvex etc. A number of solution methods developed in the last few decades on the view of different type convexity of cost function. In this dissertation we have present a Proposed Solution Algorithm for MCCNFP, which can deals with convex cost function. This solution algorithm is constructed on the basis of Network Simplex Method for minimum cost network flow problem with linear cost function, Zangwills Convex Simplex Method (Zangwill I. W., 1967) and its extension for quadratic programming problem (Swarup K., 1977) and the decomposition of the convex simplex method for large scale convex programming problems (Hsia W. S., 1973, 1974, 1975) and NonLinear Transportation Problems (Terefe K., 2007).

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed