• Places
    • Home
    • Graphs
    • Prefixes
  • Amalgame
    • Alignment interface
    • Vocabulary browser
  • Admin
    • Users
    • Settings
    • Plugins
    • Statistics
  • Repository
    • Load local file
    • Load from HTTP
    • Load from library
    • Remove triples
    • Clear repository
  • Query
    • YASGUI SPARQL Editor
    • Simple Form
  • Help
    • Documentation
    • Tutorial
    • Roadmap
    • HTTP Services
  • Login

A.46.1 Introduction
AllApplicationManualNameSummaryHelp

  • Documentation
    • Reference manual
      • The SWI-Prolog library
        • library(simplex): Solve linear programming problems
          • Introduction
            • gen_state/1
            • constraint/3
            • maximize/3
            • minimize/3
            • variable_value/3
            • objective/2
    • Packages
Availability::- use_module(library(simplex)).
maximize(+Objective, +S0, -S)
Maximizes the objective function, stated as a list of Coefficient*Variable terms that represents the sum of its elements, with respect to the linear program corresponding to state S0. \arg{S} is unified with an internal representation of the solved instance.
ClioPatria (version no GIT?)